/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/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 08:19:56,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 08:19:56,375 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-16 08:19:56,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 08:19:56,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 08:19:56,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 08:19:56,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 08:19:56,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 08:19:56,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 08:19:56,393 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 08:19:56,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 08:19:56,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 08:19:56,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 08:19:56,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 08:19:56,395 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 08:19:56,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 08:19:56,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 08:19:56,395 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 08:19:56,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 08:19:56,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 08:19:56,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 08:19:56,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 08:19:56,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 08:19:56,397 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 08:19:56,397 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 08:19:56,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 08:19:56,397 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 08:19:56,398 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 08:19:56,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 08:19:56,398 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 08:19:56,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 08:19:56,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 08:19:56,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 08:19:56,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 08:19:56,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 08:19:56,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 08:19:56,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 08:19:56,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 08:19:56,400 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 08:19:56,400 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 08:19:56,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 08:19:56,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 08:19:56,400 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 08:19:56,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 08:19:56,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 08:19:56,405 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 08:19:56,405 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-16 08:19:56,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 08:19:56,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 08:19:56,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 08:19:56,562 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 08:19:56,562 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 08:19:56,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2023-12-16 08:19:57,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 08:19:57,807 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 08:19:57,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2023-12-16 08:19:57,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b8297bf/57a96596452b436ba3f2b17fffa236dc/FLAGf9271dc15 [2023-12-16 08:19:57,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48b8297bf/57a96596452b436ba3f2b17fffa236dc [2023-12-16 08:19:57,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 08:19:57,827 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 08:19:57,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 08:19:57,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 08:19:57,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 08:19:57,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:57,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2738c724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57, skipping insertion in model container [2023-12-16 08:19:57,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:57,847 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 08:19:57,955 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c[2207,2220] [2023-12-16 08:19:57,958 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 08:19:57,967 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 08:19:57,982 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c[2207,2220] [2023-12-16 08:19:57,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 08:19:57,992 INFO L206 MainTranslator]: Completed translation [2023-12-16 08:19:57,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57 WrapperNode [2023-12-16 08:19:57,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 08:19:57,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 08:19:57,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 08:19:57,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 08:19:57,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:58,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:58,021 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 82 [2023-12-16 08:19:58,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 08:19:58,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 08:19:58,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 08:19:58,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 08:19:58,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:58,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:58,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:58,041 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-16 08:19:58,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:58,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:58,044 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:58,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:58,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:58,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:58,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 08:19:58,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 08:19:58,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 08:19:58,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 08:19:58,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (1/1) ... [2023-12-16 08:19:58,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 08:19:58,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 08:19:58,098 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-16 08:19:58,118 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-16 08:19:58,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 08:19:58,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 08:19:58,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 08:19:58,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 08:19:58,172 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 08:19:58,173 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 08:19:58,277 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 08:19:58,293 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 08:19:58,293 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 08:19:58,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:19:58 BoogieIcfgContainer [2023-12-16 08:19:58,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 08:19:58,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 08:19:58,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 08:19:58,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 08:19:58,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:19:57" (1/3) ... [2023-12-16 08:19:58,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ec908f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:19:58, skipping insertion in model container [2023-12-16 08:19:58,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:57" (2/3) ... [2023-12-16 08:19:58,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ec908f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:19:58, skipping insertion in model container [2023-12-16 08:19:58,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:19:58" (3/3) ... [2023-12-16 08:19:58,302 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2023-12-16 08:19:58,315 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 08:19:58,315 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 08:19:58,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 08:19:58,361 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;@22be4910, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 08:19:58,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 08:19:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 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-16 08:19:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 08:19:58,370 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:19:58,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:19:58,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:19:58,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:19:58,377 INFO L85 PathProgramCache]: Analyzing trace with hash 164520155, now seen corresponding path program 1 times [2023-12-16 08:19:58,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:19:58,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520903552] [2023-12-16 08:19:58,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:19:58,387 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-16 08:19:58,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:19:58,400 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-16 08:19:58,441 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-16 08:19:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:19:58,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:19:58,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:19:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:19:58,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:19:58,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:19:58,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520903552] [2023-12-16 08:19:58,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520903552] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:19:58,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:19:58,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:19:58,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331565150] [2023-12-16 08:19:58,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:19:58,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:19:58,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:19:58,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:19:58,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:19:58,522 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-16 08:19:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:19:58,556 INFO L93 Difference]: Finished difference Result 48 states and 81 transitions. [2023-12-16 08:19:58,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:19:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2023-12-16 08:19:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:19:58,565 INFO L225 Difference]: With dead ends: 48 [2023-12-16 08:19:58,565 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 08:19:58,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:19:58,571 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 25 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:19:58,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 70 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:19:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 08:19:58,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2023-12-16 08:19:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 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-16 08:19:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2023-12-16 08:19:58,600 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 11 [2023-12-16 08:19:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:19:58,600 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2023-12-16 08:19:58,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-16 08:19:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2023-12-16 08:19:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 08:19:58,602 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:19:58,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:19:58,605 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-16 08:19:58,806 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-16 08:19:58,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:19:58,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:19:58,807 INFO L85 PathProgramCache]: Analyzing trace with hash -644826471, now seen corresponding path program 1 times [2023-12-16 08:19:58,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:19:58,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757094322] [2023-12-16 08:19:58,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:19:58,808 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-16 08:19:58,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:19:58,809 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-16 08:19:58,815 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-16 08:19:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:19:58,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:19:58,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:19:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:19:58,870 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:19:58,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:19:58,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757094322] [2023-12-16 08:19:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757094322] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:19:58,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:19:58,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:19:58,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559197056] [2023-12-16 08:19:58,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:19:58,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:19:58,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:19:58,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:19:58,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:19:58,873 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-16 08:19:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:19:58,885 INFO L93 Difference]: Finished difference Result 63 states and 108 transitions. [2023-12-16 08:19:58,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:19:58,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2023-12-16 08:19:58,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:19:58,886 INFO L225 Difference]: With dead ends: 63 [2023-12-16 08:19:58,886 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 08:19:58,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:19:58,887 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:19:58,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:19:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 08:19:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-12-16 08:19:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 states have internal predecessors, (61), 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-16 08:19:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2023-12-16 08:19:58,892 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 11 [2023-12-16 08:19:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:19:58,893 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2023-12-16 08:19:58,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-16 08:19:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2023-12-16 08:19:58,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 08:19:58,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:19:58,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:19:58,899 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-16 08:19:59,095 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-16 08:19:59,096 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:19:59,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:19:59,096 INFO L85 PathProgramCache]: Analyzing trace with hash 805372477, now seen corresponding path program 1 times [2023-12-16 08:19:59,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:19:59,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38688798] [2023-12-16 08:19:59,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:19:59,097 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-16 08:19:59,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:19:59,099 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-16 08:19:59,105 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-16 08:19:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:19:59,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:19:59,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:19:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:19:59,180 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:19:59,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:19:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38688798] [2023-12-16 08:19:59,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38688798] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:19:59,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:19:59,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:19:59,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851883872] [2023-12-16 08:19:59,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:19:59,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:19:59,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:19:59,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:19:59,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:19:59,182 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 08:19:59,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:19:59,213 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2023-12-16 08:19:59,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:19:59,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2023-12-16 08:19:59,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:19:59,214 INFO L225 Difference]: With dead ends: 59 [2023-12-16 08:19:59,214 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 08:19:59,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:19:59,215 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:19:59,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 77 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:19:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 08:19:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2023-12-16 08:19:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 38 states have internal predecessors, (63), 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-16 08:19:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2023-12-16 08:19:59,219 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 12 [2023-12-16 08:19:59,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:19:59,219 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2023-12-16 08:19:59,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 08:19:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2023-12-16 08:19:59,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 08:19:59,220 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:19:59,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:19:59,236 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-16 08:19:59,420 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-16 08:19:59,421 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:19:59,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:19:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1485430847, now seen corresponding path program 1 times [2023-12-16 08:19:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:19:59,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254025043] [2023-12-16 08:19:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:19:59,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:19:59,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:19:59,427 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-16 08:19:59,428 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-16 08:19:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:19:59,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:19:59,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:19:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:19:59,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:19:59,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:19:59,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254025043] [2023-12-16 08:19:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254025043] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:19:59,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:19:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:19:59,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678101643] [2023-12-16 08:19:59,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:19:59,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:19:59,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:19:59,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:19:59,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:19:59,516 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 08:19:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:19:59,528 INFO L93 Difference]: Finished difference Result 72 states and 116 transitions. [2023-12-16 08:19:59,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:19:59,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2023-12-16 08:19:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:19:59,529 INFO L225 Difference]: With dead ends: 72 [2023-12-16 08:19:59,529 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 08:19:59,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:19:59,531 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:19:59,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 62 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:19:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 08:19:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2023-12-16 08:19:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 51 states have internal predecessors, (84), 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-16 08:19:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 84 transitions. [2023-12-16 08:19:59,537 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 84 transitions. Word has length 12 [2023-12-16 08:19:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:19:59,538 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 84 transitions. [2023-12-16 08:19:59,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 08:19:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 84 transitions. [2023-12-16 08:19:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 08:19:59,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:19:59,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:19:59,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 08:19:59,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:19:59,741 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:19:59,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:19:59,741 INFO L85 PathProgramCache]: Analyzing trace with hash 676084221, now seen corresponding path program 1 times [2023-12-16 08:19:59,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:19:59,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608415249] [2023-12-16 08:19:59,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:19:59,745 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-16 08:19:59,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:19:59,747 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:19:59,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 08:19:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:19:59,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:19:59,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:19:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:19:59,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:19:59,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:19:59,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608415249] [2023-12-16 08:19:59,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608415249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:19:59,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:19:59,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:19:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828837996] [2023-12-16 08:19:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:19:59,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:19:59,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:19:59,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:19:59,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:19:59,795 INFO L87 Difference]: Start difference. First operand 52 states and 84 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 08:19:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:19:59,808 INFO L93 Difference]: Finished difference Result 120 states and 194 transitions. [2023-12-16 08:19:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:19:59,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2023-12-16 08:19:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:19:59,809 INFO L225 Difference]: With dead ends: 120 [2023-12-16 08:19:59,809 INFO L226 Difference]: Without dead ends: 72 [2023-12-16 08:19:59,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:19:59,810 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:19:59,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 71 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:19:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-16 08:19:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2023-12-16 08:19:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 69 states have internal predecessors, (110), 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-16 08:19:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2023-12-16 08:19:59,817 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 12 [2023-12-16 08:19:59,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:19:59,817 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 110 transitions. [2023-12-16 08:19:59,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 08:19:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 110 transitions. [2023-12-16 08:19:59,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 08:19:59,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:19:59,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:19:59,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 08:20:00,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:20:00,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:00,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:00,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1196068690, now seen corresponding path program 1 times [2023-12-16 08:20:00,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:00,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914157232] [2023-12-16 08:20:00,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:00,022 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-16 08:20:00,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:00,023 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-16 08:20:00,039 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-16 08:20:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:20:00,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:20:00,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:20:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:20:00,065 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:20:00,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:20:00,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914157232] [2023-12-16 08:20:00,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914157232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:20:00,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:20:00,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:20:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806199330] [2023-12-16 08:20:00,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:20:00,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:20:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:20:00,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:20:00,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:00,066 INFO L87 Difference]: Start difference. First operand 70 states and 110 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-16 08:20:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:20:00,078 INFO L93 Difference]: Finished difference Result 107 states and 165 transitions. [2023-12-16 08:20:00,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:20:00,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2023-12-16 08:20:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:20:00,079 INFO L225 Difference]: With dead ends: 107 [2023-12-16 08:20:00,079 INFO L226 Difference]: Without dead ends: 74 [2023-12-16 08:20:00,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:00,080 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:20:00,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 73 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:20:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-16 08:20:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2023-12-16 08:20:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 71 states have internal predecessors, (110), 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-16 08:20:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2023-12-16 08:20:00,087 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 13 [2023-12-16 08:20:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:20:00,087 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2023-12-16 08:20:00,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-16 08:20:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2023-12-16 08:20:00,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 08:20:00,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:20:00,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:20:00,096 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-16 08:20:00,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:20:00,291 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:00,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash -516010320, now seen corresponding path program 1 times [2023-12-16 08:20:00,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:00,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10633659] [2023-12-16 08:20:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:00,292 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-16 08:20:00,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:00,293 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:20:00,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 08:20:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:20:00,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:20:00,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:20:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:20:00,362 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:20:00,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:20:00,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10633659] [2023-12-16 08:20:00,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10633659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:20:00,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:20:00,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:20:00,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646754375] [2023-12-16 08:20:00,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:20:00,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:20:00,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:20:00,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:20:00,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:00,363 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-16 08:20:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:20:00,404 INFO L93 Difference]: Finished difference Result 200 states and 304 transitions. [2023-12-16 08:20:00,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:20:00,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2023-12-16 08:20:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:20:00,405 INFO L225 Difference]: With dead ends: 200 [2023-12-16 08:20:00,406 INFO L226 Difference]: Without dead ends: 134 [2023-12-16 08:20:00,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:00,407 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:20:00,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 64 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:20:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-16 08:20:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2023-12-16 08:20:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.4809160305343512) internal successors, (194), 131 states have internal predecessors, (194), 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-16 08:20:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2023-12-16 08:20:00,430 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 13 [2023-12-16 08:20:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:20:00,431 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2023-12-16 08:20:00,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-16 08:20:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2023-12-16 08:20:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 08:20:00,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:20:00,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:20:00,441 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 (8)] Ended with exit code 0 [2023-12-16 08:20:00,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:20:00,637 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:00,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:00,638 INFO L85 PathProgramCache]: Analyzing trace with hash 293336306, now seen corresponding path program 1 times [2023-12-16 08:20:00,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:00,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982094283] [2023-12-16 08:20:00,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:00,644 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-16 08:20:00,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:00,645 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-16 08:20:00,647 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-16 08:20:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:20:00,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:20:00,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:20:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:20:00,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:20:00,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:20:00,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982094283] [2023-12-16 08:20:00,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982094283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:20:00,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:20:00,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:20:00,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863598767] [2023-12-16 08:20:00,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:20:00,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:20:00,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:20:00,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:20:00,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:00,679 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-16 08:20:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:20:00,692 INFO L93 Difference]: Finished difference Result 160 states and 236 transitions. [2023-12-16 08:20:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:20:00,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Word has length 13 [2023-12-16 08:20:00,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:20:00,694 INFO L225 Difference]: With dead ends: 160 [2023-12-16 08:20:00,694 INFO L226 Difference]: Without dead ends: 158 [2023-12-16 08:20:00,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:00,695 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 17 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:20:00,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:20:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-16 08:20:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2023-12-16 08:20:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.450381679389313) internal successors, (190), 131 states have internal predecessors, (190), 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-16 08:20:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 190 transitions. [2023-12-16 08:20:00,709 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 190 transitions. Word has length 13 [2023-12-16 08:20:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:20:00,709 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 190 transitions. [2023-12-16 08:20:00,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-16 08:20:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 190 transitions. [2023-12-16 08:20:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 08:20:00,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:20:00,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:20:00,719 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 (9)] Ended with exit code 0 [2023-12-16 08:20:00,912 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-16 08:20:00,913 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:00,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:00,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1183764914, now seen corresponding path program 1 times [2023-12-16 08:20:00,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:00,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301756954] [2023-12-16 08:20:00,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:00,914 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-16 08:20:00,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:00,915 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-16 08:20:00,916 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-16 08:20:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:20:00,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:20:00,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:20:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:20:00,981 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:20:00,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:20:00,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301756954] [2023-12-16 08:20:00,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301756954] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:20:00,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:20:00,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:20:00,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267420180] [2023-12-16 08:20:00,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:20:00,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:20:00,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:20:00,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:20:00,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:00,982 INFO L87 Difference]: Start difference. First operand 132 states and 190 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 08:20:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:20:01,004 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2023-12-16 08:20:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:20:01,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2023-12-16 08:20:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:20:01,006 INFO L225 Difference]: With dead ends: 228 [2023-12-16 08:20:01,006 INFO L226 Difference]: Without dead ends: 226 [2023-12-16 08:20:01,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:01,009 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:20:01,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:20:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-12-16 08:20:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2023-12-16 08:20:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.4136125654450262) internal successors, (270), 191 states have internal predecessors, (270), 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-16 08:20:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2023-12-16 08:20:01,036 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 14 [2023-12-16 08:20:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:20:01,036 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2023-12-16 08:20:01,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 08:20:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2023-12-16 08:20:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 08:20:01,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:20:01,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:20:01,050 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-16 08:20:01,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:20:01,244 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:01,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:01,245 INFO L85 PathProgramCache]: Analyzing trace with hash 374418288, now seen corresponding path program 1 times [2023-12-16 08:20:01,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:01,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96814211] [2023-12-16 08:20:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:01,245 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-16 08:20:01,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:01,247 INFO L229 MonitoredProcess]: Starting monitored process 11 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-16 08:20:01,255 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 (11)] Waiting until timeout for monitored process [2023-12-16 08:20:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:20:01,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:20:01,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:20:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:20:01,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:20:01,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:20:01,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96814211] [2023-12-16 08:20:01,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96814211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:20:01,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:20:01,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:20:01,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917546529] [2023-12-16 08:20:01,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:20:01,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:20:01,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:20:01,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:20:01,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:01,275 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 08:20:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:20:01,290 INFO L93 Difference]: Finished difference Result 436 states and 608 transitions. [2023-12-16 08:20:01,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:20:01,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2023-12-16 08:20:01,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:20:01,291 INFO L225 Difference]: With dead ends: 436 [2023-12-16 08:20:01,292 INFO L226 Difference]: Without dead ends: 250 [2023-12-16 08:20:01,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:01,293 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:20:01,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 73 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:20:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-12-16 08:20:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2023-12-16 08:20:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 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-16 08:20:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 330 transitions. [2023-12-16 08:20:01,306 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 330 transitions. Word has length 14 [2023-12-16 08:20:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:20:01,306 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 330 transitions. [2023-12-16 08:20:01,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 08:20:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 330 transitions. [2023-12-16 08:20:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 08:20:01,307 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:20:01,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:20:01,317 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 08:20:01,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-16 08:20:01,509 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:01,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:01,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1957777339, now seen corresponding path program 1 times [2023-12-16 08:20:01,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:01,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352626535] [2023-12-16 08:20:01,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:01,510 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-16 08:20:01,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:01,518 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-16 08:20:01,519 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-16 08:20:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:20:01,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:20:01,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:20:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:20:01,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:20:01,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:20:01,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352626535] [2023-12-16 08:20:01,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352626535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:20:01,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:20:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:20:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416087289] [2023-12-16 08:20:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:20:01,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:20:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:20:01,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:20:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:01,550 INFO L87 Difference]: Start difference. First operand 248 states and 330 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 08:20:01,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:20:01,565 INFO L93 Difference]: Finished difference Result 380 states and 504 transitions. [2023-12-16 08:20:01,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:20:01,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2023-12-16 08:20:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:20:01,566 INFO L225 Difference]: With dead ends: 380 [2023-12-16 08:20:01,566 INFO L226 Difference]: Without dead ends: 262 [2023-12-16 08:20:01,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:01,567 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 22 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:20:01,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 65 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:20:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-12-16 08:20:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2023-12-16 08:20:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.305019305019305) internal successors, (338), 259 states have internal predecessors, (338), 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-16 08:20:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 338 transitions. [2023-12-16 08:20:01,577 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 338 transitions. Word has length 15 [2023-12-16 08:20:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:20:01,577 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 338 transitions. [2023-12-16 08:20:01,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 08:20:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 338 transitions. [2023-12-16 08:20:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 08:20:01,578 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:20:01,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:20:01,595 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 (12)] Forceful destruction successful, exit code 0 [2023-12-16 08:20:01,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-16 08:20:01,781 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:01,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:01,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1277718969, now seen corresponding path program 1 times [2023-12-16 08:20:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:01,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840781044] [2023-12-16 08:20:01,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:01,782 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-16 08:20:01,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:01,789 INFO L229 MonitoredProcess]: Starting monitored process 13 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-16 08:20:01,790 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 (13)] Waiting until timeout for monitored process [2023-12-16 08:20:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:20:01,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:20:01,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:20:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:20:01,825 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:20:01,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:20:01,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840781044] [2023-12-16 08:20:01,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840781044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:20:01,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:20:01,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:20:01,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512468570] [2023-12-16 08:20:01,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:20:01,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:20:01,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:20:01,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:20:01,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:01,826 INFO L87 Difference]: Start difference. First operand 260 states and 338 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 08:20:01,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:20:01,843 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2023-12-16 08:20:01,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:20:01,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2023-12-16 08:20:01,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:20:01,845 INFO L225 Difference]: With dead ends: 422 [2023-12-16 08:20:01,845 INFO L226 Difference]: Without dead ends: 420 [2023-12-16 08:20:01,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:01,846 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:20:01,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 55 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:20:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2023-12-16 08:20:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 388. [2023-12-16 08:20:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.2661498708010337) internal successors, (490), 387 states have internal predecessors, (490), 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-16 08:20:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2023-12-16 08:20:01,857 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 15 [2023-12-16 08:20:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:20:01,858 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2023-12-16 08:20:01,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 08:20:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2023-12-16 08:20:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 08:20:01,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:20:01,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:20:01,872 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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 08:20:02,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-16 08:20:02,076 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:02,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:02,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2087065595, now seen corresponding path program 1 times [2023-12-16 08:20:02,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:02,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933616044] [2023-12-16 08:20:02,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:02,077 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-16 08:20:02,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:02,078 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-16 08:20:02,081 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-16 08:20:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:20:02,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:20:02,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:20:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:20:02,143 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:20:02,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:20:02,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933616044] [2023-12-16 08:20:02,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933616044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:20:02,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:20:02,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:20:02,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825286002] [2023-12-16 08:20:02,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:20:02,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:20:02,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:20:02,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:20:02,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:02,152 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 08:20:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:20:02,180 INFO L93 Difference]: Finished difference Result 852 states and 1050 transitions. [2023-12-16 08:20:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:20:02,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2023-12-16 08:20:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:20:02,181 INFO L225 Difference]: With dead ends: 852 [2023-12-16 08:20:02,181 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 08:20:02,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:02,183 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 18 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:20:02,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 72 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:20:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 08:20:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 08:20:02,184 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-16 08:20:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 08:20:02,184 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2023-12-16 08:20:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:20:02,184 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 08:20:02,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-16 08:20:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 08:20:02,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 08:20:02,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 08:20:02,191 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-16 08:20:02,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-16 08:20:02,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 08:20:02,398 INFO L902 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2023-12-16 08:20:02,398 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-12-16 08:20:02,398 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 6 95) no Hoare annotation was computed. [2023-12-16 08:20:02,398 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 26 90) no Hoare annotation was computed. [2023-12-16 08:20:02,398 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 30) no Hoare annotation was computed. [2023-12-16 08:20:02,399 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2023-12-16 08:20:02,399 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-12-16 08:20:02,399 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 26 90) no Hoare annotation was computed. [2023-12-16 08:20:02,399 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-12-16 08:20:02,399 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 08:20:02,399 INFO L899 garLoopResultBuilder]: For program point L91(lines 7 95) no Hoare annotation was computed. [2023-12-16 08:20:02,399 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 26 90) no Hoare annotation was computed. [2023-12-16 08:20:02,400 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 08:20:02,400 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-16 08:20:02,400 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 26 90) no Hoare annotation was computed. [2023-12-16 08:20:02,400 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 7 95) no Hoare annotation was computed. [2023-12-16 08:20:02,400 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 26 90) no Hoare annotation was computed. [2023-12-16 08:20:02,400 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 26 90) no Hoare annotation was computed. [2023-12-16 08:20:02,400 INFO L899 garLoopResultBuilder]: For program point L80-1(lines 26 90) no Hoare annotation was computed. [2023-12-16 08:20:02,400 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 26 90) no Hoare annotation was computed. [2023-12-16 08:20:02,400 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-12-16 08:20:02,400 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2023-12-16 08:20:02,400 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 26 90) no Hoare annotation was computed. [2023-12-16 08:20:02,403 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:20:02,405 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 08:20:02,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 08:20:02 BoogieIcfgContainer [2023-12-16 08:20:02,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 08:20:02,412 INFO L158 Benchmark]: Toolchain (without parser) took 4584.84ms. Allocated memory was 256.9MB in the beginning and 309.3MB in the end (delta: 52.4MB). Free memory was 213.9MB in the beginning and 149.0MB in the end (delta: 65.0MB). Peak memory consumption was 118.4MB. Max. memory is 8.0GB. [2023-12-16 08:20:02,412 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 08:20:02,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.98ms. Allocated memory is still 256.9MB. Free memory was 213.9MB in the beginning and 202.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 08:20:02,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.76ms. Allocated memory is still 256.9MB. Free memory was 202.4MB in the beginning and 200.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 08:20:02,413 INFO L158 Benchmark]: Boogie Preprocessor took 35.57ms. Allocated memory is still 256.9MB. Free memory was 200.8MB in the beginning and 199.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 08:20:02,413 INFO L158 Benchmark]: RCFGBuilder took 235.49ms. Allocated memory is still 256.9MB. Free memory was 199.3MB in the beginning and 186.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 08:20:02,414 INFO L158 Benchmark]: TraceAbstraction took 4114.85ms. Allocated memory was 256.9MB in the beginning and 309.3MB in the end (delta: 52.4MB). Free memory was 186.2MB in the beginning and 149.0MB in the end (delta: 37.2MB). Peak memory consumption was 90.1MB. Max. memory is 8.0GB. [2023-12-16 08:20:02,415 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.14ms. Allocated memory is still 159.4MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 163.98ms. Allocated memory is still 256.9MB. Free memory was 213.9MB in the beginning and 202.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.76ms. Allocated memory is still 256.9MB. Free memory was 202.4MB in the beginning and 200.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.57ms. Allocated memory is still 256.9MB. Free memory was 200.8MB in the beginning and 199.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 235.49ms. Allocated memory is still 256.9MB. Free memory was 199.3MB in the beginning and 186.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4114.85ms. Allocated memory was 256.9MB in the beginning and 309.3MB in the end (delta: 52.4MB). Free memory was 186.2MB in the beginning and 149.0MB in the end (delta: 37.2MB). Peak memory consumption was 90.1MB. 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: 93]: 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 1 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 887 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 343 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 544 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=12, InterpolantAutomatonStates: 39, 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, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 34 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FormulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FormulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 408 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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: 26]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-12-16 08:20:02,440 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...