/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_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:25:06,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:25:06,804 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:25:06,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:25:06,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:25:06,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:25:06,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:25:06,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:25:06,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:25:06,838 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:25:06,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:25:06,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:25:06,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:25:06,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:25:06,840 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:25:06,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:25:06,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:25:06,841 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:25:06,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:25:06,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:25:06,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:25:06,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:25:06,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:25:06,842 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:25:06,842 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:25:06,842 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:25:06,843 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:25:06,843 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:25:06,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:25:06,843 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:25:06,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:25:06,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:25:06,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:25:06,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:25:06,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:25:06,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:25:06,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:25:06,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:25:06,845 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:25:06,845 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:25:06,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:25:06,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:25:06,845 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:25:06,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:25:06,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:25:06,846 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:25:06,846 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:25:07,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:25:07,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:25:07,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:25:07,056 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:25:07,056 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:25:07,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound2.c [2023-12-25 04:25:08,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:25:08,229 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:25:08,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound2.c [2023-12-25 04:25:08,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a1aa441/390b9eca82864cd1a92eb4320a955efd/FLAGb6832030c [2023-12-25 04:25:08,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a1aa441/390b9eca82864cd1a92eb4320a955efd [2023-12-25 04:25:08,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:25:08,250 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:25:08,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:25:08,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:25:08,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:25:08,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:25:08" (1/1) ... [2023-12-25 04:25:08,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc1fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08, skipping insertion in model container [2023-12-25 04:25:08,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:25:08" (1/1) ... [2023-12-25 04:25:08,273 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:25:08,395 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_valuebound2.c[524,537] [2023-12-25 04:25:08,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:25:08,431 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:25:08,442 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_valuebound2.c[524,537] [2023-12-25 04:25:08,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:25:08,473 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:25:08,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08 WrapperNode [2023-12-25 04:25:08,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:25:08,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:25:08,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:25:08,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:25:08,480 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:25:08" (1/1) ... [2023-12-25 04:25:08,486 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:25:08" (1/1) ... [2023-12-25 04:25:08,501 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-12-25 04:25:08,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:25:08,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:25:08,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:25:08,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:25:08,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08" (1/1) ... [2023-12-25 04:25:08,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08" (1/1) ... [2023-12-25 04:25:08,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08" (1/1) ... [2023-12-25 04:25:08,529 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:25:08,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08" (1/1) ... [2023-12-25 04:25:08,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08" (1/1) ... [2023-12-25 04:25:08,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08" (1/1) ... [2023-12-25 04:25:08,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08" (1/1) ... [2023-12-25 04:25:08,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08" (1/1) ... [2023-12-25 04:25:08,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08" (1/1) ... [2023-12-25 04:25:08,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:25:08,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:25:08,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:25:08,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:25:08,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08" (1/1) ... [2023-12-25 04:25:08,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:25:08,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:25:08,562 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:25:08,580 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:25:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:25:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:25:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 04:25:08,586 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 04:25:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:25:08,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:25:08,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:25:08,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:25:08,640 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:25:08,641 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:25:09,324 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:25:09,345 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:25:09,346 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:25:09,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:25:09 BoogieIcfgContainer [2023-12-25 04:25:09,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:25:09,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:25:09,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:25:09,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:25:09,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:25:08" (1/3) ... [2023-12-25 04:25:09,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41eadfab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:25:09, skipping insertion in model container [2023-12-25 04:25:09,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:08" (2/3) ... [2023-12-25 04:25:09,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41eadfab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:25:09, skipping insertion in model container [2023-12-25 04:25:09,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:25:09" (3/3) ... [2023-12-25 04:25:09,351 INFO L112 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound2.c [2023-12-25 04:25:09,365 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:25:09,366 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:25:09,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:25:09,399 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;@4b2c7ef8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:25:09,399 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:25:09,402 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:25:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:25:09,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:25:09,408 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:25:09,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:25:09,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:25:09,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1790489630, now seen corresponding path program 1 times [2023-12-25 04:25:09,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:25:09,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667312473] [2023-12-25 04:25:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:25:09,422 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:09,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:25:09,424 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:25:09,449 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:25:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:25:09,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:25:09,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:25:09,589 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:25:09,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:25:09,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:25:09,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667312473] [2023-12-25 04:25:09,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667312473] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:25:09,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:25:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:25:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40492802] [2023-12-25 04:25:09,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:25:09,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:25:09,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:25:09,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:25:09,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:25:09,624 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:25:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:25:09,655 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2023-12-25 04:25:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:25:09,657 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:25:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:25:09,662 INFO L225 Difference]: With dead ends: 50 [2023-12-25 04:25:09,662 INFO L226 Difference]: Without dead ends: 24 [2023-12-25 04:25:09,664 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:25:09,667 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:25:09,668 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:25:09,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-25 04:25:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-25 04:25:09,693 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:25:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-25 04:25:09,695 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 23 [2023-12-25 04:25:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:25:09,695 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-25 04:25:09,696 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:25:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-25 04:25:09,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:25:09,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:25:09,698 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:25:09,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 04:25:09,908 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:25:09,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:25:09,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:25:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 641782300, now seen corresponding path program 1 times [2023-12-25 04:25:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:25:09,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242032823] [2023-12-25 04:25:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:25:09,910 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:09,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:25:09,911 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:25:09,912 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:25:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:25:10,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 04:25:10,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:25:10,392 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:25:10,392 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:25:10,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:25:10,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242032823] [2023-12-25 04:25:10,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242032823] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:25:10,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:25:10,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 04:25:10,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614525519] [2023-12-25 04:25:10,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:25:10,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 04:25:10,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:25:10,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 04:25:10,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 04:25:10,397 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:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:25:12,011 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2023-12-25 04:25:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 04:25:12,017 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:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:25:12,018 INFO L225 Difference]: With dead ends: 38 [2023-12-25 04:25:12,018 INFO L226 Difference]: Without dead ends: 36 [2023-12-25 04:25:12,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-25 04:25:12,019 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2023-12-25 04:25:12,019 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.6s Time] [2023-12-25 04:25:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-25 04:25:12,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2023-12-25 04:25:12,026 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:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-12-25 04:25:12,027 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2023-12-25 04:25:12,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:25:12,027 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-12-25 04:25:12,027 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:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-12-25 04:25:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 04:25:12,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:25:12,028 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:12,038 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:12,233 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:12,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:25:12,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:25:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1418577099, now seen corresponding path program 1 times [2023-12-25 04:25:12,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:25:12,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38294302] [2023-12-25 04:25:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:25:12,238 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:12,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:25:12,239 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:12,241 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:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:25:12,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 04:25:12,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:25:12,821 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:12,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:25:12,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:25:12,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38294302] [2023-12-25 04:25:12,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38294302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:25:12,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:25:12,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 04:25:12,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148479003] [2023-12-25 04:25:12,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:25:12,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 04:25:12,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:25:12,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 04:25:12,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-25 04:25:12,823 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:14,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:25:14,614 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-12-25 04:25:14,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 04:25:14,622 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:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:25:14,623 INFO L225 Difference]: With dead ends: 42 [2023-12-25 04:25:14,623 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 04:25:14,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-25 04:25:14,625 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:14,625 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:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 04:25:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-12-25 04:25:14,630 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:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-12-25 04:25:14,630 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2023-12-25 04:25:14,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:25:14,631 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-12-25 04:25:14,631 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:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-12-25 04:25:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 04:25:14,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:25:14,632 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:14,640 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:14,840 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:14,843 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:25:14,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:25:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1440936176, now seen corresponding path program 1 times [2023-12-25 04:25:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:25:14,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326487938] [2023-12-25 04:25:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:25:14,844 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:14,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:25:14,848 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:14,850 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:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:25:15,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 04:25:15,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:25:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:25:28,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:26:13,567 WARN L293 SmtUtils]: Spent 6.04s 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:27:00,591 WARN L293 SmtUtils]: Spent 10.37s 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:44,683 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:27:53,047 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:28:10,523 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:28:27,373 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:28:40,219 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:28:57,464 WARN L293 SmtUtils]: Spent 8.27s 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:23,374 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:36,256 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:29:56,844 WARN L293 SmtUtils]: Spent 8.27s 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:25,242 WARN L293 SmtUtils]: Spent 8.27s 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:33,648 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_14|))) (or (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))) (bvsle |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ bv2 32)) (= (bvmul .cse1 .cse0) (bvmul (bvmul (bvsdiv .cse1 (_ bv2 64)) (bvsdiv .cse0 (_ bv2 64))) (_ bv4 64)))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:30:55,109 WARN L293 SmtUtils]: Spent 8.27s 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:31:20,718 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:31:29,182 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_14|))) (or (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))) (bvsle |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ bv2 32)) (= (bvmul .cse1 .cse0) (bvmul (bvmul (bvsdiv .cse1 (_ bv2 64)) (bvsdiv .cse0 (_ bv2 64))) (_ bv4 64)))))) (= (_ 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:31:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 2 times theorem prover too weak. 3 trivial. 3 not checked. [2023-12-25 04:31:29,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:31:29,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326487938] [2023-12-25 04:31:29,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326487938] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:31:29,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:31:29,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2023-12-25 04:31:29,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439058169] [2023-12-25 04:31:29,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:31:29,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 04:31:29,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:31:29,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 04:31:29,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=220, Unknown=8, NotChecked=210, Total=506 [2023-12-25 04:31:29,268 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 17 states have internal predecessors, (33), 8 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 04:31:30,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 04:31:40,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:31:42,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:31:58,688 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:31:59,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:32:44,022 WARN L293 SmtUtils]: Spent 26.95s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:32:52,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:32:58,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:33:02,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:33:03,335 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:33:27,763 WARN L293 SmtUtils]: Spent 5.31s 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:33:31,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:33:35,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:33:40,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:33:44,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:33:48,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:33:52,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:33:56,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:00,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:05,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:09,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:13,418 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:34:16,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:21,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:25,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:29,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:32,670 WARN L293 SmtUtils]: Spent 32.93s on a formula simplification. DAG size of input: 38 DAG size of output: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:35:36,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:40,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:45,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:49,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:53,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:56,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:57,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:36:28,337 WARN L293 SmtUtils]: Spent 11.98s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:36:31,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:36:59,673 WARN L293 SmtUtils]: Spent 8.79s 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:37:02,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:04,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:37:06,327 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2023-12-25 04:37:06,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 04:37:06,417 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 17 states have internal predecessors, (33), 8 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 31 [2023-12-25 04:37:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:37:06,419 INFO L225 Difference]: With dead ends: 71 [2023-12-25 04:37:06,419 INFO L226 Difference]: Without dead ends: 57 [2023-12-25 04:37:06,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 308.9s TimeCoverageRelationStatistics Valid=135, Invalid=425, Unknown=16, NotChecked=294, Total=870 [2023-12-25 04:37:06,420 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 100 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 51 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 436 IncrementalHoareTripleChecker+Unchecked, 132.6s IncrementalHoareTripleChecker+Time [2023-12-25 04:37:06,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 135 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 243 Invalid, 21 Unknown, 436 Unchecked, 132.6s Time] [2023-12-25 04:37:06,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-25 04:37:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2023-12-25 04:37:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 04:37:06,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2023-12-25 04:37:06,429 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 31 [2023-12-25 04:37:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:37:06,431 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-12-25 04:37:06,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 17 states have internal predecessors, (33), 8 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 04:37:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2023-12-25 04:37:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 04:37:06,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:37:06,432 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:37:06,439 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 (5)] Ended with exit code 0 [2023-12-25 04:37:06,633 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:37:06,634 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:37:06,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:37:06,635 INFO L85 PathProgramCache]: Analyzing trace with hash -748842225, now seen corresponding path program 1 times [2023-12-25 04:37:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:37:06,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493625332] [2023-12-25 04:37:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:37:06,636 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:06,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:37:06,637 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:37:06,638 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:37:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:37:06,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 04:37:06,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:37:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 04:37:09,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:37:37,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:37:37,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493625332] [2023-12-25 04:37:37,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493625332] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 04:37:37,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [211683428] [2023-12-25 04:37:37,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:37:37,312 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 04:37:37,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 04:37:37,349 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 04:37:37,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-25 04:37:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:37:37,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 04:37:37,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:37:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 04:37:43,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:38:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 04:38:19,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [211683428] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:38:19,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 04:38:19,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 23 [2023-12-25 04:38:19,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662838869] [2023-12-25 04:38:19,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 04:38:19,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 04:38:19,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:38:19,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 04:38:19,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2023-12-25 04:38:19,450 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 18 states have internal predecessors, (38), 11 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2023-12-25 04:39:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:39:13,675 INFO L93 Difference]: Finished difference Result 117 states and 162 transitions. [2023-12-25 04:39:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 04:39:13,702 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 18 states have internal predecessors, (38), 11 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) Word has length 38 [2023-12-25 04:39:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:39:13,703 INFO L225 Difference]: With dead ends: 117 [2023-12-25 04:39:13,703 INFO L226 Difference]: Without dead ends: 87 [2023-12-25 04:39:13,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 84.2s TimeCoverageRelationStatistics Valid=294, Invalid=1266, Unknown=0, NotChecked=0, Total=1560 [2023-12-25 04:39:13,705 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 86 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2023-12-25 04:39:13,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 139 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 21.2s Time] [2023-12-25 04:39:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-25 04:39:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2023-12-25 04:39:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 52 states have internal predecessors, (65), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-25 04:39:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2023-12-25 04:39:13,719 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 38 [2023-12-25 04:39:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:39:13,720 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2023-12-25 04:39:13,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 18 states have internal predecessors, (38), 11 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2023-12-25 04:39:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2023-12-25 04:39:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 04:39:13,721 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:39:13,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:39:13,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-25 04:39:13,938 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:39:14,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:39:14,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:39:14,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:39:14,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2033404295, now seen corresponding path program 1 times [2023-12-25 04:39:14,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:39:14,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994767979] [2023-12-25 04:39:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:39:14,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:39:14,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:39:14,131 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:39:14,131 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:39:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:39:14,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 04:39:14,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:39:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 04:39:15,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:39:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 04:39:17,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:39:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994767979] [2023-12-25 04:39:17,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994767979] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:39:17,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:39:17,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-25 04:39:17,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500944709] [2023-12-25 04:39:17,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:39:17,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 04:39:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:39:17,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 04:39:17,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-25 04:39:17,172 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 8 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-25 04:39:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:39:23,591 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2023-12-25 04:39:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 04:39:23,601 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 8 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 42 [2023-12-25 04:39:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:39:23,602 INFO L225 Difference]: With dead ends: 121 [2023-12-25 04:39:23,602 INFO L226 Difference]: Without dead ends: 84 [2023-12-25 04:39:23,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2023-12-25 04:39:23,603 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-25 04:39:23,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 177 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-12-25 04:39:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-25 04:39:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2023-12-25 04:39:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 58 states have internal predecessors, (73), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 04:39:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2023-12-25 04:39:23,616 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 42 [2023-12-25 04:39:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:39:23,617 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2023-12-25 04:39:23,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 8 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-25 04:39:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2023-12-25 04:39:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 04:39:23,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:39:23,618 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:39:23,645 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:23,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:39:23,845 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:39:23,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:39:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash 753540617, now seen corresponding path program 1 times [2023-12-25 04:39:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:39:23,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726196454] [2023-12-25 04:39:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:39:23,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:39:23,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:39:23,846 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:39:23,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 04:39:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:39:24,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 04:39:24,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:39:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 04:39:26,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:39:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 04:39:29,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:39:29,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726196454] [2023-12-25 04:39:29,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726196454] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:39:29,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:39:29,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-12-25 04:39:29,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934085633] [2023-12-25 04:39:29,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:39:29,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 04:39:29,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:39:29,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 04:39:29,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-12-25 04:39:29,389 INFO L87 Difference]: Start difference. First operand 78 states and 106 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 04:39:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:39:32,685 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2023-12-25 04:39:32,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 04:39:32,695 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 42 [2023-12-25 04:39:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:39:32,696 INFO L225 Difference]: With dead ends: 95 [2023-12-25 04:39:32,696 INFO L226 Difference]: Without dead ends: 52 [2023-12-25 04:39:32,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2023-12-25 04:39:32,697 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-25 04:39:32,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 172 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-25 04:39:32,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-25 04:39:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2023-12-25 04:39:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 35 states have internal predecessors, (36), 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:39:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-12-25 04:39:32,707 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 42 [2023-12-25 04:39:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:39:32,707 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-12-25 04:39:32,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 04:39:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2023-12-25 04:39:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-25 04:39:32,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:39:32,708 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:39:32,722 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 (9)] Forceful destruction successful, exit code 0 [2023-12-25 04:39:32,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:39:32,920 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:39:32,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:39:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1258465685, now seen corresponding path program 1 times [2023-12-25 04:39:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:39:32,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680927407] [2023-12-25 04:39:32,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:39:32,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:39:32,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:39:32,922 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:39:32,925 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 (10)] Waiting until timeout for monitored process [2023-12-25 04:39:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:39:33,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 04:39:33,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:39:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 04:39:36,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-25 04:39:54,260 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 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 04:39:54,291 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:54,415 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 04:39:54,425 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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 04:39:54,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:39:54,616 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 45 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. [2023-12-25 04:39:54,619 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:39:54,621 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 04:39:54,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:39:54 BoogieIcfgContainer [2023-12-25 04:39:54,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 04:39:54,623 INFO L158 Benchmark]: Toolchain (without parser) took 886373.13ms. Allocated memory was 188.7MB in the beginning and 252.7MB in the end (delta: 64.0MB). Free memory was 142.1MB in the beginning and 207.8MB in the end (delta: -65.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:39:54,623 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 188.7MB. Free memory is still 143.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:39:54,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.13ms. Allocated memory is still 188.7MB. Free memory was 141.8MB in the beginning and 129.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 04:39:54,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.68ms. Allocated memory is still 188.7MB. Free memory was 129.9MB in the beginning and 128.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 04:39:54,624 INFO L158 Benchmark]: Boogie Preprocessor took 35.38ms. Allocated memory is still 188.7MB. Free memory was 128.4MB in the beginning and 126.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 04:39:54,624 INFO L158 Benchmark]: RCFGBuilder took 806.54ms. Allocated memory is still 188.7MB. Free memory was 126.4MB in the beginning and 113.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 04:39:54,624 INFO L158 Benchmark]: TraceAbstraction took 885275.67ms. Allocated memory was 188.7MB in the beginning and 252.7MB in the end (delta: 64.0MB). Free memory was 112.8MB in the beginning and 207.8MB in the end (delta: -95.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:39:54,625 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.43ms. Allocated memory is still 188.7MB. Free memory is still 143.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.13ms. Allocated memory is still 188.7MB. Free memory was 141.8MB in the beginning and 129.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.68ms. Allocated memory is still 188.7MB. Free memory was 129.9MB in the beginning and 128.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.38ms. Allocated memory is still 188.7MB. Free memory was 128.4MB in the beginning and 126.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 806.54ms. Allocated memory is still 188.7MB. Free memory was 126.4MB in the beginning and 113.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 885275.67ms. Allocated memory was 188.7MB in the beginning and 252.7MB in the end (delta: 64.0MB). Free memory was 112.8MB in the beginning and 207.8MB in the end (delta: -95.0MB). 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 analyzing trace of length 45 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 885.2s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 404.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 164.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 845 SdHoareTripleChecker+Invalid, 155.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 436 IncrementalHoareTripleChecker+Unchecked, 707 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1049 IncrementalHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 138 mSDtfsCounter, 1049 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 342 SyntacticMatches, 4 SemanticMatches, 125 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 399.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=6, InterpolantAutomatonStates: 81, 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, 7 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 455.5s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 407 ConstructedInterpolants, 24 QuantifiedInterpolants, 3038 SizeOfPredicates, 40 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 212/255 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