/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:36:31,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:36:31,921 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:36:31,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:36:31,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:36:31,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:36:31,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:36:31,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:36:31,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:36:31,966 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:36:31,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:36:31,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:36:31,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:36:31,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:36:31,970 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:36:31,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:36:31,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:36:31,971 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:36:31,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:36:31,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:36:31,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:36:31,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:36:31,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:36:31,974 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:36:31,974 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:36:31,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:36:31,974 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:36:31,974 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:36:31,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:36:31,975 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:36:31,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:36:31,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:36:31,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:36:31,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:36:31,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:36:31,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:36:31,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:36:31,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:36:31,977 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:36:31,977 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:36:31,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:36:31,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:36:31,978 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:36:31,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:36:31,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:36:31,978 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:36:31,978 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:36:32,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:36:32,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:36:32,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:36:32,202 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:36:32,204 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:36:32,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c [2023-12-25 04:36:33,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:36:33,496 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:36:33,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c [2023-12-25 04:36:33,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba7688f7/18ff5bc6192b4122a0ad68820710ba96/FLAG5cd1faab6 [2023-12-25 04:36:33,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ba7688f7/18ff5bc6192b4122a0ad68820710ba96 [2023-12-25 04:36:33,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:36:33,522 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:36:33,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:36:33,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:36:33,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:36:33,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:36:33" (1/1) ... [2023-12-25 04:36:33,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a7a9213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33, skipping insertion in model container [2023-12-25 04:36:33,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:36:33" (1/1) ... [2023-12-25 04:36:33,549 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:36:33,699 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c[537,550] [2023-12-25 04:36:33,721 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:36:33,732 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:36:33,745 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c[537,550] [2023-12-25 04:36:33,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:36:33,775 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:36:33,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33 WrapperNode [2023-12-25 04:36:33,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:36:33,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:36:33,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:36:33,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:36:33,782 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:36:33" (1/1) ... [2023-12-25 04:36:33,789 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:36:33" (1/1) ... [2023-12-25 04:36:33,804 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2023-12-25 04:36:33,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:36:33,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:36:33,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:36:33,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:36:33,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33" (1/1) ... [2023-12-25 04:36:33,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33" (1/1) ... [2023-12-25 04:36:33,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33" (1/1) ... [2023-12-25 04:36:33,839 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:36:33,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33" (1/1) ... [2023-12-25 04:36:33,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33" (1/1) ... [2023-12-25 04:36:33,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33" (1/1) ... [2023-12-25 04:36:33,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33" (1/1) ... [2023-12-25 04:36:33,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33" (1/1) ... [2023-12-25 04:36:33,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33" (1/1) ... [2023-12-25 04:36:33,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:36:33,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:36:33,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:36:33,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:36:33,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33" (1/1) ... [2023-12-25 04:36:33,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:36:33,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:36:33,893 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:36:33,927 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:36:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:36:33,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:36:33,935 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 04:36:33,936 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 04:36:33,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:36:33,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:36:33,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:36:33,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:36:33,995 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:36:33,999 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:36:34,275 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:36:34,297 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:36:34,297 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:36:34,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:36:34 BoogieIcfgContainer [2023-12-25 04:36:34,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:36:34,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:36:34,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:36:34,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:36:34,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:36:33" (1/3) ... [2023-12-25 04:36:34,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1247ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:36:34, skipping insertion in model container [2023-12-25 04:36:34,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:36:33" (2/3) ... [2023-12-25 04:36:34,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1247ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:36:34, skipping insertion in model container [2023-12-25 04:36:34,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:36:34" (3/3) ... [2023-12-25 04:36:34,305 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound10.c [2023-12-25 04:36:34,320 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:36:34,321 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:36:34,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:36:34,372 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;@5b0314fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:36:34,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:36:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:36:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:36:34,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:36:34,384 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:36:34,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:36:34,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:36:34,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1698673820, now seen corresponding path program 1 times [2023-12-25 04:36:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:36:34,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927934224] [2023-12-25 04:36:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:36:34,406 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:36:34,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:36:34,410 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:36:34,439 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:36:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:36:34,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:36:34,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:36:34,545 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:36:34,546 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:36:34,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:36:34,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927934224] [2023-12-25 04:36:34,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927934224] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:36:34,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:36:34,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:36:34,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828547699] [2023-12-25 04:36:34,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:36:34,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:36:34,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:36:34,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:36:34,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:36:34,575 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:36:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:36:34,597 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2023-12-25 04:36:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:36:34,599 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:36:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:36:34,604 INFO L225 Difference]: With dead ends: 46 [2023-12-25 04:36:34,604 INFO L226 Difference]: Without dead ends: 22 [2023-12-25 04:36:34,607 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:36:34,612 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:36:34,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:36:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-25 04:36:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-25 04:36:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:36:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-25 04:36:34,648 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 23 [2023-12-25 04:36:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:36:34,648 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-25 04:36:34,649 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:36:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-25 04:36:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:36:34,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:36:34,651 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:36:34,661 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:36:34,857 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:36:34,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:36:34,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:36:34,859 INFO L85 PathProgramCache]: Analyzing trace with hash 549966490, now seen corresponding path program 1 times [2023-12-25 04:36:34,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:36:34,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302231183] [2023-12-25 04:36:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:36:34,860 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:36:34,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:36:34,861 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:36:34,874 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:36:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:36:34,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 04:36:34,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:36:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:36:35,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:36:39,053 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:36:39,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:36:39,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302231183] [2023-12-25 04:36:39,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302231183] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:36:39,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:36:39,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 04:36:39,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179441896] [2023-12-25 04:36:39,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:36:39,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:36:39,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:36:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:36:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 04:36:39,057 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 04:36:45,224 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:36:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:36:47,375 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2023-12-25 04:36:47,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 04:36:47,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-25 04:36:47,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:36:47,393 INFO L225 Difference]: With dead ends: 34 [2023-12-25 04:36:47,393 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 04:36:47,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 04:36:47,395 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:36:47,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 67 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2023-12-25 04:36:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 04:36:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-12-25 04:36:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:36:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-12-25 04:36:47,402 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2023-12-25 04:36:47,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:36:47,403 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-12-25 04:36:47,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 04:36:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-12-25 04:36:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 04:36:47,404 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:36:47,404 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:36:47,416 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:36:47,610 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:36:47,611 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:36:47,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:36:47,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1559575677, now seen corresponding path program 1 times [2023-12-25 04:36:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:36:47,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651963409] [2023-12-25 04:36:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:36:47,612 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:36:47,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:36:47,613 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:36:47,615 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:36:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:36:47,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 04:36:47,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:36:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:36:48,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:36:48,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:36:48,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651963409] [2023-12-25 04:36:48,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651963409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:36:48,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:36:48,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 04:36:48,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781896250] [2023-12-25 04:36:48,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:36:48,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 04:36:48,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:36:48,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 04:36:48,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 04:36:48,039 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 04:36:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:36:48,594 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-12-25 04:36:48,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 04:36:48,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2023-12-25 04:36:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:36:48,595 INFO L225 Difference]: With dead ends: 38 [2023-12-25 04:36:48,595 INFO L226 Difference]: Without dead ends: 31 [2023-12-25 04:36:48,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-25 04:36:48,597 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 04:36:48,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 04:36:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-25 04:36:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-25 04:36:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:36:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-12-25 04:36:48,604 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 29 [2023-12-25 04:36:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:36:48,604 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-12-25 04:36:48,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 04:36:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-12-25 04:36:48,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 04:36:48,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:36:48,606 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:36:48,612 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:36:48,812 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:36:48,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:36:48,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:36:48,813 INFO L85 PathProgramCache]: Analyzing trace with hash 191228685, now seen corresponding path program 1 times [2023-12-25 04:36:48,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:36:48,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77033906] [2023-12-25 04:36:48,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:36:48,814 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:36:48,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:36:48,815 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:36:48,818 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:36:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:36:48,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 04:36:48,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:37:02,632 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:37:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:37:03,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:37:53,659 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (or (not (= (bvsrem .cse0 (_ bv2 64)) (_ bv1 64))) (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvmul .cse1 .cse0) (bvadd .cse1 (bvmul (bvmul .cse1 (bvsdiv (bvadd (_ bv18446744073709551615 64) .cse0) (_ bv2 64))) (_ bv2 64))))))) is different from true [2023-12-25 04:38:10,452 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:38:54,458 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_10|))) (or (not (= (bvsrem .cse0 (_ bv2 64)) (_ bv1 64))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_11|))) (= (bvadd .cse1 (bvmul (_ bv2 64) (bvmul .cse1 (bvsdiv (bvadd (_ bv18446744073709551615 64) .cse0) (_ bv2 64))))) (bvmul .cse1 .cse0)))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:39:23,865 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_10|))) (or (not (= (bvsrem .cse0 (_ bv2 64)) (_ bv1 64))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_11|))) (= (bvadd .cse1 (bvmul (_ bv2 64) (bvmul .cse1 (bvsdiv (bvadd (_ bv18446744073709551615 64) .cse0) (_ 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:39:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 5 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 04:39:23,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:39:23,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77033906] [2023-12-25 04:39:23,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77033906] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:39:23,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:39:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2023-12-25 04:39:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611264354] [2023-12-25 04:39:23,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:39:23,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 04:39:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:39:23,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 04:39:23,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=197, Unknown=4, NotChecked=90, Total=342 [2023-12-25 04:39:23,924 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 04:40:02,996 WARN L293 SmtUtils]: Spent 12.87s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:40:31,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:40:54,398 WARN L293 SmtUtils]: Spent 6.35s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:40:57,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:41:01,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:41:18,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:41:23,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:41:28,143 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:41:32,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:41:36,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:41:40,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:41:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:41:54,453 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2023-12-25 04:41:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 04:41:54,454 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 32 [2023-12-25 04:41:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:41:54,455 INFO L225 Difference]: With dead ends: 56 [2023-12-25 04:41:54,455 INFO L226 Difference]: Without dead ends: 54 [2023-12-25 04:41:54,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 142.8s TimeCoverageRelationStatistics Valid=134, Invalid=470, Unknown=8, NotChecked=144, Total=756 [2023-12-25 04:41:54,457 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 69 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 28 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 51.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:41:54,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 133 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 228 Invalid, 8 Unknown, 187 Unchecked, 51.0s Time] [2023-12-25 04:41:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-25 04:41:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2023-12-25 04:41:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 04:41:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2023-12-25 04:41:54,467 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 32 [2023-12-25 04:41:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:41:54,467 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-12-25 04:41:54,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 15 states have internal predecessors, (32), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 04:41:54,468 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2023-12-25 04:41:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 04:41:54,469 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:41:54,469 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:41:54,476 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:41:54,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:41:54,677 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:41:54,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:41:54,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1307708752, now seen corresponding path program 1 times [2023-12-25 04:41:54,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:41:54,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854516898] [2023-12-25 04:41:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:41:54,678 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:41:54,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:41:54,679 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:41:54,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 04:41:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:41:54,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 04:41:54,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:42:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 04:42:09,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:42:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 04:42:16,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:42:16,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854516898] [2023-12-25 04:42:16,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854516898] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:42:16,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:42:16,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 19 [2023-12-25 04:42:16,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627471944] [2023-12-25 04:42:16,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:42:16,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 04:42:16,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:42:16,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 04:42:16,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-12-25 04:42:16,709 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 04:42:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:42:31,666 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2023-12-25 04:42:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 04:42:31,666 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2023-12-25 04:42:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:42:31,668 INFO L225 Difference]: With dead ends: 61 [2023-12-25 04:42:31,668 INFO L226 Difference]: Without dead ends: 53 [2023-12-25 04:42:31,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2023-12-25 04:42:31,669 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-12-25 04:42:31,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 154 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2023-12-25 04:42:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-25 04:42:31,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2023-12-25 04:42:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 04:42:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-12-25 04:42:31,685 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 38 [2023-12-25 04:42:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:42:31,685 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-12-25 04:42:31,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 04:42:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-12-25 04:42:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 04:42:31,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:42:31,687 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:42:31,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 04:42:31,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:42:31,894 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:42:31,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:42:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash -15673798, now seen corresponding path program 1 times [2023-12-25 04:42:31,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:42:31,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404667836] [2023-12-25 04:42:31,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:42:31,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:42:31,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:42:31,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:42:31,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 04:42:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:42:32,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 04:42:32,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:42:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 04:42:58,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:44:32,393 WARN L293 SmtUtils]: Spent 9.33s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:44:45,065 WARN L293 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:44:59,682 WARN L293 SmtUtils]: Spent 5.14s 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:45:09,106 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (.cse0 (bvsdiv |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (or (= (bvsrem .cse0 (_ bv2 64)) (_ bv1 64)) (not (= .cse1 (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse0) (_ bv2 64))))) (= .cse1 (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| (bvsdiv .cse0 (_ bv2 64))) (_ bv4 64)))))) is different from true [2023-12-25 04:45:17,490 WARN L293 SmtUtils]: Spent 5.08s 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:45:29,679 WARN L293 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:45:34,491 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (.cse0 (bvsdiv |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (or (= (bvsrem .cse0 (_ bv2 64)) (_ bv1 64)) (not (= .cse1 (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse0) (_ bv2 64))))) (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (= .cse1 (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul (bvmul |c_ULTIMATE.start_main_~x~0#1| (bvsdiv .cse0 (_ bv2 64))) (_ bv4 64)))))) is different from true [2023-12-25 04:45:41,575 WARN L293 SmtUtils]: Spent 5.32s 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:45:55,361 WARN L293 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:46:01,939 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:46:10,025 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:46:30,387 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:47:39,481 WARN L293 SmtUtils]: Spent 11.95s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:48:02,002 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse3 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse1 (bvmul .cse2 .cse3)) (.cse0 (bvsdiv .cse3 (_ bv2 64)))) (or (not (bvsge |c_ULTIMATE.start_main_~b~0#1| (_ bv1 32))) (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64))) (= .cse1 (bvmul (bvmul .cse2 (bvsdiv .cse0 (_ bv2 64))) (_ bv4 64))) (not (= .cse1 (bvmul (_ bv2 64) (bvmul .cse2 .cse0))))))) is different from true [2023-12-25 04:49:10,747 WARN L293 SmtUtils]: Spent 13.63s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:49:45,503 WARN L293 SmtUtils]: Spent 8.30s 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:50:03,680 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_28| (_ BitVec 32)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_24| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_28|)) (.cse3 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_24|))) (let ((.cse1 (bvsdiv .cse3 (_ bv2 64))) (.cse2 (bvmul .cse0 .cse3))) (or (not (bvsge |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_24| (_ bv1 32))) (= (bvmul (bvmul .cse0 (bvsdiv .cse1 (_ bv2 64))) (_ bv4 64)) .cse2) (= (bvsrem .cse1 (_ bv2 64)) (_ bv1 64)) (not (= (bvmul (_ bv2 64) (bvmul .cse1 .cse0)) .cse2)))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:50:27,460 WARN L293 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:50:38,042 WARN L293 SmtUtils]: Spent 6.48s 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:50:55,778 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_28| (_ BitVec 32)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_24| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_28|)) (.cse3 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_24|))) (let ((.cse1 (bvsdiv .cse3 (_ bv2 64))) (.cse2 (bvmul .cse0 .cse3))) (or (not (bvsge |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_24| (_ bv1 32))) (= (bvmul (bvmul .cse0 (bvsdiv .cse1 (_ bv2 64))) (_ bv4 64)) .cse2) (= (bvsrem .cse1 (_ bv2 64)) (_ bv1 64)) (not (= (bvmul (_ bv2 64) (bvmul .cse1 .cse0)) .cse2)))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:50:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 10 not checked. [2023-12-25 04:50:55,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:50:55,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404667836] [2023-12-25 04:50:55,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404667836] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:50:55,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:50:55,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 31 [2023-12-25 04:50:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848462673] [2023-12-25 04:50:55,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:50:55,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-25 04:50:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:50:55,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-25 04:50:55,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=531, Unknown=16, NotChecked=260, Total=930 [2023-12-25 04:50:55,908 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 31 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 25 states have internal predecessors, (48), 10 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 04:51:00,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-12-25 04:51:14,505 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:51:14,505 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 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 04:51:15,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 04:51:15,706 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:51:15,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 254.8s TimeCoverageRelationStatistics Valid=129, Invalid=576, Unknown=17, NotChecked=270, Total=992 [2023-12-25 04:51:15,747 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-12-25 04:51:15,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 30 Unchecked, 9.7s Time] [2023-12-25 04:51:15,749 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 04:51:15,749 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-25 04:51:15,753 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-25 04:51:15,756 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 04:51:15,756 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:51:15,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:51:15 BoogieIcfgContainer [2023-12-25 04:51:15,764 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 04:51:15,764 INFO L158 Benchmark]: Toolchain (without parser) took 882242.04ms. Allocated memory was 198.2MB in the beginning and 245.4MB in the end (delta: 47.2MB). Free memory was 151.4MB in the beginning and 93.8MB in the end (delta: 57.7MB). Peak memory consumption was 106.1MB. Max. memory is 8.0GB. [2023-12-25 04:51:15,764 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 198.2MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:51:15,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.40ms. Allocated memory is still 198.2MB. Free memory was 151.4MB in the beginning and 139.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 04:51:15,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.10ms. Allocated memory is still 198.2MB. Free memory was 139.9MB in the beginning and 138.7MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 04:51:15,765 INFO L158 Benchmark]: Boogie Preprocessor took 58.07ms. Allocated memory is still 198.2MB. Free memory was 138.7MB in the beginning and 136.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 04:51:15,765 INFO L158 Benchmark]: RCFGBuilder took 433.45ms. Allocated memory is still 198.2MB. Free memory was 136.8MB in the beginning and 124.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 04:51:15,765 INFO L158 Benchmark]: TraceAbstraction took 881463.82ms. Allocated memory was 198.2MB in the beginning and 245.4MB in the end (delta: 47.2MB). Free memory was 124.2MB in the beginning and 93.8MB in the end (delta: 30.5MB). Peak memory consumption was 78.8MB. Max. memory is 8.0GB. [2023-12-25 04:51:15,767 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.51ms. Allocated memory is still 198.2MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.40ms. Allocated memory is still 198.2MB. Free memory was 151.4MB in the beginning and 139.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.10ms. Allocated memory is still 198.2MB. Free memory was 139.9MB in the beginning and 138.7MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.07ms. Allocated memory is still 198.2MB. Free memory was 138.7MB in the beginning and 136.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 433.45ms. Allocated memory is still 198.2MB. Free memory was 136.8MB in the beginning and 124.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 881463.82ms. Allocated memory was 198.2MB in the beginning and 245.4MB in the end (delta: 47.2MB). Free memory was 124.2MB in the beginning and 93.8MB in the end (delta: 30.5MB). Peak memory consumption was 78.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 881.4s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 194.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 78.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 147 mSDsluCounter, 490 SdHoareTripleChecker+Invalid, 72.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 217 IncrementalHoareTripleChecker+Unchecked, 398 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 639 IncrementalHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 92 mSDtfsCounter, 639 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 421.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=5, InterpolantAutomatonStates: 50, 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, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 685.2s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 310 ConstructedInterpolants, 10 QuantifiedInterpolants, 2504 SizeOfPredicates, 23 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 133/186 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