/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/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-46.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 01:46:51,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 01:46:51,415 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-24 01:46:51,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 01:46:51,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 01:46:51,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 01:46:51,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 01:46:51,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 01:46:51,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 01:46:51,456 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 01:46:51,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 01:46:51,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 01:46:51,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 01:46:51,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 01:46:51,458 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 01:46:51,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 01:46:51,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 01:46:51,459 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 01:46:51,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 01:46:51,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 01:46:51,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 01:46:51,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 01:46:51,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 01:46:51,461 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 01:46:51,461 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 01:46:51,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 01:46:51,461 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 01:46:51,461 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 01:46:51,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 01:46:51,462 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 01:46:51,463 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 01:46:51,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 01:46:51,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 01:46:51,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 01:46:51,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:46:51,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 01:46:51,465 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 01:46:51,465 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 01:46:51,465 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 01:46:51,465 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 01:46:51,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 01:46:51,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 01:46:51,466 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 01:46:51,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 01:46:51,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 01:46:51,466 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 01:46:51,466 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-24 01:46:51,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 01:46:51,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 01:46:51,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 01:46:51,737 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 01:46:51,737 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 01:46:51,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-46.i [2023-12-24 01:46:52,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 01:46:53,024 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 01:46:53,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-46.i [2023-12-24 01:46:53,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5f185cf/73b3342ee67946cdb1653dac4a540842/FLAG1242ff009 [2023-12-24 01:46:53,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5f185cf/73b3342ee67946cdb1653dac4a540842 [2023-12-24 01:46:53,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 01:46:53,051 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 01:46:53,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 01:46:53,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 01:46:53,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 01:46:53,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd924b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53, skipping insertion in model container [2023-12-24 01:46:53,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,081 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 01:46:53,201 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-46.i[915,928] [2023-12-24 01:46:53,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:46:53,255 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 01:46:53,266 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-46.i[915,928] [2023-12-24 01:46:53,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:46:53,296 INFO L206 MainTranslator]: Completed translation [2023-12-24 01:46:53,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53 WrapperNode [2023-12-24 01:46:53,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 01:46:53,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 01:46:53,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 01:46:53,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 01:46:53,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,337 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2023-12-24 01:46:53,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 01:46:53,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 01:46:53,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 01:46:53,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 01:46:53,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,372 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-24 01:46:53,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 01:46:53,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 01:46:53,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 01:46:53,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 01:46:53,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (1/1) ... [2023-12-24 01:46:53,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:46:53,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 01:46:53,427 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-24 01:46:53,445 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-24 01:46:53,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 01:46:53,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 01:46:53,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 01:46:53,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 01:46:53,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 01:46:53,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 01:46:53,542 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 01:46:53,545 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 01:46:53,772 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 01:46:53,801 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 01:46:53,802 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 01:46:53,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:46:53 BoogieIcfgContainer [2023-12-24 01:46:53,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 01:46:53,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 01:46:53,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 01:46:53,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 01:46:53,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:46:53" (1/3) ... [2023-12-24 01:46:53,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5bf170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:46:53, skipping insertion in model container [2023-12-24 01:46:53,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:46:53" (2/3) ... [2023-12-24 01:46:53,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5bf170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:46:53, skipping insertion in model container [2023-12-24 01:46:53,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:46:53" (3/3) ... [2023-12-24 01:46:53,809 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-46.i [2023-12-24 01:46:53,821 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 01:46:53,821 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 01:46:53,917 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 01:46:53,923 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;@7a1eae63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 01:46:53,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 01:46:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 01:46:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 01:46:53,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:46:53,935 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:46:53,936 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:46:53,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:46:53,940 INFO L85 PathProgramCache]: Analyzing trace with hash -963293228, now seen corresponding path program 1 times [2023-12-24 01:46:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:46:53,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887079077] [2023-12-24 01:46:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:46:53,949 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-24 01:46:53,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:46:53,951 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-24 01:46:53,954 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-24 01:46:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:46:54,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 01:46:54,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:46:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-12-24 01:46:54,103 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:46:54,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:46:54,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887079077] [2023-12-24 01:46:54,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887079077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:46:54,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:46:54,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 01:46:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468593787] [2023-12-24 01:46:54,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:46:54,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 01:46:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:46:54,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 01:46:54,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 01:46:54,139 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-24 01:46:54,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:46:54,181 INFO L93 Difference]: Finished difference Result 71 states and 120 transitions. [2023-12-24 01:46:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 01:46:54,186 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2023-12-24 01:46:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:46:54,194 INFO L225 Difference]: With dead ends: 71 [2023-12-24 01:46:54,194 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 01:46:54,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 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-24 01:46:54,201 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 01:46:54,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 01:46:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 01:46:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-24 01:46:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 01:46:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2023-12-24 01:46:54,246 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 65 [2023-12-24 01:46:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:46:54,247 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2023-12-24 01:46:54,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-24 01:46:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2023-12-24 01:46:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 01:46:54,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:46:54,255 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:46:54,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 01:46:54,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 01:46:54,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:46:54,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:46:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash -642004136, now seen corresponding path program 1 times [2023-12-24 01:46:54,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:46:54,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198622856] [2023-12-24 01:46:54,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:46:54,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 01:46:54,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:46:54,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 01:46:54,469 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-24 01:46:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:46:54,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 01:46:54,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:48:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 01:48:21,081 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:48:21,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:48:21,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198622856] [2023-12-24 01:48:21,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198622856] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:48:21,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:48:21,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 01:48:21,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843867758] [2023-12-24 01:48:21,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:48:21,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 01:48:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:48:21,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 01:48:21,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 01:48:21,083 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:48:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:48:21,380 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2023-12-24 01:48:21,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 01:48:21,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 65 [2023-12-24 01:48:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:48:21,382 INFO L225 Difference]: With dead ends: 63 [2023-12-24 01:48:21,382 INFO L226 Difference]: Without dead ends: 61 [2023-12-24 01:48:21,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-24 01:48:21,383 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 62 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 01:48:21,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 174 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 01:48:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-24 01:48:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2023-12-24 01:48:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 01:48:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2023-12-24 01:48:21,391 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 65 [2023-12-24 01:48:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:48:21,391 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2023-12-24 01:48:21,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:48:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2023-12-24 01:48:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-24 01:48:21,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:48:21,393 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:48:21,403 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-24 01:48:21,597 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-24 01:48:21,598 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:48:21,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:48:21,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1877661775, now seen corresponding path program 1 times [2023-12-24 01:48:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:48:21,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792399947] [2023-12-24 01:48:21,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:48:21,599 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-24 01:48:21,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:48:21,604 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-24 01:48:21,605 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-24 01:48:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:48:21,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 01:48:21,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:49:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 01:49:00,989 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:49:00,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:49:00,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792399947] [2023-12-24 01:49:00,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792399947] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:49:00,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:49:00,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 01:49:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601589963] [2023-12-24 01:49:00,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:49:00,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 01:49:00,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:49:00,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 01:49:00,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 01:49:00,992 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:49:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:49:03,265 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2023-12-24 01:49:03,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 01:49:03,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2023-12-24 01:49:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:49:03,267 INFO L225 Difference]: With dead ends: 68 [2023-12-24 01:49:03,267 INFO L226 Difference]: Without dead ends: 66 [2023-12-24 01:49:03,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-24 01:49:03,268 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 70 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 01:49:03,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 237 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 01:49:03,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-24 01:49:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2023-12-24 01:49:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 01:49:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2023-12-24 01:49:03,274 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 66 [2023-12-24 01:49:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:49:03,275 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2023-12-24 01:49:03,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:49:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2023-12-24 01:49:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-24 01:49:03,276 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:49:03,276 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:49:03,300 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 (4)] Ended with exit code 0 [2023-12-24 01:49:03,480 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-24 01:49:03,480 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:49:03,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:49:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1599789807, now seen corresponding path program 1 times [2023-12-24 01:49:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:49:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488665218] [2023-12-24 01:49:03,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:49:03,481 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-24 01:49:03,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:49:03,483 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-24 01:49:03,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 01:49:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:49:03,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 01:49:03,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:49:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 93 proven. 9 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-24 01:49:08,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:51:02,785 WARN L293 SmtUtils]: Spent 5.61s on a formula simplification. DAG size of input: 159 DAG size of output: 141 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 01:51:13,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:51:13,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488665218] [2023-12-24 01:51:13,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488665218] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 01:51:13,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1198951441] [2023-12-24 01:51:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:51:13,996 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 01:51:13,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 01:51:14,054 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 01:51:14,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-24 01:51:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:51:14,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 01:51:14,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:51:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 01:51:18,625 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:51:18,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1198951441] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:51:18,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:51:18,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2023-12-24 01:51:18,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027709274] [2023-12-24 01:51:18,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:51:18,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 01:51:18,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:51:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 01:51:18,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-12-24 01:51:18,632 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:51:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:51:19,029 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2023-12-24 01:51:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 01:51:19,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2023-12-24 01:51:19,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:51:19,035 INFO L225 Difference]: With dead ends: 78 [2023-12-24 01:51:19,035 INFO L226 Difference]: Without dead ends: 76 [2023-12-24 01:51:19,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2023-12-24 01:51:19,039 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 70 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 01:51:19,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 204 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 01:51:19,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-24 01:51:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2023-12-24 01:51:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 01:51:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2023-12-24 01:51:19,059 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 66 [2023-12-24 01:51:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:51:19,060 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2023-12-24 01:51:19,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:51:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2023-12-24 01:51:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-24 01:51:19,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:51:19,063 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:51:19,070 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-24 01:51:19,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-24 01:51:19,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 01:51:19,474 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:51:19,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:51:19,475 INFO L85 PathProgramCache]: Analyzing trace with hash 790443181, now seen corresponding path program 1 times [2023-12-24 01:51:19,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:51:19,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452054247] [2023-12-24 01:51:19,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:51:19,481 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-24 01:51:19,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:51:19,483 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 01:51:19,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 01:51:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:51:19,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 01:51:19,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:51:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 98 proven. 12 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-24 01:51:19,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:51:19,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:51:19,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452054247] [2023-12-24 01:51:19,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452054247] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 01:51:19,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [217324740] [2023-12-24 01:51:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:51:19,805 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 01:51:19,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 01:51:19,806 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 01:51:19,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-24 01:51:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:51:19,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 01:51:19,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:51:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 01:51:27,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:51:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [217324740] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:51:27,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:51:27,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2023-12-24 01:51:27,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516739276] [2023-12-24 01:51:27,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:51:27,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 01:51:27,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:51:27,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 01:51:27,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-12-24 01:51:27,465 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:51:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:51:27,890 INFO L93 Difference]: Finished difference Result 151 states and 211 transitions. [2023-12-24 01:51:27,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 01:51:27,890 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2023-12-24 01:51:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:51:27,892 INFO L225 Difference]: With dead ends: 151 [2023-12-24 01:51:27,892 INFO L226 Difference]: Without dead ends: 149 [2023-12-24 01:51:27,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2023-12-24 01:51:27,893 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 81 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 01:51:27,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 246 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 01:51:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-24 01:51:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2023-12-24 01:51:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 106 states have internal predecessors, (148), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-24 01:51:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 192 transitions. [2023-12-24 01:51:27,918 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 192 transitions. Word has length 66 [2023-12-24 01:51:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:51:27,918 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 192 transitions. [2023-12-24 01:51:27,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:51:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 192 transitions. [2023-12-24 01:51:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-24 01:51:27,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:51:27,919 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:51:27,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 01:51:28,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-24 01:51:28,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 01:51:28,331 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:51:28,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:51:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash -730164573, now seen corresponding path program 1 times [2023-12-24 01:51:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:51:28,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144817695] [2023-12-24 01:51:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:51:28,333 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-24 01:51:28,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:51:28,336 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-24 01:51:28,337 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-24 01:51:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:51:28,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 01:51:28,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:51:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 99 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-24 01:51:44,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:53:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-24 01:53:34,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:53:34,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144817695] [2023-12-24 01:53:34,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144817695] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 01:53:34,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 01:53:34,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-12-24 01:53:34,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511785599] [2023-12-24 01:53:34,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 01:53:34,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-24 01:53:34,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:53:34,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-24 01:53:34,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2023-12-24 01:53:34,382 INFO L87 Difference]: Start difference. First operand 131 states and 192 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 01:53:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:53:59,911 INFO L93 Difference]: Finished difference Result 271 states and 368 transitions. [2023-12-24 01:53:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-24 01:53:59,923 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 67 [2023-12-24 01:53:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:53:59,924 INFO L225 Difference]: With dead ends: 271 [2023-12-24 01:53:59,924 INFO L226 Difference]: Without dead ends: 209 [2023-12-24 01:53:59,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=456, Invalid=1614, Unknown=0, NotChecked=0, Total=2070 [2023-12-24 01:53:59,926 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 236 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2023-12-24 01:53:59,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 243 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2023-12-24 01:53:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-24 01:53:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 137. [2023-12-24 01:53:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 110 states have internal predecessors, (149), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-24 01:53:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 193 transitions. [2023-12-24 01:53:59,935 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 193 transitions. Word has length 67 [2023-12-24 01:53:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:53:59,935 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 193 transitions. [2023-12-24 01:53:59,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 01:53:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 193 transitions. [2023-12-24 01:53:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-24 01:53:59,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:53:59,941 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:53:59,947 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-24 01:54:00,145 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-24 01:54:00,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:54:00,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:54:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1641170024, now seen corresponding path program 1 times [2023-12-24 01:54:00,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:54:00,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839318258] [2023-12-24 01:54:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:54:00,146 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-24 01:54:00,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:54:00,147 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-24 01:54:00,149 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-24 01:54:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:54:00,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 01:54:00,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:54:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 123 proven. 24 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-24 01:54:05,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:56:17,574 WARN L293 SmtUtils]: Spent 9.37s on a formula simplification. DAG size of input: 196 DAG size of output: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 01:56:58,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:56:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839318258] [2023-12-24 01:56:58,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839318258] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 01:56:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2085091882] [2023-12-24 01:56:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:56:58,301 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 01:56:58,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 01:56:58,303 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 01:56:58,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-24 01:56:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:56:58,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 01:56:58,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:57:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 01:57:03,164 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:57:03,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2085091882] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:57:03,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:57:03,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2023-12-24 01:57:03,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773694242] [2023-12-24 01:57:03,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:57:03,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 01:57:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:57:03,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 01:57:03,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2023-12-24 01:57:03,166 INFO L87 Difference]: Start difference. First operand 137 states and 193 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:57:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:57:03,593 INFO L93 Difference]: Finished difference Result 303 states and 425 transitions. [2023-12-24 01:57:03,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 01:57:03,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2023-12-24 01:57:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:57:03,598 INFO L225 Difference]: With dead ends: 303 [2023-12-24 01:57:03,598 INFO L226 Difference]: Without dead ends: 167 [2023-12-24 01:57:03,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2023-12-24 01:57:03,602 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 80 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 01:57:03,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 226 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 01:57:03,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-24 01:57:03,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2023-12-24 01:57:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 116 states have internal predecessors, (158), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-24 01:57:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 202 transitions. [2023-12-24 01:57:03,618 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 202 transitions. Word has length 67 [2023-12-24 01:57:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:57:03,619 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 202 transitions. [2023-12-24 01:57:03,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:57:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 202 transitions. [2023-12-24 01:57:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-24 01:57:03,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:57:03,621 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:57:03,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-24 01:57:03,833 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-24 01:57:04,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-24 01:57:04,029 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:57:04,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:57:04,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1275194645, now seen corresponding path program 1 times [2023-12-24 01:57:04,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:57:04,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345344936] [2023-12-24 01:57:04,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:57:04,030 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-24 01:57:04,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:57:04,031 INFO L229 MonitoredProcess]: Starting monitored process 12 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-24 01:57:04,035 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 (12)] Waiting until timeout for monitored process [2023-12-24 01:57:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:57:04,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 01:57:04,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:57:04,298 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 98 proven. 12 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-24 01:57:04,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:57:04,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:57:04,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345344936] [2023-12-24 01:57:04,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345344936] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 01:57:04,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1242000483] [2023-12-24 01:57:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:57:04,349 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 01:57:04,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 01:57:04,350 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 01:57:04,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-24 01:57:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:57:04,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 01:57:04,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:57:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 01:57:04,540 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:57:04,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1242000483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:57:04,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:57:04,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2023-12-24 01:57:04,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236545495] [2023-12-24 01:57:04,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:57:04,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 01:57:04,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:57:04,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 01:57:04,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-12-24 01:57:04,541 INFO L87 Difference]: Start difference. First operand 143 states and 202 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:57:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:57:04,602 INFO L93 Difference]: Finished difference Result 213 states and 299 transitions. [2023-12-24 01:57:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 01:57:04,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2023-12-24 01:57:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:57:04,610 INFO L225 Difference]: With dead ends: 213 [2023-12-24 01:57:04,610 INFO L226 Difference]: Without dead ends: 71 [2023-12-24 01:57:04,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-12-24 01:57:04,611 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 01:57:04,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 86 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 01:57:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-24 01:57:04,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2023-12-24 01:57:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 01:57:04,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2023-12-24 01:57:04,616 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 67 [2023-12-24 01:57:04,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:57:04,616 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2023-12-24 01:57:04,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:57:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2023-12-24 01:57:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-24 01:57:04,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:57:04,617 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:57:04,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-12-24 01:57:04,823 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 (12)] Ended with exit code 0 [2023-12-24 01:57:05,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /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-24 01:57:05,024 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:57:05,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:57:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash -961111654, now seen corresponding path program 1 times [2023-12-24 01:57:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:57:05,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682203171] [2023-12-24 01:57:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:57:05,024 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-24 01:57:05,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:57:05,026 INFO L229 MonitoredProcess]: Starting monitored process 14 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-24 01:57:05,027 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 (14)] Waiting until timeout for monitored process [2023-12-24 01:57:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:57:05,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 01:57:05,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:57:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 98 proven. 12 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-24 01:57:05,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:57:05,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:57:05,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682203171] [2023-12-24 01:57:05,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682203171] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 01:57:05,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1457114327] [2023-12-24 01:57:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:57:05,366 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 01:57:05,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 01:57:05,367 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 01:57:05,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-12-24 01:57:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:57:05,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 01:57:05,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:57:05,655 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 93 proven. 9 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-24 01:57:05,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:57:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1457114327] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 01:57:05,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 01:57:05,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2023-12-24 01:57:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035208867] [2023-12-24 01:57:05,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 01:57:05,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 01:57:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:57:05,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 01:57:05,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-12-24 01:57:05,682 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-24 01:57:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:57:05,973 INFO L93 Difference]: Finished difference Result 133 states and 167 transitions. [2023-12-24 01:57:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 01:57:05,978 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 67 [2023-12-24 01:57:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:57:05,978 INFO L225 Difference]: With dead ends: 133 [2023-12-24 01:57:05,978 INFO L226 Difference]: Without dead ends: 69 [2023-12-24 01:57:05,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2023-12-24 01:57:05,980 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 114 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 01:57:05,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 115 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 01:57:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-24 01:57:05,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2023-12-24 01:57:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 01:57:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2023-12-24 01:57:05,986 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2023-12-24 01:57:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:57:05,986 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2023-12-24 01:57:05,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-24 01:57:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2023-12-24 01:57:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-24 01:57:05,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:57:05,987 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:57:05,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2023-12-24 01:57:06,192 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 (14)] Forceful destruction successful, exit code 0 [2023-12-24 01:57:06,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /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-24 01:57:06,389 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:57:06,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:57:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1855199354, now seen corresponding path program 1 times [2023-12-24 01:57:06,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:57:06,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260509413] [2023-12-24 01:57:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:57:06,389 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-24 01:57:06,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:57:06,404 INFO L229 MonitoredProcess]: Starting monitored process 16 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-24 01:57:06,405 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 (16)] Waiting until timeout for monitored process [2023-12-24 01:57:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:57:06,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 01:57:06,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:57:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 87 proven. 18 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-24 01:57:06,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:57:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 01:57:07,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:57:07,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260509413] [2023-12-24 01:57:07,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260509413] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 01:57:07,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:57:07,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2023-12-24 01:57:07,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775281815] [2023-12-24 01:57:07,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:57:07,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 01:57:07,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:57:07,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 01:57:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-12-24 01:57:07,653 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:57:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:57:08,859 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2023-12-24 01:57:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 01:57:08,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 68 [2023-12-24 01:57:08,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:57:08,862 INFO L225 Difference]: With dead ends: 136 [2023-12-24 01:57:08,862 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 01:57:08,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-12-24 01:57:08,863 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-24 01:57:08,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 169 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-24 01:57:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 01:57:08,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 01:57:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 01:57:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 01:57:08,864 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2023-12-24 01:57:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:57:08,865 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 01:57:08,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 01:57:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 01:57:08,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 01:57:08,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 01:57:08,875 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 (16)] Forceful destruction successful, exit code 0 [2023-12-24 01:57:09,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-24 01:57:09,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 01:57:11,845 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 01:57:11,845 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 01:57:11,845 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_7~0))) (and (= ~last_1_var_1_10~0 (_ bv256 32)) (= (_ bv256 32) ~var_1_10~0) (bvsle ((_ zero_extend 24) ~var_1_6~0) (_ bv0 32)) (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)))) [2023-12-24 01:57:11,845 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_7~0))) (and (= ~last_1_var_1_10~0 (_ bv256 32)) (= (_ bv256 32) ~var_1_10~0) (bvsle ((_ zero_extend 24) ~var_1_6~0) (_ bv0 32)) (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)))) [2023-12-24 01:57:11,846 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 56) no Hoare annotation was computed. [2023-12-24 01:57:11,846 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 01:57:11,846 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-24 01:57:11,846 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse7 ((_ zero_extend 24) ~var_1_7~0))) (let ((.cse0 (= ~last_1_var_1_10~0 (_ bv256 32))) (.cse4 ((_ sign_extend 24) ~var_1_4~0)) (.cse1 (= (_ bv256 32) ~var_1_10~0)) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_6~0) (_ bv0 32))) (.cse5 (bvsge .cse7 (_ bv1 32))) (.cse6 (bvsle .cse7 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (not (let ((.cse3 ((_ zero_extend 24) ~var_1_8~0))) (bvsge (bvsdiv .cse3 .cse4) .cse3))) .cse5 .cse6) (and .cse0 (not (= (_ bv2 32) .cse4)) .cse1 .cse2 (= ~var_1_8~0 ~var_1_9~0) .cse5 .cse6)))) [2023-12-24 01:57:11,846 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-24 01:57:11,846 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 44) no Hoare annotation was computed. [2023-12-24 01:57:11,846 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 65) no Hoare annotation was computed. [2023-12-24 01:57:11,846 INFO L895 garLoopResultBuilder]: At program point L94-2(lines 94 100) the Hoare annotation is: (let ((.cse7 ((_ zero_extend 24) ~var_1_7~0)) (.cse8 ((_ sign_extend 24) ~var_1_4~0))) (let ((.cse4 (not (let ((.cse9 ((_ zero_extend 24) ~var_1_8~0))) (bvsge (bvsdiv .cse9 .cse8) .cse9)))) (.cse0 (= ~last_1_var_1_10~0 (_ bv256 32))) (.cse3 (not (= (_ bv2 32) .cse8))) (.cse1 (= (_ bv256 32) ~var_1_10~0)) (.cse2 (bvsle ((_ zero_extend 24) ~var_1_6~0) (_ bv0 32))) (.cse5 (bvsge .cse7 (_ bv1 32))) (.cse6 (bvsle .cse7 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 (or (= ((_ sign_extend 24) |ULTIMATE.start_step_~stepLocal_3~0#1|) (_ bv2 32)) .cse3) .cse4 .cse5 .cse6) (and .cse0 (= ~var_1_8~0 (_ bv128 8)) .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse3 .cse1 .cse2 (= ~var_1_8~0 ~var_1_9~0) .cse5 .cse6)))) [2023-12-24 01:57:11,846 INFO L899 garLoopResultBuilder]: For program point L94-3(lines 94 100) no Hoare annotation was computed. [2023-12-24 01:57:11,846 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 01:57:11,846 INFO L899 garLoopResultBuilder]: For program point L82(lines 67 83) no Hoare annotation was computed. [2023-12-24 01:57:11,846 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2023-12-24 01:57:11,846 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (and (= ~last_1_var_1_10~0 (_ bv256 32)) (= (_ bv256 32) ~var_1_10~0) (bvsle ((_ zero_extend 24) ~var_1_6~0) (_ bv0 32))) [2023-12-24 01:57:11,846 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (and (= ~last_1_var_1_10~0 (_ bv256 32)) (= (_ bv256 32) ~var_1_10~0) (bvsle ((_ zero_extend 24) ~var_1_6~0) (_ bv0 32)) (bvsge ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32))) [2023-12-24 01:57:11,846 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 66) no Hoare annotation was computed. [2023-12-24 01:57:11,846 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 01:57:11,847 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 64) no Hoare annotation was computed. [2023-12-24 01:57:11,847 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-12-24 01:57:11,847 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_7~0))) (and (= ~last_1_var_1_10~0 (_ bv256 32)) (= (_ bv256 32) ~var_1_10~0) (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)))) [2023-12-24 01:57:11,847 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_7~0))) (and (= ~last_1_var_1_10~0 (_ bv256 32)) (= (_ bv256 32) ~var_1_10~0) (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)))) [2023-12-24 01:57:11,847 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 01:57:11,847 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_7~0))) (and (= ~last_1_var_1_10~0 (_ bv256 32)) (= (_ bv256 32) ~var_1_10~0) (bvsle ((_ zero_extend 24) ~var_1_6~0) (_ bv0 32)) (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)))) [2023-12-24 01:57:11,847 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_7~0))) (and (= ~last_1_var_1_10~0 (_ bv256 32)) (= (_ bv256 32) ~var_1_10~0) (bvsle ((_ zero_extend 24) ~var_1_6~0) (_ bv0 32)) (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)))) [2023-12-24 01:57:11,847 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 59) no Hoare annotation was computed. [2023-12-24 01:57:11,847 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 47 59) no Hoare annotation was computed. [2023-12-24 01:57:11,847 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-12-24 01:57:11,848 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_7~0))) (and (= ~last_1_var_1_10~0 (_ bv256 32)) (= (_ bv256 32) ~var_1_10~0) (bvsle ((_ zero_extend 24) ~var_1_6~0) (_ bv0 32)) (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)))) [2023-12-24 01:57:11,848 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-24 01:57:11,848 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 36 44) no Hoare annotation was computed. [2023-12-24 01:57:11,848 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 01:57:11,848 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 01:57:11,848 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 01:57:11,848 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 01:57:11,852 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:57:11,853 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 01:57:11,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:57:11 BoogieIcfgContainer [2023-12-24 01:57:11,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 01:57:11,872 INFO L158 Benchmark]: Toolchain (without parser) took 618820.98ms. Allocated memory was 331.4MB in the beginning and 1.2GB in the end (delta: 832.6MB). Free memory was 279.6MB in the beginning and 903.0MB in the end (delta: -623.4MB). Peak memory consumption was 210.9MB. Max. memory is 8.0GB. [2023-12-24 01:57:11,872 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 222.3MB. Free memory is still 173.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 01:57:11,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.06ms. Allocated memory is still 331.4MB. Free memory was 279.4MB in the beginning and 266.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 01:57:11,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.67ms. Allocated memory is still 331.4MB. Free memory was 266.7MB in the beginning and 264.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 01:57:11,872 INFO L158 Benchmark]: Boogie Preprocessor took 48.67ms. Allocated memory is still 331.4MB. Free memory was 264.7MB in the beginning and 262.2MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 01:57:11,873 INFO L158 Benchmark]: RCFGBuilder took 415.06ms. Allocated memory is still 331.4MB. Free memory was 262.2MB in the beginning and 246.0MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-24 01:57:11,873 INFO L158 Benchmark]: TraceAbstraction took 618067.51ms. Allocated memory was 331.4MB in the beginning and 1.2GB in the end (delta: 832.6MB). Free memory was 245.4MB in the beginning and 903.0MB in the end (delta: -657.6MB). Peak memory consumption was 176.3MB. Max. memory is 8.0GB. [2023-12-24 01:57:11,875 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.61ms. Allocated memory is still 222.3MB. Free memory is still 173.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.06ms. Allocated memory is still 331.4MB. Free memory was 279.4MB in the beginning and 266.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.67ms. Allocated memory is still 331.4MB. Free memory was 266.7MB in the beginning and 264.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.67ms. Allocated memory is still 331.4MB. Free memory was 264.7MB in the beginning and 262.2MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 415.06ms. Allocated memory is still 331.4MB. Free memory was 262.2MB in the beginning and 246.0MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 618067.51ms. Allocated memory was 331.4MB in the beginning and 1.2GB in the end (delta: 832.6MB). Free memory was 245.4MB in the beginning and 903.0MB in the end (delta: -657.6MB). Peak memory consumption was 176.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 618.0s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 747 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 742 mSDsluCounter, 1748 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1266 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1388 IncrementalHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 482 mSDtfsCounter, 1388 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1245 GetRequests, 1058 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 52.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=7, InterpolantAutomatonStates: 106, 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, 10 MinimizatonAttempts, 152 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 110 PreInvPairs, 125 NumberOfFragments, 305 HoareAnnotationTreeSize, 110 FormulaSimplifications, 2339 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FormulaSimplificationsInter, 3142 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 579.2s InterpolantComputationTime, 997 NumberOfCodeBlocks, 997 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1115 ConstructedInterpolants, 5 QuantifiedInterpolants, 6915 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1739 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 2940/3060 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((((((last_1_var_1_10 == 256) && (256 == var_1_10)) && (var_1_6 <= 0)) && !(((var_1_8 / var_1_4) >= var_1_8))) && (var_1_7 >= 1)) && (var_1_7 <= 1)) || (((((((last_1_var_1_10 == 256) && (var_1_8 == -128)) && (256 == var_1_10)) && (var_1_6 <= 0)) && !(((var_1_8 / var_1_4) >= var_1_8))) && (var_1_7 >= 1)) && (var_1_7 <= 1))) || (((((((last_1_var_1_10 == 256) && !((2 == var_1_4))) && (256 == var_1_10)) && (var_1_6 <= 0)) && (var_1_8 == var_1_9)) && (var_1_7 >= 1)) && (var_1_7 <= 1))) RESULT: Ultimate proved your program to be correct! [2023-12-24 01:57:11,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...