/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/floats-nonlinear/color-magicseries2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 22:14:02,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 22:14:03,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 22:14:03,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 22:14:03,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 22:14:03,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 22:14:03,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 22:14:03,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 22:14:03,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 22:14:03,073 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 22:14:03,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 22:14:03,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 22:14:03,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 22:14:03,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 22:14:03,075 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 22:14:03,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 22:14:03,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 22:14:03,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 22:14:03,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 22:14:03,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 22:14:03,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 22:14:03,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 22:14:03,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 22:14:03,081 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 22:14:03,081 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 22:14:03,082 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 22:14:03,082 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 22:14:03,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 22:14:03,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 22:14:03,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 22:14:03,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 22:14:03,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 22:14:03,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 22:14:03,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 22:14:03,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 22:14:03,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 22:14:03,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 22:14:03,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 22:14:03,089 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 22:14:03,089 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 22:14:03,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 22:14:03,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 22:14:03,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 22:14:03,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 22:14:03,091 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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 [2024-11-05 22:14:03,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 22:14:03,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 22:14:03,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 22:14:03,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 22:14:03,330 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 22:14:03,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-nonlinear/color-magicseries2.c [2024-11-05 22:14:04,782 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 22:14:04,954 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 22:14:04,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-magicseries2.c [2024-11-05 22:14:04,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64fc2aa0/df7a1709fdca4cea9122e118f0436823/FLAGd18406a51 [2024-11-05 22:14:04,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d64fc2aa0/df7a1709fdca4cea9122e118f0436823 [2024-11-05 22:14:04,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 22:14:04,984 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 22:14:04,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 22:14:04,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 22:14:04,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 22:14:04,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 10:14:04" (1/1) ... [2024-11-05 22:14:04,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@501cfec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:04, skipping insertion in model container [2024-11-05 22:14:04,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 10:14:04" (1/1) ... [2024-11-05 22:14:05,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 22:14:05,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-magicseries2.c[613,626] [2024-11-05 22:14:05,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 22:14:05,227 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 22:14:05,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-magicseries2.c[613,626] [2024-11-05 22:14:05,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 22:14:05,273 INFO L204 MainTranslator]: Completed translation [2024-11-05 22:14:05,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05 WrapperNode [2024-11-05 22:14:05,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 22:14:05,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 22:14:05,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 22:14:05,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 22:14:05,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (1/1) ... [2024-11-05 22:14:05,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (1/1) ... [2024-11-05 22:14:05,314 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2024-11-05 22:14:05,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 22:14:05,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 22:14:05,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 22:14:05,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 22:14:05,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (1/1) ... [2024-11-05 22:14:05,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (1/1) ... [2024-11-05 22:14:05,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (1/1) ... [2024-11-05 22:14:05,346 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-11-05 22:14:05,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (1/1) ... [2024-11-05 22:14:05,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (1/1) ... [2024-11-05 22:14:05,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (1/1) ... [2024-11-05 22:14:05,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (1/1) ... [2024-11-05 22:14:05,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (1/1) ... [2024-11-05 22:14:05,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (1/1) ... [2024-11-05 22:14:05,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 22:14:05,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 22:14:05,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 22:14:05,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 22:14:05,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (1/1) ... [2024-11-05 22:14:05,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 22:14:05,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 22:14:05,390 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) [2024-11-05 22:14:05,392 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 [2024-11-05 22:14:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 22:14:05,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 22:14:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 22:14:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-05 22:14:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-05 22:14:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 22:14:05,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-05 22:14:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-05 22:14:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-05 22:14:05,417 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-05 22:14:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 22:14:05,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 22:14:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 22:14:05,487 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 22:14:05,489 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 22:14:05,777 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-05 22:14:05,777 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 22:14:05,795 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 22:14:05,795 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 22:14:05,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 10:14:05 BoogieIcfgContainer [2024-11-05 22:14:05,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 22:14:05,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 22:14:05,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 22:14:05,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 22:14:05,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 10:14:04" (1/3) ... [2024-11-05 22:14:05,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170711f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 10:14:05, skipping insertion in model container [2024-11-05 22:14:05,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 10:14:05" (2/3) ... [2024-11-05 22:14:05,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170711f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 10:14:05, skipping insertion in model container [2024-11-05 22:14:05,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 10:14:05" (3/3) ... [2024-11-05 22:14:05,805 INFO L112 eAbstractionObserver]: Analyzing ICFG color-magicseries2.c [2024-11-05 22:14:05,821 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 22:14:05,821 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 22:14:05,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 22:14:05,887 INFO L333 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, 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;@870ce98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 22:14:05,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 22:14:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 22:14:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-05 22:14:05,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:05,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:05,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:05,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:05,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1909413201, now seen corresponding path program 1 times [2024-11-05 22:14:05,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:05,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [81028691] [2024-11-05 22:14:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:05,911 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 [2024-11-05 22:14:05,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:05,913 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) [2024-11-05 22:14:05,914 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 [2024-11-05 22:14:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:05,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 22:14:05,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 22:14:06,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 22:14:06,135 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:06,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [81028691] [2024-11-05 22:14:06,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [81028691] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:14:06,138 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:14:06,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-05 22:14:06,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38561900] [2024-11-05 22:14:06,140 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:14:06,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 22:14:06,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 22:14:06,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 22:14:06,170 INFO L87 Difference]: Start difference. First operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 22:14:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:06,238 INFO L93 Difference]: Finished difference Result 75 states and 108 transitions. [2024-11-05 22:14:06,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 22:14:06,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-05 22:14:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:06,246 INFO L225 Difference]: With dead ends: 75 [2024-11-05 22:14:06,246 INFO L226 Difference]: Without dead ends: 39 [2024-11-05 22:14:06,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 22:14:06,251 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:06,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:14:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-05 22:14:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-05 22:14:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 22:14:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-11-05 22:14:06,285 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2024-11-05 22:14:06,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:06,286 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-11-05 22:14:06,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 22:14:06,286 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2024-11-05 22:14:06,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-05 22:14:06,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:06,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:06,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-05 22:14:06,489 WARN L453 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 [2024-11-05 22:14:06,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:06,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2092151088, now seen corresponding path program 1 times [2024-11-05 22:14:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:06,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [589484198] [2024-11-05 22:14:06,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:06,491 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 [2024-11-05 22:14:06,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:06,494 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) [2024-11-05 22:14:06,495 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 [2024-11-05 22:14:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:06,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 22:14:06,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 22:14:06,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 22:14:06,593 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:06,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [589484198] [2024-11-05 22:14:06,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [589484198] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:14:06,593 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:14:06,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2024-11-05 22:14:06,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779667507] [2024-11-05 22:14:06,594 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:14:06,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 22:14:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:06,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 22:14:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-05 22:14:06,597 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-05 22:14:06,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:06,617 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2024-11-05 22:14:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 22:14:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-05 22:14:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:06,619 INFO L225 Difference]: With dead ends: 43 [2024-11-05 22:14:06,619 INFO L226 Difference]: Without dead ends: 39 [2024-11-05 22:14:06,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-05 22:14:06,622 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 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 [2024-11-05 22:14:06,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:14:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-05 22:14:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-05 22:14:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 22:14:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2024-11-05 22:14:06,635 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 17 [2024-11-05 22:14:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:06,636 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2024-11-05 22:14:06,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-05 22:14:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2024-11-05 22:14:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-05 22:14:06,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:06,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:06,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 22:14:06,838 WARN L453 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 [2024-11-05 22:14:06,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:06,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:06,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1014348991, now seen corresponding path program 1 times [2024-11-05 22:14:06,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:06,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [364962023] [2024-11-05 22:14:06,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:06,840 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 [2024-11-05 22:14:06,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:06,842 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) [2024-11-05 22:14:06,844 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 [2024-11-05 22:14:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:06,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 22:14:06,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 22:14:06,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 22:14:06,977 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:06,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [364962023] [2024-11-05 22:14:06,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [364962023] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:14:06,978 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:14:06,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2024-11-05 22:14:06,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952190745] [2024-11-05 22:14:06,978 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:14:06,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 22:14:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:06,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 22:14:06,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-05 22:14:06,981 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-05 22:14:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:07,067 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2024-11-05 22:14:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 22:14:07,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-05 22:14:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:07,073 INFO L225 Difference]: With dead ends: 76 [2024-11-05 22:14:07,073 INFO L226 Difference]: Without dead ends: 37 [2024-11-05 22:14:07,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-05 22:14:07,074 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:07,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 22:14:07,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-05 22:14:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-05 22:14:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-11-05 22:14:07,086 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 19 [2024-11-05 22:14:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:07,086 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-11-05 22:14:07,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-05 22:14:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2024-11-05 22:14:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-05 22:14:07,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:07,088 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:07,093 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 [2024-11-05 22:14:07,289 WARN L453 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 [2024-11-05 22:14:07,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:07,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash 683802393, now seen corresponding path program 1 times [2024-11-05 22:14:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [405993155] [2024-11-05 22:14:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:07,291 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 [2024-11-05 22:14:07,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:07,295 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) [2024-11-05 22:14:07,296 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 [2024-11-05 22:14:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:07,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 22:14:07,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:07,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:07,408 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [405993155] [2024-11-05 22:14:07,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [405993155] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:14:07,408 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:14:07,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-05 22:14:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17067065] [2024-11-05 22:14:07,409 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:14:07,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-05 22:14:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:07,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-05 22:14:07,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 22:14:07,413 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:07,437 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-05 22:14:07,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-05 22:14:07,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-05 22:14:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:07,440 INFO L225 Difference]: With dead ends: 42 [2024-11-05 22:14:07,440 INFO L226 Difference]: Without dead ends: 37 [2024-11-05 22:14:07,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-05 22:14:07,442 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 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 [2024-11-05 22:14:07,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:14:07,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-05 22:14:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-05 22:14:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-11-05 22:14:07,454 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 37 [2024-11-05 22:14:07,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:07,455 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-05 22:14:07,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-11-05 22:14:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-05 22:14:07,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:07,457 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:07,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 22:14:07,660 WARN L453 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 [2024-11-05 22:14:07,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:07,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:07,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1611689165, now seen corresponding path program 1 times [2024-11-05 22:14:07,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:07,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1195980839] [2024-11-05 22:14:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:07,662 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 [2024-11-05 22:14:07,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:07,663 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) [2024-11-05 22:14:07,664 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 [2024-11-05 22:14:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:07,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 22:14:07,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:07,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:07,772 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1195980839] [2024-11-05 22:14:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1195980839] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:14:07,773 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:14:07,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 22:14:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831200469] [2024-11-05 22:14:07,773 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:14:07,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 22:14:07,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:07,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 22:14:07,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 22:14:07,775 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:07,806 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2024-11-05 22:14:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 22:14:07,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-11-05 22:14:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:07,808 INFO L225 Difference]: With dead ends: 54 [2024-11-05 22:14:07,808 INFO L226 Difference]: Without dead ends: 47 [2024-11-05 22:14:07,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 22:14:07,809 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:07,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 70 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:14:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-05 22:14:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-11-05 22:14:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2024-11-05 22:14:07,819 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 40 [2024-11-05 22:14:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:07,819 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-11-05 22:14:07,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2024-11-05 22:14:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 22:14:07,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:07,821 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:07,826 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 [2024-11-05 22:14:08,022 WARN L453 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 [2024-11-05 22:14:08,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:08,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash 35157834, now seen corresponding path program 1 times [2024-11-05 22:14:08,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:08,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [564966077] [2024-11-05 22:14:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:08,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 22:14:08,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:08,027 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) [2024-11-05 22:14:08,028 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 [2024-11-05 22:14:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:08,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-05 22:14:08,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:08,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:08,143 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:08,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [564966077] [2024-11-05 22:14:08,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [564966077] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:14:08,144 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:14:08,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-05 22:14:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159868109] [2024-11-05 22:14:08,144 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:14:08,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 22:14:08,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 22:14:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 22:14:08,146 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:08,169 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2024-11-05 22:14:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 22:14:08,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-05 22:14:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:08,173 INFO L225 Difference]: With dead ends: 71 [2024-11-05 22:14:08,173 INFO L226 Difference]: Without dead ends: 53 [2024-11-05 22:14:08,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-05 22:14:08,174 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:08,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 75 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:14:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-05 22:14:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-05 22:14:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 47 states have internal predecessors, (56), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2024-11-05 22:14:08,186 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 42 [2024-11-05 22:14:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:08,186 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2024-11-05 22:14:08,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2024-11-05 22:14:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-05 22:14:08,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:08,191 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:08,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-05 22:14:08,392 WARN L453 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 [2024-11-05 22:14:08,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:08,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:08,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1635340726, now seen corresponding path program 1 times [2024-11-05 22:14:08,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:08,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1629713053] [2024-11-05 22:14:08,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:08,394 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 [2024-11-05 22:14:08,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:08,395 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) [2024-11-05 22:14:08,396 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 [2024-11-05 22:14:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:08,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 22:14:08,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:08,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:08,568 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:08,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1629713053] [2024-11-05 22:14:08,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1629713053] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:08,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:08,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 22:14:08,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503724328] [2024-11-05 22:14:08,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:08,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 22:14:08,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:08,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 22:14:08,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 22:14:08,571 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:08,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:08,623 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2024-11-05 22:14:08,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 22:14:08,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2024-11-05 22:14:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:08,625 INFO L225 Difference]: With dead ends: 87 [2024-11-05 22:14:08,626 INFO L226 Difference]: Without dead ends: 65 [2024-11-05 22:14:08,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 22:14:08,627 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:08,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 188 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:14:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-05 22:14:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-05 22:14:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2024-11-05 22:14:08,640 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 48 [2024-11-05 22:14:08,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:08,641 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2024-11-05 22:14:08,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2024-11-05 22:14:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-05 22:14:08,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:08,644 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:08,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-05 22:14:08,850 WARN L453 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 [2024-11-05 22:14:08,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:08,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:08,851 INFO L85 PathProgramCache]: Analyzing trace with hash 657433930, now seen corresponding path program 2 times [2024-11-05 22:14:08,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:08,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807255740] [2024-11-05 22:14:08,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:08,852 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 [2024-11-05 22:14:08,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:08,855 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) [2024-11-05 22:14:08,856 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 [2024-11-05 22:14:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:08,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 22:14:08,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-05 22:14:08,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-05 22:14:08,987 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:08,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807255740] [2024-11-05 22:14:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [807255740] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 22:14:08,988 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 22:14:08,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2024-11-05 22:14:08,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908014540] [2024-11-05 22:14:08,988 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 22:14:08,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 22:14:08,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:08,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 22:14:08,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 22:14:08,989 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:09,029 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2024-11-05 22:14:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 22:14:09,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 54 [2024-11-05 22:14:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:09,031 INFO L225 Difference]: With dead ends: 71 [2024-11-05 22:14:09,031 INFO L226 Difference]: Without dead ends: 65 [2024-11-05 22:14:09,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 22:14:09,035 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:09,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 22:14:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-05 22:14:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-05 22:14:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.206896551724138) internal successors, (70), 59 states have internal predecessors, (70), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2024-11-05 22:14:09,045 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 54 [2024-11-05 22:14:09,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:09,045 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2024-11-05 22:14:09,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2024-11-05 22:14:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-05 22:14:09,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:09,050 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:09,057 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 [2024-11-05 22:14:09,251 WARN L453 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 [2024-11-05 22:14:09,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:09,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash 923057875, now seen corresponding path program 1 times [2024-11-05 22:14:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:09,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2129664643] [2024-11-05 22:14:09,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:09,252 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 [2024-11-05 22:14:09,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:09,253 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) [2024-11-05 22:14:09,254 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 [2024-11-05 22:14:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:09,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 22:14:09,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 61 proven. 22 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-05 22:14:09,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:09,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:14:09,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-05 22:14:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 61 proven. 22 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-05 22:14:09,973 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2129664643] [2024-11-05 22:14:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2129664643] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:09,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:09,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-05 22:14:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670423355] [2024-11-05 22:14:09,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:09,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-05 22:14:09,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:09,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-05 22:14:09,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-05 22:14:09,976 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:43,630 INFO L93 Difference]: Finished difference Result 155 states and 197 transitions. [2024-11-05 22:14:43,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-05 22:14:43,630 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2024-11-05 22:14:43,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:43,632 INFO L225 Difference]: With dead ends: 155 [2024-11-05 22:14:43,632 INFO L226 Difference]: Without dead ends: 111 [2024-11-05 22:14:43,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=309, Invalid=874, Unknown=7, NotChecked=0, Total=1190 [2024-11-05 22:14:43,633 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 92 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:43,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 416 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 22:14:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-05 22:14:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2024-11-05 22:14:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 86 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 117 transitions. [2024-11-05 22:14:43,643 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 117 transitions. Word has length 74 [2024-11-05 22:14:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:43,643 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 117 transitions. [2024-11-05 22:14:43,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2024-11-05 22:14:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-05 22:14:43,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:43,644 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:43,652 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 [2024-11-05 22:14:43,844 WARN L453 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 [2024-11-05 22:14:43,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:43,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:43,845 INFO L85 PathProgramCache]: Analyzing trace with hash -922309291, now seen corresponding path program 1 times [2024-11-05 22:14:43,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:43,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [694058231] [2024-11-05 22:14:43,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:43,846 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 [2024-11-05 22:14:43,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:43,847 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) [2024-11-05 22:14:43,848 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 [2024-11-05 22:14:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:43,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 22:14:43,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-05 22:14:44,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:44,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:14:44,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-05 22:14:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-05 22:14:44,471 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:44,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [694058231] [2024-11-05 22:14:44,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [694058231] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:44,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:44,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-11-05 22:14:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976502595] [2024-11-05 22:14:44,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:44,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-05 22:14:44,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:44,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-05 22:14:44,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2024-11-05 22:14:44,473 INFO L87 Difference]: Start difference. First operand 92 states and 117 transitions. Second operand has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:45,125 INFO L93 Difference]: Finished difference Result 193 states and 249 transitions. [2024-11-05 22:14:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-05 22:14:45,126 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2024-11-05 22:14:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:45,127 INFO L225 Difference]: With dead ends: 193 [2024-11-05 22:14:45,127 INFO L226 Difference]: Without dead ends: 169 [2024-11-05 22:14:45,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2024-11-05 22:14:45,129 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 134 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:45,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 501 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 22:14:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-05 22:14:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2024-11-05 22:14:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 139 states have internal predecessors, (179), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2024-11-05 22:14:45,151 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 74 [2024-11-05 22:14:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:45,154 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2024-11-05 22:14:45,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2024-11-05 22:14:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-05 22:14:45,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:45,155 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:45,162 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 [2024-11-05 22:14:45,356 WARN L453 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 [2024-11-05 22:14:45,356 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:45,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash -703454573, now seen corresponding path program 2 times [2024-11-05 22:14:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:45,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [847997347] [2024-11-05 22:14:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:45,357 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 [2024-11-05 22:14:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:45,360 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) [2024-11-05 22:14:45,361 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 [2024-11-05 22:14:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:45,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-05 22:14:45,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 53 proven. 40 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-05 22:14:45,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:45,856 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-05 22:14:45,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2024-11-05 22:14:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 57 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-05 22:14:45,918 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:45,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [847997347] [2024-11-05 22:14:45,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [847997347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:45,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:45,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2024-11-05 22:14:45,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020658701] [2024-11-05 22:14:45,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:45,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 22:14:45,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:45,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 22:14:45,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-05 22:14:45,920 INFO L87 Difference]: Start difference. First operand 145 states and 190 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:46,583 INFO L93 Difference]: Finished difference Result 343 states and 450 transitions. [2024-11-05 22:14:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-05 22:14:46,584 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2024-11-05 22:14:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:46,585 INFO L225 Difference]: With dead ends: 343 [2024-11-05 22:14:46,586 INFO L226 Difference]: Without dead ends: 305 [2024-11-05 22:14:46,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2024-11-05 22:14:46,587 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 89 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:46,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 327 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 22:14:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-05 22:14:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 281. [2024-11-05 22:14:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 274 states have (on average 1.3065693430656935) internal successors, (358), 275 states have internal predecessors, (358), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 369 transitions. [2024-11-05 22:14:46,641 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 369 transitions. Word has length 74 [2024-11-05 22:14:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:46,641 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 369 transitions. [2024-11-05 22:14:46,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 19 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 369 transitions. [2024-11-05 22:14:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-05 22:14:46,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:46,642 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:46,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-05 22:14:46,846 WARN L453 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 [2024-11-05 22:14:46,847 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:46,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1902568981, now seen corresponding path program 3 times [2024-11-05 22:14:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:46,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684529132] [2024-11-05 22:14:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:46,848 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 [2024-11-05 22:14:46,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:46,851 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) [2024-11-05 22:14:46,852 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 [2024-11-05 22:14:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:46,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-05 22:14:46,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 40 proven. 63 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 22:14:47,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:47,436 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-05 22:14:47,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2024-11-05 22:14:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 43 proven. 60 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 22:14:47,513 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684529132] [2024-11-05 22:14:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1684529132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:47,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:47,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2024-11-05 22:14:47,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247926716] [2024-11-05 22:14:47,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:47,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-05 22:14:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-05 22:14:47,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-05 22:14:47,515 INFO L87 Difference]: Start difference. First operand 281 states and 369 transitions. Second operand has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:48,235 INFO L93 Difference]: Finished difference Result 724 states and 946 transitions. [2024-11-05 22:14:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-05 22:14:48,236 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2024-11-05 22:14:48,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:48,238 INFO L225 Difference]: With dead ends: 724 [2024-11-05 22:14:48,239 INFO L226 Difference]: Without dead ends: 636 [2024-11-05 22:14:48,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=1260, Unknown=0, NotChecked=0, Total=1482 [2024-11-05 22:14:48,240 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 98 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:48,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 455 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 22:14:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-11-05 22:14:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 599. [2024-11-05 22:14:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 592 states have (on average 1.2989864864864864) internal successors, (769), 593 states have internal predecessors, (769), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 780 transitions. [2024-11-05 22:14:48,298 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 780 transitions. Word has length 74 [2024-11-05 22:14:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:48,298 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 780 transitions. [2024-11-05 22:14:48,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 23 states have internal predecessors, (81), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 780 transitions. [2024-11-05 22:14:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-05 22:14:48,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:48,300 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:48,305 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 (13)] Ended with exit code 0 [2024-11-05 22:14:48,500 WARN L453 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 [2024-11-05 22:14:48,500 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:48,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash 881500627, now seen corresponding path program 4 times [2024-11-05 22:14:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:48,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [333443981] [2024-11-05 22:14:48,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:48,501 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 [2024-11-05 22:14:48,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:48,503 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) [2024-11-05 22:14:48,504 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 [2024-11-05 22:14:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:48,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 22:14:48,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 21 proven. 86 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:48,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:49,176 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-05 22:14:49,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2024-11-05 22:14:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 23 proven. 84 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 22:14:49,271 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:49,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [333443981] [2024-11-05 22:14:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [333443981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:49,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:49,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2024-11-05 22:14:49,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975658671] [2024-11-05 22:14:49,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:49,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-05 22:14:49,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:49,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-05 22:14:49,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2024-11-05 22:14:49,273 INFO L87 Difference]: Start difference. First operand 599 states and 780 transitions. Second operand has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 states have internal predecessors, (87), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:50,338 INFO L93 Difference]: Finished difference Result 1763 states and 2309 transitions. [2024-11-05 22:14:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-05 22:14:50,339 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 states have internal predecessors, (87), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2024-11-05 22:14:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:50,345 INFO L225 Difference]: With dead ends: 1763 [2024-11-05 22:14:50,345 INFO L226 Difference]: Without dead ends: 1541 [2024-11-05 22:14:50,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=1725, Unknown=0, NotChecked=0, Total=1980 [2024-11-05 22:14:50,348 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 111 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:50,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 647 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 22:14:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-11-05 22:14:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1415. [2024-11-05 22:14:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1408 states have (on average 1.3075284090909092) internal successors, (1841), 1409 states have internal predecessors, (1841), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1852 transitions. [2024-11-05 22:14:50,479 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1852 transitions. Word has length 74 [2024-11-05 22:14:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:50,479 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1852 transitions. [2024-11-05 22:14:50,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 states have internal predecessors, (87), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1852 transitions. [2024-11-05 22:14:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-05 22:14:50,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:50,482 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:50,487 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 [2024-11-05 22:14:50,682 WARN L453 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 [2024-11-05 22:14:50,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:50,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:50,683 INFO L85 PathProgramCache]: Analyzing trace with hash 294694613, now seen corresponding path program 5 times [2024-11-05 22:14:50,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:50,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1781342199] [2024-11-05 22:14:50,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:50,683 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 [2024-11-05 22:14:50,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:50,684 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2024-11-05 22:14:50,686 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 (15)] Waiting until timeout for monitored process [2024-11-05 22:14:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:50,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 22:14:50,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-05 22:14:50,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-05 22:14:50,912 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:50,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1781342199] [2024-11-05 22:14:50,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1781342199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:50,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:50,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 22:14:50,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430748172] [2024-11-05 22:14:50,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:50,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 22:14:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:50,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 22:14:50,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 22:14:50,914 INFO L87 Difference]: Start difference. First operand 1415 states and 1852 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:51,115 INFO L93 Difference]: Finished difference Result 1647 states and 2159 transitions. [2024-11-05 22:14:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 22:14:51,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2024-11-05 22:14:51,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:51,122 INFO L225 Difference]: With dead ends: 1647 [2024-11-05 22:14:51,122 INFO L226 Difference]: Without dead ends: 1640 [2024-11-05 22:14:51,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-05 22:14:51,124 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 17 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:51,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 180 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 22:14:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-05 22:14:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2024-11-05 22:14:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1633 states have (on average 1.2737293325168402) internal successors, (2080), 1634 states have internal predecessors, (2080), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2091 transitions. [2024-11-05 22:14:51,288 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2091 transitions. Word has length 74 [2024-11-05 22:14:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:51,288 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2091 transitions. [2024-11-05 22:14:51,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2091 transitions. [2024-11-05 22:14:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-05 22:14:51,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:51,292 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:51,297 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 (15)] Forceful destruction successful, exit code 0 [2024-11-05 22:14:51,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 [2024-11-05 22:14:51,496 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:51,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:51,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1529860937, now seen corresponding path program 6 times [2024-11-05 22:14:51,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:51,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [525353497] [2024-11-05 22:14:51,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:51,496 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 [2024-11-05 22:14:51,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:51,499 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 22:14:51,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-05 22:14:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:51,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 22:14:51,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 7 proven. 392 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-05 22:14:52,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:52,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:14:52,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2024-11-05 22:14:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 7 proven. 392 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-05 22:14:52,530 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:52,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [525353497] [2024-11-05 22:14:52,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [525353497] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:52,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:52,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-05 22:14:52,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86264354] [2024-11-05 22:14:52,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:52,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-05 22:14:52,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:52,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-05 22:14:52,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2024-11-05 22:14:52,532 INFO L87 Difference]: Start difference. First operand 1640 states and 2091 transitions. Second operand has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:57,645 INFO L93 Difference]: Finished difference Result 1999 states and 2545 transitions. [2024-11-05 22:14:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-05 22:14:57,646 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 108 [2024-11-05 22:14:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:57,652 INFO L225 Difference]: With dead ends: 1999 [2024-11-05 22:14:57,652 INFO L226 Difference]: Without dead ends: 1826 [2024-11-05 22:14:57,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=145, Invalid=1044, Unknown=1, NotChecked=0, Total=1190 [2024-11-05 22:14:57,653 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 83 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:57,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 586 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 22:14:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2024-11-05 22:14:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1784. [2024-11-05 22:14:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1777 states have (on average 1.2701181767023073) internal successors, (2257), 1778 states have internal predecessors, (2257), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2268 transitions. [2024-11-05 22:14:57,825 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2268 transitions. Word has length 108 [2024-11-05 22:14:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:57,825 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2268 transitions. [2024-11-05 22:14:57,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2268 transitions. [2024-11-05 22:14:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-05 22:14:57,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:57,829 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 13, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:57,835 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 (16)] Ended with exit code 0 [2024-11-05 22:14:58,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 22:14:58,033 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:58,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:58,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1311006219, now seen corresponding path program 7 times [2024-11-05 22:14:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:58,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [690523942] [2024-11-05 22:14:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:58,034 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 [2024-11-05 22:14:58,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:58,035 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2024-11-05 22:14:58,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-05 22:14:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:58,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-05 22:14:58,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:14:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 164 proven. 233 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-05 22:14:58,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:14:58,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:14:58,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2024-11-05 22:14:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 164 proven. 233 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-05 22:14:58,732 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:14:58,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [690523942] [2024-11-05 22:14:58,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [690523942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:14:58,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:14:58,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2024-11-05 22:14:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536941158] [2024-11-05 22:14:58,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:14:58,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-05 22:14:58,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:14:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-05 22:14:58,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-11-05 22:14:58,733 INFO L87 Difference]: Start difference. First operand 1784 states and 2268 transitions. Second operand has 25 states, 25 states have (on average 4.0) internal successors, (100), 25 states have internal predecessors, (100), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:14:59,407 INFO L93 Difference]: Finished difference Result 2488 states and 3127 transitions. [2024-11-05 22:14:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 22:14:59,407 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.0) internal successors, (100), 25 states have internal predecessors, (100), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 108 [2024-11-05 22:14:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:14:59,414 INFO L225 Difference]: With dead ends: 2488 [2024-11-05 22:14:59,414 INFO L226 Difference]: Without dead ends: 2265 [2024-11-05 22:14:59,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2024-11-05 22:14:59,415 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 37 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 22:14:59,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 765 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 22:14:59,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2024-11-05 22:14:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2063. [2024-11-05 22:14:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 2056 states have (on average 1.2543774319066148) internal successors, (2579), 2057 states have internal predecessors, (2579), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:14:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2590 transitions. [2024-11-05 22:14:59,627 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 2590 transitions. Word has length 108 [2024-11-05 22:14:59,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:14:59,628 INFO L471 AbstractCegarLoop]: Abstraction has 2063 states and 2590 transitions. [2024-11-05 22:14:59,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.0) internal successors, (100), 25 states have internal predecessors, (100), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:14:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2590 transitions. [2024-11-05 22:14:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-05 22:14:59,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:14:59,632 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:14:59,639 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 (17)] Ended with exit code 0 [2024-11-05 22:14:59,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 [2024-11-05 22:14:59,833 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:14:59,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:14:59,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1201007727, now seen corresponding path program 8 times [2024-11-05 22:14:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:14:59,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [474560452] [2024-11-05 22:14:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:14:59,834 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 [2024-11-05 22:14:59,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:14:59,836 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2024-11-05 22:14:59,837 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 (18)] Waiting until timeout for monitored process [2024-11-05 22:14:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:14:59,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-05 22:14:59,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:15:00,210 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 245 proven. 82 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-05 22:15:00,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:15:00,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:15:00,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2024-11-05 22:15:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 247 proven. 80 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-05 22:15:00,450 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:15:00,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [474560452] [2024-11-05 22:15:00,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [474560452] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:15:00,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:15:00,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-05 22:15:00,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528412138] [2024-11-05 22:15:00,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:15:00,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-05 22:15:00,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:15:00,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-05 22:15:00,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2024-11-05 22:15:00,452 INFO L87 Difference]: Start difference. First operand 2063 states and 2590 transitions. Second operand has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 states have internal predecessors, (79), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:15:00,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:15:00,968 INFO L93 Difference]: Finished difference Result 2929 states and 3679 transitions. [2024-11-05 22:15:00,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 22:15:00,968 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 states have internal predecessors, (79), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 108 [2024-11-05 22:15:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:15:00,975 INFO L225 Difference]: With dead ends: 2929 [2024-11-05 22:15:00,975 INFO L226 Difference]: Without dead ends: 2301 [2024-11-05 22:15:00,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2024-11-05 22:15:00,977 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 53 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 22:15:00,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 421 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 22:15:00,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2024-11-05 22:15:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2285. [2024-11-05 22:15:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2285 states, 2278 states have (on average 1.2616330114135206) internal successors, (2874), 2279 states have internal predecessors, (2874), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:15:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 2885 transitions. [2024-11-05 22:15:01,190 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 2885 transitions. Word has length 108 [2024-11-05 22:15:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:15:01,190 INFO L471 AbstractCegarLoop]: Abstraction has 2285 states and 2885 transitions. [2024-11-05 22:15:01,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.95) internal successors, (79), 20 states have internal predecessors, (79), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:15:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2885 transitions. [2024-11-05 22:15:01,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-05 22:15:01,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:15:01,195 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 11, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:15:01,201 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 (18)] Ended with exit code 0 [2024-11-05 22:15:01,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 [2024-11-05 22:15:01,396 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:15:01,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:15:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 238481077, now seen corresponding path program 9 times [2024-11-05 22:15:01,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:15:01,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2043394447] [2024-11-05 22:15:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:15:01,396 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 [2024-11-05 22:15:01,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:15:01,398 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2024-11-05 22:15:01,399 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 (19)] Waiting until timeout for monitored process [2024-11-05 22:15:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:15:01,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 22:15:01,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:15:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 187 proven. 214 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-05 22:15:01,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:15:02,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:15:02,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2024-11-05 22:15:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 188 proven. 213 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-05 22:15:02,321 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:15:02,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2043394447] [2024-11-05 22:15:02,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2043394447] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:15:02,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:15:02,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-05 22:15:02,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146445692] [2024-11-05 22:15:02,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:15:02,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-05 22:15:02,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:15:02,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-05 22:15:02,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2024-11-05 22:15:02,323 INFO L87 Difference]: Start difference. First operand 2285 states and 2885 transitions. Second operand has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:15:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:15:03,099 INFO L93 Difference]: Finished difference Result 3080 states and 3906 transitions. [2024-11-05 22:15:03,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-05 22:15:03,100 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 108 [2024-11-05 22:15:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:15:03,107 INFO L225 Difference]: With dead ends: 3080 [2024-11-05 22:15:03,107 INFO L226 Difference]: Without dead ends: 2712 [2024-11-05 22:15:03,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2024-11-05 22:15:03,109 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 125 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 22:15:03,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 573 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 22:15:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2024-11-05 22:15:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2624. [2024-11-05 22:15:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 2617 states have (on average 1.2609858616736722) internal successors, (3300), 2618 states have internal predecessors, (3300), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:15:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3311 transitions. [2024-11-05 22:15:03,377 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3311 transitions. Word has length 108 [2024-11-05 22:15:03,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:15:03,377 INFO L471 AbstractCegarLoop]: Abstraction has 2624 states and 3311 transitions. [2024-11-05 22:15:03,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:15:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3311 transitions. [2024-11-05 22:15:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-05 22:15:03,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:15:03,383 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:15:03,388 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 (19)] Ended with exit code 0 [2024-11-05 22:15:03,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 [2024-11-05 22:15:03,583 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:15:03,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:15:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash -997447821, now seen corresponding path program 10 times [2024-11-05 22:15:03,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:15:03,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1571246719] [2024-11-05 22:15:03,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:15:03,584 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 [2024-11-05 22:15:03,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:15:03,585 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2024-11-05 22:15:03,587 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 (20)] Waiting until timeout for monitored process [2024-11-05 22:15:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 22:15:03,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 22:15:03,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 22:15:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 244 proven. 99 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-05 22:15:03,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 22:15:03,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 22:15:03,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2024-11-05 22:15:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 244 proven. 99 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-05 22:15:04,127 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 22:15:04,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1571246719] [2024-11-05 22:15:04,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1571246719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 22:15:04,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 22:15:04,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-11-05 22:15:04,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128381878] [2024-11-05 22:15:04,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 22:15:04,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-05 22:15:04,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 22:15:04,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-05 22:15:04,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-11-05 22:15:04,129 INFO L87 Difference]: Start difference. First operand 2624 states and 3311 transitions. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:15:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 22:15:04,602 INFO L93 Difference]: Finished difference Result 4090 states and 5126 transitions. [2024-11-05 22:15:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-05 22:15:04,602 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 108 [2024-11-05 22:15:04,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 22:15:04,612 INFO L225 Difference]: With dead ends: 4090 [2024-11-05 22:15:04,612 INFO L226 Difference]: Without dead ends: 3442 [2024-11-05 22:15:04,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-11-05 22:15:04,613 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 29 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 22:15:04,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 568 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 22:15:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2024-11-05 22:15:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3083. [2024-11-05 22:15:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 3076 states have (on average 1.254551365409623) internal successors, (3859), 3077 states have internal predecessors, (3859), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-05 22:15:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 3870 transitions. [2024-11-05 22:15:04,849 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 3870 transitions. Word has length 108 [2024-11-05 22:15:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 22:15:04,849 INFO L471 AbstractCegarLoop]: Abstraction has 3083 states and 3870 transitions. [2024-11-05 22:15:04,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 22:15:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3870 transitions. [2024-11-05 22:15:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-05 22:15:04,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 22:15:04,855 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:15:04,864 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 (20)] Ended with exit code 0 [2024-11-05 22:15:05,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 [2024-11-05 22:15:05,056 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 22:15:05,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 22:15:05,056 INFO L85 PathProgramCache]: Analyzing trace with hash -609406221, now seen corresponding path program 11 times [2024-11-05 22:15:05,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 22:15:05,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [682866015] [2024-11-05 22:15:05,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 22:15:05,057 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 [2024-11-05 22:15:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 22:15:05,058 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2024-11-05 22:15:05,059 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 (21)] Waiting until timeout for monitored process [2024-11-05 22:15:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 22:15:05,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 22:15:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 22:15:05,408 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-05 22:15:05,408 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-05 22:15:05,409 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 22:15:05,419 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 (21)] Forceful destruction successful, exit code 0 [2024-11-05 22:15:05,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 [2024-11-05 22:15:05,613 INFO L407 BasicCegarLoop]: Path program histogram: [11, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 22:15:05,659 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 22:15:05,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 10:15:05 BoogieIcfgContainer [2024-11-05 22:15:05,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 22:15:05,664 INFO L158 Benchmark]: Toolchain (without parser) took 60680.96ms. Allocated memory was 209.7MB in the beginning and 400.6MB in the end (delta: 190.8MB). Free memory was 154.3MB in the beginning and 167.4MB in the end (delta: -13.1MB). Peak memory consumption was 178.8MB. Max. memory is 8.0GB. [2024-11-05 22:15:05,665 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 209.7MB. Free memory was 164.6MB in the beginning and 164.5MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 22:15:05,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.17ms. Allocated memory is still 209.7MB. Free memory was 154.0MB in the beginning and 140.7MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-05 22:15:05,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.12ms. Allocated memory is still 209.7MB. Free memory was 140.7MB in the beginning and 138.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 22:15:05,665 INFO L158 Benchmark]: Boogie Preprocessor took 44.56ms. Allocated memory is still 209.7MB. Free memory was 138.9MB in the beginning and 136.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 22:15:05,665 INFO L158 Benchmark]: RCFGBuilder took 435.33ms. Allocated memory was 209.7MB in the beginning and 333.4MB in the end (delta: 123.7MB). Free memory was 136.5MB in the beginning and 296.4MB in the end (delta: -159.9MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2024-11-05 22:15:05,666 INFO L158 Benchmark]: TraceAbstraction took 59864.92ms. Allocated memory was 333.4MB in the beginning and 400.6MB in the end (delta: 67.1MB). Free memory was 295.9MB in the beginning and 167.4MB in the end (delta: 128.5MB). Peak memory consumption was 196.1MB. Max. memory is 8.0GB. [2024-11-05 22:15:05,667 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.12ms. Allocated memory is still 209.7MB. Free memory was 164.6MB in the beginning and 164.5MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 289.17ms. Allocated memory is still 209.7MB. Free memory was 154.0MB in the beginning and 140.7MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.12ms. Allocated memory is still 209.7MB. Free memory was 140.7MB in the beginning and 138.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.56ms. Allocated memory is still 209.7MB. Free memory was 138.9MB in the beginning and 136.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 435.33ms. Allocated memory was 209.7MB in the beginning and 333.4MB in the end (delta: 123.7MB). Free memory was 136.5MB in the beginning and 296.4MB in the end (delta: -159.9MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * TraceAbstraction took 59864.92ms. Allocated memory was 333.4MB in the beginning and 400.6MB in the end (delta: 67.1MB). Free memory was 295.9MB in the beginning and 167.4MB in the end (delta: 128.5MB). Peak memory consumption was 196.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 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L56] int x, y, z, w; [L57] x = __VERIFIER_nondet_int() [L58] y = __VERIFIER_nondet_int() [L59] z = __VERIFIER_nondet_int() [L60] w = __VERIFIER_nondet_int() [L61] CALL, EXPR solve(x, y, z, w) [L44] CALL, EXPR check_domain(s0) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=2, \result=1] [L44] RET, EXPR check_domain(s0) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] CALL, EXPR check_domain(s1) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=0, \result=1] [L44] RET, EXPR check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) && check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44] CALL, EXPR check_domain(s2) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=2, \result=1] [L44] RET, EXPR check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) && check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L45] CALL, EXPR check_domain(s3) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=0, \result=1] [L45] RET, EXPR check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] COND TRUE check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) [L46-L47] s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) VAL [s0=2, s1=0, s2=2, s3=0] [L46-L47] s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) [L47] CALL, EXPR check_sum(s0, s1, s2, s3) [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L34] int i = 0; VAL [i=0, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=0, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=0, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=0, j=1, s={5:0}, sum=1] [L36] j++ VAL [i=0, j=2, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=0, j=3, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=0, j=3, s={5:0}, sum=2] [L36] j++ VAL [i=0, j=4, s={5:0}, sum=2] [L36] COND FALSE !(j < 4) VAL [i=0, s={5:0}, sum=2] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=1, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=1, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=2, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=3, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=4, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=1, s={5:0}, sum=0] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=2, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=2, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=2, j=0, s={5:0}, sum=1] [L36] j++ VAL [i=2, j=1, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=2, j=2, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=2, j=2, s={5:0}, sum=2] [L36] j++ VAL [i=2, j=3, s={5:0}, sum=2] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=2, j=4, s={5:0}, sum=2] [L36] COND FALSE !(j < 4) VAL [i=2, s={5:0}, sum=2] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=3, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=3, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=2, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=3, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=4, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=3, s={5:0}, sum=0] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=4, s={5:0}] [L34] COND FALSE !(i < 4) VAL [s={5:0}] [L40] return 1; [L33] int s[4] = {s0, s1, s2, s3}; [L40] return 1; VAL [\result=1] [L47] RET, EXPR check_sum(s0, s1, s2, s3) [L46-L47] s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) [L46-L47] COND TRUE s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) [L48] return 1; VAL [\result=1] [L61] RET, EXPR solve(x, y, z, w) [L61] CALL __VERIFIER_assert(!solve(x, y, z, w)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.8s, OverallIterations: 20, TraceHistogramMax: 16, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.1s, AutomataDifference: 45.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 915 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 915 mSDsluCounter, 6589 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5779 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5853 IncrementalHoareTripleChecker+Invalid, 5882 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 810 mSDtfsCounter, 5853 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2582 GetRequests, 2237 SyntacticMatches, 0 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 42.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3083occurred in iteration=19, InterpolantAutomatonStates: 273, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 939 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1366 NumberOfCodeBlocks, 1366 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2478 ConstructedInterpolants, 0 QuantifiedInterpolants, 10062 SizeOfPredicates, 80 NumberOfNonLiveVariables, 2629 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 38 InterpolantComputations, 14 PerfectInterpolantSequences, 4040/6686 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-05 22:15:05,764 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...