/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/prod4br-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:24:53,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:24:53,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 04:24:53,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:24:53,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:24:53,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:24:53,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:24:53,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:24:53,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:24:53,859 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:24:53,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:24:53,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:24:53,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:24:53,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:24:53,861 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:24:53,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:24:53,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:24:53,862 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:24:53,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:24:53,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:24:53,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:24:53,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:24:53,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:24:53,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:24:53,871 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:24:53,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:24:53,872 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:24:53,872 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:24:53,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:24:53,872 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:24:53,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:24:53,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:24:53,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:24:53,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:24:53,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:24:53,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:24:53,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:24:53,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:24:53,875 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:24:53,875 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:24:53,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:24:53,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:24:53,875 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:24:53,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:24:53,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:24:53,876 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:24:53,876 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 04:24:54,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:24:54,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:24:54,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:24:54,151 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:24:54,151 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:24:54,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound100.c [2023-12-25 04:24:55,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:24:55,567 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:24:55,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound100.c [2023-12-25 04:24:55,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21daa443/a1c1db554f3f4f3a83e30f0b05d1233e/FLAGb4c2aae33 [2023-12-25 04:24:55,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21daa443/a1c1db554f3f4f3a83e30f0b05d1233e [2023-12-25 04:24:55,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:24:55,590 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:24:55,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:24:55,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:24:55,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:24:55,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d05f70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55, skipping insertion in model container [2023-12-25 04:24:55,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,627 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:24:55,789 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/prod4br-ll_valuebound100.c[524,537] [2023-12-25 04:24:55,833 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:24:55,845 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:24:55,858 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/prod4br-ll_valuebound100.c[524,537] [2023-12-25 04:24:55,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:24:55,899 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:24:55,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55 WrapperNode [2023-12-25 04:24:55,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:24:55,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:24:55,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:24:55,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:24:55,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,938 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-12-25 04:24:55,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:24:55,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:24:55,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:24:55,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:24:55,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,965 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 04:24:55,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:24:55,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:24:55,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:24:55,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:24:55,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (1/1) ... [2023-12-25 04:24:55,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:24:56,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:24:56,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 04:24:56,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 04:24:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:24:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:24:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 04:24:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 04:24:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:24:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:24:56,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:24:56,044 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:24:56,091 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:24:56,093 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:24:56,876 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:24:56,895 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:24:56,895 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:24:56,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:24:56 BoogieIcfgContainer [2023-12-25 04:24:56,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:24:56,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:24:56,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:24:56,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:24:56,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:24:55" (1/3) ... [2023-12-25 04:24:56,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df94d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:24:56, skipping insertion in model container [2023-12-25 04:24:56,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:24:55" (2/3) ... [2023-12-25 04:24:56,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df94d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:24:56, skipping insertion in model container [2023-12-25 04:24:56,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:24:56" (3/3) ... [2023-12-25 04:24:56,903 INFO L112 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound100.c [2023-12-25 04:24:56,917 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:24:56,918 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:24:56,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:24:56,962 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;@1efc68d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:24:56,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:24:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:24:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:24:56,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:24:56,971 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:24:56,972 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:24:56,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:24:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1790489630, now seen corresponding path program 1 times [2023-12-25 04:24:56,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:24:56,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013432106] [2023-12-25 04:24:56,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:24:56,986 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:24:56,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:24:56,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:24:56,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 04:24:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:24:57,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:24:57,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:24:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 04:24:57,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:24:57,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:24:57,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013432106] [2023-12-25 04:24:57,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013432106] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:24:57,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:24:57,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:24:57,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150985639] [2023-12-25 04:24:57,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:24:57,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:24:57,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:24:57,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:24:57,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:24:57,158 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:24:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:24:57,197 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2023-12-25 04:24:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:24:57,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-25 04:24:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:24:57,208 INFO L225 Difference]: With dead ends: 50 [2023-12-25 04:24:57,208 INFO L226 Difference]: Without dead ends: 24 [2023-12-25 04:24:57,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:24:57,215 INFO L413 NwaCegarLoop]: 31 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, 31 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:24:57,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:24:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-25 04:24:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-25 04:24:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:24:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-25 04:24:57,252 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 23 [2023-12-25 04:24:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:24:57,252 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-25 04:24:57,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:24:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-25 04:24:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:24:57,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:24:57,255 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:24:57,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 04:24:57,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:24:57,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:24:57,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:24:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash 641782300, now seen corresponding path program 1 times [2023-12-25 04:24:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:24:57,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127381848] [2023-12-25 04:24:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:24:57,465 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:24:57,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:24:57,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:24:57,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 04:24:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:24:59,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 04:24:59,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:24:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:24:59,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:24:59,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:24:59,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127381848] [2023-12-25 04:24:59,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127381848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:24:59,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:24:59,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 04:24:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404603717] [2023-12-25 04:24:59,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:24:59,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 04:24:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:24:59,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 04:24:59,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 04:24:59,834 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 04:25:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:25:01,746 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2023-12-25 04:25:01,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 04:25:01,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2023-12-25 04:25:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:25:01,753 INFO L225 Difference]: With dead ends: 38 [2023-12-25 04:25:01,753 INFO L226 Difference]: Without dead ends: 36 [2023-12-25 04:25:01,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-25 04:25:01,754 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-25 04:25:01,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 80 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-25 04:25:01,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-25 04:25:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2023-12-25 04:25:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:25:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-12-25 04:25:01,767 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2023-12-25 04:25:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:25:01,768 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-12-25 04:25:01,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 04:25:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-12-25 04:25:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 04:25:01,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:25:01,770 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:25:01,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 04:25:01,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:25:01,979 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:25:01,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:25:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1418577099, now seen corresponding path program 1 times [2023-12-25 04:25:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:25:01,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876684009] [2023-12-25 04:25:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:25:01,981 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:25:01,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:25:01,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:25:01,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 04:25:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:25:02,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 04:25:02,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:25:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:25:02,789 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:25:02,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:25:02,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876684009] [2023-12-25 04:25:02,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876684009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:25:02,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:25:02,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 04:25:02,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974543635] [2023-12-25 04:25:02,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:25:02,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 04:25:02,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:25:02,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 04:25:02,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-25 04:25:02,791 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:25:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:25:04,647 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-12-25 04:25:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 04:25:04,657 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2023-12-25 04:25:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:25:04,658 INFO L225 Difference]: With dead ends: 42 [2023-12-25 04:25:04,658 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 04:25:04,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-25 04:25:04,660 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 04:25:04,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 111 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 04:25:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 04:25:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-12-25 04:25:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:25:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-12-25 04:25:04,667 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2023-12-25 04:25:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:25:04,667 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-12-25 04:25:04,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:25:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-12-25 04:25:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 04:25:04,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:25:04,669 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:25:04,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 04:25:04,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:25:04,870 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:25:04,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:25:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1440936176, now seen corresponding path program 1 times [2023-12-25 04:25:04,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:25:04,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614305057] [2023-12-25 04:25:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:25:04,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:25:04,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:25:04,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:25:04,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 04:25:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:25:05,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-25 04:25:05,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:25:23,589 WARN L293 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:25:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:25:25,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:26:55,271 WARN L293 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:27:06,908 WARN L293 SmtUtils]: Spent 6.58s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:27:16,591 WARN L293 SmtUtils]: Spent 5.32s 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:27:22,173 WARN L293 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:27:37,266 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|)))) (or (= (bvadd |c_ULTIMATE.start_main_~q~0#1| (bvmul (bvmul (bvsdiv |c_ULTIMATE.start_main_~b~0#1| (_ bv2 64)) (bvsdiv |c_ULTIMATE.start_main_~a~0#1| (_ bv2 64)) |c_ULTIMATE.start_main_~p~0#1|) (_ bv4 64))) .cse0) (not (= .cse0 (bvadd |c_ULTIMATE.start_main_~q~0#1| (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~p~0#1|)))) (not (= (_ bv0 64) (bvsrem |c_ULTIMATE.start_main_~b~0#1| (_ bv2 64)))) (not (= (_ bv0 64) (bvsrem |c_ULTIMATE.start_main_~a~0#1| (_ bv2 64)))))) is different from true [2023-12-25 04:27:44,602 WARN L293 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:27:54,440 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:28:08,772 WARN L293 SmtUtils]: Spent 5.11s 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:28:17,497 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (or (= (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse0 .cse1)) (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))))) is different from true [2023-12-25 04:28:25,843 WARN L293 SmtUtils]: Spent 8.25s 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:28:43,232 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (or (= (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse0 .cse1)) (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (not (bvsge |c_ULTIMATE.start_main_~y~0#1| (_ bv1 32))) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))))) is different from true [2023-12-25 04:29:00,405 WARN L293 SmtUtils]: Spent 8.29s 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:29:13,754 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13|))) (or (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (bvsge |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10| (_ bv1 32)) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))) (= (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse1 .cse0))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:29:30,706 WARN L293 SmtUtils]: Spent 8.28s 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:29:56,430 WARN L293 SmtUtils]: Spent 8.29s 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:30:09,821 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13|))) (or (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (bvsge |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10| (_ bv1 32)) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))) (= (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse1 .cse0))))) (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:30:18,205 WARN L293 SmtUtils]: Spent 8.28s 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:30:35,127 WARN L293 SmtUtils]: Spent 8.29s 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:30:43,874 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (or (forall ((|ULTIMATE.start_main_~y~0#1| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))) (or (not (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv100 32))) (= (bvmul (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64))) (_ bv4 64)) (bvmul .cse1 .cse0)) (not (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32))) (not (= (bvsrem .cse1 (_ bv2 64)) (_ bv0 64)))))) (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))))) is different from true [2023-12-25 04:30:43,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:30:43,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614305057] [2023-12-25 04:30:43,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614305057] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:30:43,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [569674795] [2023-12-25 04:30:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:30:43,876 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 04:30:43,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 04:30:43,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 04:30:43,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-25 04:30:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:30:44,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 04:30:44,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:30:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:30:55,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:31:24,663 WARN L293 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:31:39,012 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:31:48,564 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:31:59,273 WARN L293 SmtUtils]: Spent 5.65s 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:32:07,686 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:32:26,294 WARN L293 SmtUtils]: Spent 5.11s 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:32:34,682 WARN L293 SmtUtils]: Spent 8.29s 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:33:08,886 WARN L293 SmtUtils]: Spent 8.29s 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:33:17,459 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_19| (_ BitVec 32)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_19|)) (.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15|))) (or (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (= (bvmul .cse0 .cse1) (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64))))) (bvsge |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (_ bv1 32)) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:33:38,606 WARN L293 SmtUtils]: Spent 8.29s 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:34:04,614 WARN L293 SmtUtils]: Spent 8.28s 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:34:13,189 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_19| (_ BitVec 32)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_19|)) (.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15|))) (or (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (= (bvmul .cse0 .cse1) (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64))))) (bvsge |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (_ bv1 32)) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:34:21,568 WARN L293 SmtUtils]: Spent 8.29s 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:34:38,457 WARN L293 SmtUtils]: Spent 8.27s 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:34:42,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [569674795] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:34:42,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:34:42,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2023-12-25 04:34:42,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313204500] [2023-12-25 04:34:42,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:34:42,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 04:34:42,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:34:42,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 04:34:42,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=285, Unknown=10, NotChecked=328, Total=702 [2023-12-25 04:34:42,803 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:34:49,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:52,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:35:03,051 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2023-12-25 04:35:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 04:35:03,060 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2023-12-25 04:35:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:35:03,061 INFO L225 Difference]: With dead ends: 52 [2023-12-25 04:35:03,061 INFO L226 Difference]: Without dead ends: 44 [2023-12-25 04:35:03,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 128.5s TimeCoverageRelationStatistics Valid=98, Invalid=386, Unknown=10, NotChecked=376, Total=870 [2023-12-25 04:35:03,063 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2023-12-25 04:35:03,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 129 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2023-12-25 04:35:03,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-25 04:35:03,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2023-12-25 04:35:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 04:35:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2023-12-25 04:35:03,070 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 31 [2023-12-25 04:35:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:35:03,070 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2023-12-25 04:35:03,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:35:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2023-12-25 04:35:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 04:35:03,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:35:03,071 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:35:03,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 04:35:03,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-25 04:35:03,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 04:35:03,482 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:35:03,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:35:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash 404329846, now seen corresponding path program 1 times [2023-12-25 04:35:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:35:03,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897238084] [2023-12-25 04:35:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:35:03,483 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:35:03,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:35:03,484 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:35:03,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 04:35:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:35:04,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 04:35:04,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:35:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:35:06,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:36:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:36:10,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:36:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897238084] [2023-12-25 04:36:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897238084] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:36:10,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:36:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2023-12-25 04:36:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982855512] [2023-12-25 04:36:10,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:36:10,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 04:36:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:36:10,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 04:36:10,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-12-25 04:36:10,642 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 04:36:20,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:36:24,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:36:28,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:36:42,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:36:46,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:07,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:11,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:15,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:22,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:27,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:31,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:35,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:39,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:37:39,939 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2023-12-25 04:37:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 04:37:39,951 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 32 [2023-12-25 04:37:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:37:39,953 INFO L225 Difference]: With dead ends: 69 [2023-12-25 04:37:39,953 INFO L226 Difference]: Without dead ends: 55 [2023-12-25 04:37:39,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 77.9s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2023-12-25 04:37:39,954 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 77 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 41 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.3s IncrementalHoareTripleChecker+Time [2023-12-25 04:37:39,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 121 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 250 Invalid, 8 Unknown, 0 Unchecked, 59.3s Time] [2023-12-25 04:37:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-25 04:37:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2023-12-25 04:37:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 37 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 04:37:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-12-25 04:37:39,966 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 32 [2023-12-25 04:37:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:37:39,966 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-12-25 04:37:39,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 04:37:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-12-25 04:37:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 04:37:39,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:37:39,969 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:37:39,978 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 (7)] Ended with exit code 0 [2023-12-25 04:37:40,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:37:40,170 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:37:40,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:37:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1973405737, now seen corresponding path program 1 times [2023-12-25 04:37:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:37:40,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757852590] [2023-12-25 04:37:40,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:37:40,171 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:37:40,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:37:40,173 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:37:40,174 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:37:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:37:41,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 04:37:41,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:37:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:37:43,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:39:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:39:10,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:39:10,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757852590] [2023-12-25 04:39:10,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757852590] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:39:10,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:39:10,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2023-12-25 04:39:10,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198041128] [2023-12-25 04:39:10,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:39:10,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 04:39:10,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:39:10,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 04:39:10,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-12-25 04:39:10,881 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 04:39:23,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:39:25,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:39:31,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:39:34,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-25 04:39:36,579 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:39:36,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:39:36,593 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:39:37,598 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:39:37,798 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:39:37,826 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:39:37,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 04:39:37,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 68.3s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-12-25 04:39:37,828 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2023-12-25 04:39:37,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 76 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 20.7s Time] [2023-12-25 04:39:37,829 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 04:39:37,830 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (51states) and FLOYD_HOARE automaton (currently 9 states, 20 states before enhancement),while executing Executor. [2023-12-25 04:39:37,833 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-25 04:39:37,834 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 04:39:37,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:39:37 BoogieIcfgContainer [2023-12-25 04:39:37,836 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 04:39:37,836 INFO L158 Benchmark]: Toolchain (without parser) took 882246.31ms. Allocated memory was 197.1MB in the beginning and 272.6MB in the end (delta: 75.5MB). Free memory was 152.5MB in the beginning and 207.8MB in the end (delta: -55.3MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. [2023-12-25 04:39:37,837 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 197.1MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:39:37,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.40ms. Allocated memory is still 197.1MB. Free memory was 152.5MB in the beginning and 140.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 04:39:37,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.94ms. Allocated memory is still 197.1MB. Free memory was 140.4MB in the beginning and 138.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 04:39:37,837 INFO L158 Benchmark]: Boogie Preprocessor took 36.09ms. Allocated memory is still 197.1MB. Free memory was 138.9MB in the beginning and 136.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 04:39:37,838 INFO L158 Benchmark]: RCFGBuilder took 919.88ms. Allocated memory is still 197.1MB. Free memory was 136.8MB in the beginning and 123.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 04:39:37,838 INFO L158 Benchmark]: TraceAbstraction took 880938.37ms. Allocated memory was 197.1MB in the beginning and 272.6MB in the end (delta: 75.5MB). Free memory was 122.6MB in the beginning and 207.8MB in the end (delta: -85.3MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:39:37,839 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.61ms. Allocated memory is still 197.1MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.40ms. Allocated memory is still 197.1MB. Free memory was 152.5MB in the beginning and 140.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.94ms. Allocated memory is still 197.1MB. Free memory was 140.4MB in the beginning and 138.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.09ms. Allocated memory is still 197.1MB. Free memory was 138.9MB in the beginning and 136.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 919.88ms. Allocated memory is still 197.1MB. Free memory was 136.8MB in the beginning and 123.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 880938.37ms. Allocated memory was 197.1MB in the beginning and 272.6MB in the end (delta: 75.5MB). Free memory was 122.6MB in the beginning and 207.8MB in the end (delta: -85.3MB). There was no memory consumed. 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: 14]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 14). Cancelled while NwaCegarLoop was constructing difference of abstraction (51states) and FLOYD_HOARE automaton (currently 9 states, 20 states before enhancement),while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 880.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 140.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 212 SdHoareTripleChecker+Valid, 95.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 548 SdHoareTripleChecker+Invalid, 92.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 448 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 856 IncrementalHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 100 mSDtfsCounter, 856 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 275.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=5, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 734.0s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 1985 SizeOfPredicates, 30 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 114/134 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