./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:00:55,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:00:55,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:00:55,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:00:55,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:00:55,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:00:55,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:00:55,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:00:55,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:00:55,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:00:55,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:00:55,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:00:55,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:00:55,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:00:55,753 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:00:55,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:00:55,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:00:55,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:00:55,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:00:55,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:00:55,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:00:55,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:00:55,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:00:55,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:00:55,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:00:55,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:00:55,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:00:55,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:00:55,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:00:55,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:00:55,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:00:55,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:00:55,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:00:55,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:00:55,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:00:55,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:00:55,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:00:55,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:00:55,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:00:55,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:00:55,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:00:55,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:00:55,765 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2024-11-11 16:00:55,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:00:55,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:00:55,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:00:55,992 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:00:55,993 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:00:55,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-11 16:00:57,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:00:57,345 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:00:57,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-11 16:00:57,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf235e6f/e66a9277567f42e08fcc6c7395b32196/FLAGa91fe521f [2024-11-11 16:00:57,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaf235e6f/e66a9277567f42e08fcc6c7395b32196 [2024-11-11 16:00:57,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:00:57,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:00:57,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:00:57,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:00:57,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:00:57,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:00:57" (1/1) ... [2024-11-11 16:00:57,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f6d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:57, skipping insertion in model container [2024-11-11 16:00:57,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:00:57" (1/1) ... [2024-11-11 16:00:57,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:00:57,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c[755,768] [2024-11-11 16:00:57,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:00:57,988 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:00:58,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c[755,768] [2024-11-11 16:00:58,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:00:58,045 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:00:58,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58 WrapperNode [2024-11-11 16:00:58,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:00:58,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:00:58,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:00:58,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:00:58,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (1/1) ... [2024-11-11 16:00:58,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (1/1) ... [2024-11-11 16:00:58,091 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-11 16:00:58,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:00:58,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:00:58,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:00:58,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:00:58,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (1/1) ... [2024-11-11 16:00:58,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (1/1) ... [2024-11-11 16:00:58,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (1/1) ... [2024-11-11 16:00:58,125 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:00:58,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (1/1) ... [2024-11-11 16:00:58,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (1/1) ... [2024-11-11 16:00:58,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (1/1) ... [2024-11-11 16:00:58,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (1/1) ... [2024-11-11 16:00:58,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (1/1) ... [2024-11-11 16:00:58,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (1/1) ... [2024-11-11 16:00:58,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:00:58,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:00:58,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:00:58,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:00:58,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (1/1) ... [2024-11-11 16:00:58,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:00:58,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:58,171 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-11 16:00:58,174 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-11 16:00:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:00:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:00:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-11 16:00:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-11 16:00:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:00:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:00:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-11 16:00:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-11 16:00:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-11 16:00:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-11 16:00:58,263 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:00:58,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:00:58,509 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-11 16:00:58,509 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:00:58,522 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:00:58,522 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 16:00:58,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:00:58 BoogieIcfgContainer [2024-11-11 16:00:58,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:00:58,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:00:58,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:00:58,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:00:58,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:00:57" (1/3) ... [2024-11-11 16:00:58,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260803ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:00:58, skipping insertion in model container [2024-11-11 16:00:58,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:58" (2/3) ... [2024-11-11 16:00:58,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260803ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:00:58, skipping insertion in model container [2024-11-11 16:00:58,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:00:58" (3/3) ... [2024-11-11 16:00:58,533 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2024-11-11 16:00:58,546 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:00:58,546 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:00:58,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:00:58,599 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;@5f562272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:00:58,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:00:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 66 states have internal predecessors, (98), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-11 16:00:58,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 16:00:58,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:58,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-11 16:00:58,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:58,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash 548859888, now seen corresponding path program 1 times [2024-11-11 16:00:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:58,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427468930] [2024-11-11 16:00:58,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:59,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:00:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:59,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:00:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 16:00:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:00:59,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:59,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427468930] [2024-11-11 16:00:59,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427468930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:00:59,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064853047] [2024-11-11 16:00:59,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:59,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:59,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:59,153 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:00:59,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:00:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:59,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 16:00:59,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:00:59,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:00:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:00:59,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064853047] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:00:59,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:00:59,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-11 16:00:59,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156799006] [2024-11-11 16:00:59,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:00:59,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 16:00:59,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:59,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 16:00:59,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-11 16:00:59,443 INFO L87 Difference]: Start difference. First operand has 78 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 66 states have internal predecessors, (98), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 16:00:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:59,638 INFO L93 Difference]: Finished difference Result 176 states and 270 transitions. [2024-11-11 16:00:59,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 16:00:59,641 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2024-11-11 16:00:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:59,648 INFO L225 Difference]: With dead ends: 176 [2024-11-11 16:00:59,649 INFO L226 Difference]: Without dead ends: 95 [2024-11-11 16:00:59,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-11 16:00:59,655 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 25 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:59,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1268 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-11 16:00:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2024-11-11 16:00:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 73 states have internal predecessors, (97), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2024-11-11 16:00:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 120 transitions. [2024-11-11 16:00:59,686 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 120 transitions. Word has length 35 [2024-11-11 16:00:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:59,687 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 120 transitions. [2024-11-11 16:00:59,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 16:00:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 120 transitions. [2024-11-11 16:00:59,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 16:00:59,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:59,689 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:59,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:00:59,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-11 16:00:59,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:59,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1587358369, now seen corresponding path program 1 times [2024-11-11 16:00:59,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:59,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4038253] [2024-11-11 16:00:59,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:01:00,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:00,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4038253] [2024-11-11 16:01:00,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4038253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:00,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:00,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 16:01:00,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851733310] [2024-11-11 16:01:00,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:00,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 16:01:00,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:00,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 16:01:00,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:01:00,052 INFO L87 Difference]: Start difference. First operand 87 states and 120 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:00,114 INFO L93 Difference]: Finished difference Result 159 states and 214 transitions. [2024-11-11 16:01:00,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 16:01:00,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-11 16:01:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:00,117 INFO L225 Difference]: With dead ends: 159 [2024-11-11 16:01:00,117 INFO L226 Difference]: Without dead ends: 110 [2024-11-11 16:01:00,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:01:00,118 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 13 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:00,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 663 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-11 16:01:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-11-11 16:01:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 79 states have internal predecessors, (103), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-11 16:01:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2024-11-11 16:01:00,134 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 39 [2024-11-11 16:01:00,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:00,135 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2024-11-11 16:01:00,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2024-11-11 16:01:00,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 16:01:00,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:00,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-11 16:01:00,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:01:00,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:00,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:00,137 INFO L85 PathProgramCache]: Analyzing trace with hash -831428749, now seen corresponding path program 1 times [2024-11-11 16:01:00,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:00,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794904118] [2024-11-11 16:01:00,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 16:01:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 16:01:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:01:00,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:00,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794904118] [2024-11-11 16:01:00,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794904118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:00,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:00,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 16:01:00,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192738530] [2024-11-11 16:01:00,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:00,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 16:01:00,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:00,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 16:01:00,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:01:00,286 INFO L87 Difference]: Start difference. First operand 95 states and 128 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 16:01:00,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:00,358 INFO L93 Difference]: Finished difference Result 178 states and 241 transitions. [2024-11-11 16:01:00,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 16:01:00,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-11-11 16:01:00,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:00,360 INFO L225 Difference]: With dead ends: 178 [2024-11-11 16:01:00,360 INFO L226 Difference]: Without dead ends: 138 [2024-11-11 16:01:00,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:01:00,361 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 85 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:00,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 781 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-11 16:01:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2024-11-11 16:01:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 110 states have internal predecessors, (146), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-11 16:01:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2024-11-11 16:01:00,380 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 43 [2024-11-11 16:01:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:00,381 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2024-11-11 16:01:00,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 16:01:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2024-11-11 16:01:00,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 16:01:00,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:00,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-11 16:01:00,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:01:00,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:00,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:00,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1224455759, now seen corresponding path program 1 times [2024-11-11 16:01:00,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:00,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184244453] [2024-11-11 16:01:00,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:00,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 16:01:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 16:01:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:01:00,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:00,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184244453] [2024-11-11 16:01:00,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184244453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:00,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105690523] [2024-11-11 16:01:00,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:00,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:00,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:00,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:01:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:00,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-11 16:01:00,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:01:00,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:01:00,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105690523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:00,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:01:00,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-11 16:01:00,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968749003] [2024-11-11 16:01:00,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:00,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 16:01:00,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:00,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 16:01:00,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-11 16:01:00,705 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 16:01:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:00,784 INFO L93 Difference]: Finished difference Result 224 states and 304 transitions. [2024-11-11 16:01:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 16:01:00,785 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2024-11-11 16:01:00,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:00,787 INFO L225 Difference]: With dead ends: 224 [2024-11-11 16:01:00,787 INFO L226 Difference]: Without dead ends: 153 [2024-11-11 16:01:00,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-11 16:01:00,791 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 17 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:00,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 982 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-11 16:01:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2024-11-11 16:01:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 117 states have internal predecessors, (153), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2024-11-11 16:01:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 188 transitions. [2024-11-11 16:01:00,804 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 188 transitions. Word has length 43 [2024-11-11 16:01:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:00,805 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 188 transitions. [2024-11-11 16:01:00,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 16:01:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 188 transitions. [2024-11-11 16:01:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 16:01:00,807 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:00,807 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:00,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 16:01:01,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-11 16:01:01,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:01,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash 651525582, now seen corresponding path program 1 times [2024-11-11 16:01:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:01,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956617081] [2024-11-11 16:01:01,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:01,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:01,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:01,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 16:01:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 16:01:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:01,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 16:01:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 16:01:01,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:01,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956617081] [2024-11-11 16:01:01,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956617081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:01,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:01,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-11 16:01:01,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340926154] [2024-11-11 16:01:01,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:01,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 16:01:01,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:01,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 16:01:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-11 16:01:01,310 INFO L87 Difference]: Start difference. First operand 140 states and 188 transitions. Second operand has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-11 16:01:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:01,498 INFO L93 Difference]: Finished difference Result 203 states and 270 transitions. [2024-11-11 16:01:01,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 16:01:01,498 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2024-11-11 16:01:01,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:01,500 INFO L225 Difference]: With dead ends: 203 [2024-11-11 16:01:01,502 INFO L226 Difference]: Without dead ends: 195 [2024-11-11 16:01:01,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-11 16:01:01,504 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 52 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:01,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1479 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-11 16:01:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2024-11-11 16:01:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.319327731092437) internal successors, (157), 120 states have internal predecessors, (157), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (20), 17 states have call predecessors, (20), 16 states have call successors, (20) [2024-11-11 16:01:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 194 transitions. [2024-11-11 16:01:01,521 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 194 transitions. Word has length 44 [2024-11-11 16:01:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:01,521 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 194 transitions. [2024-11-11 16:01:01,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-11 16:01:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 194 transitions. [2024-11-11 16:01:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 16:01:01,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:01,522 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 16:01:01,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:01:01,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:01,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash 35658448, now seen corresponding path program 2 times [2024-11-11 16:01:01,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:01,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728608620] [2024-11-11 16:01:01,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:01,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:01,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:01,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 16:01:01,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:01,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728608620] [2024-11-11 16:01:01,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728608620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:01,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405642380] [2024-11-11 16:01:01,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 16:01:01,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:01,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:01,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:01,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 16:01:01,688 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 16:01:01,688 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:01:01,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 16:01:01,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 16:01:01,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:01,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405642380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:01,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:01:01,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2024-11-11 16:01:01,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984084053] [2024-11-11 16:01:01,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:01,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 16:01:01,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:01,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 16:01:01,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-11 16:01:01,813 INFO L87 Difference]: Start difference. First operand 145 states and 194 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:01,989 INFO L93 Difference]: Finished difference Result 286 states and 386 transitions. [2024-11-11 16:01:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 16:01:01,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-11 16:01:01,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:01,991 INFO L225 Difference]: With dead ends: 286 [2024-11-11 16:01:01,991 INFO L226 Difference]: Without dead ends: 229 [2024-11-11 16:01:01,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-11 16:01:01,993 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 113 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:01,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1294 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:01,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-11 16:01:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 192. [2024-11-11 16:01:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 159 states have (on average 1.3144654088050314) internal successors, (209), 161 states have internal predecessors, (209), 21 states have call successors, (21), 9 states have call predecessors, (21), 11 states have return successors, (28), 21 states have call predecessors, (28), 20 states have call successors, (28) [2024-11-11 16:01:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 258 transitions. [2024-11-11 16:01:02,005 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 258 transitions. Word has length 43 [2024-11-11 16:01:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:02,005 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 258 transitions. [2024-11-11 16:01:02,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 258 transitions. [2024-11-11 16:01:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 16:01:02,006 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:02,006 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 16:01:02,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 16:01:02,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:02,211 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:02,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash -357368562, now seen corresponding path program 1 times [2024-11-11 16:01:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:02,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918067155] [2024-11-11 16:01:02,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:02,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:02,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 16:01:02,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:02,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918067155] [2024-11-11 16:01:02,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918067155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:02,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584579311] [2024-11-11 16:01:02,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:02,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:02,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:02,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:02,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 16:01:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:02,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-11 16:01:02,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 16:01:02,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:02,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584579311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:02,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:01:02,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 17 [2024-11-11 16:01:02,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663657675] [2024-11-11 16:01:02,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:02,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 16:01:02,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:02,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 16:01:02,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-11 16:01:02,570 INFO L87 Difference]: Start difference. First operand 192 states and 258 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 16:01:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:02,736 INFO L93 Difference]: Finished difference Result 359 states and 491 transitions. [2024-11-11 16:01:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 16:01:02,736 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-11 16:01:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:02,738 INFO L225 Difference]: With dead ends: 359 [2024-11-11 16:01:02,738 INFO L226 Difference]: Without dead ends: 284 [2024-11-11 16:01:02,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-11 16:01:02,739 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 68 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:02,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1576 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-11 16:01:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 266. [2024-11-11 16:01:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 223 states have (on average 1.3139013452914798) internal successors, (293), 225 states have internal predecessors, (293), 28 states have call successors, (28), 12 states have call predecessors, (28), 14 states have return successors, (37), 28 states have call predecessors, (37), 27 states have call successors, (37) [2024-11-11 16:01:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 358 transitions. [2024-11-11 16:01:02,756 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 358 transitions. Word has length 43 [2024-11-11 16:01:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:02,758 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 358 transitions. [2024-11-11 16:01:02,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 16:01:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 358 transitions. [2024-11-11 16:01:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 16:01:02,759 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:02,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:02,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 16:01:02,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:02,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:02,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1300765906, now seen corresponding path program 1 times [2024-11-11 16:01:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:02,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869559884] [2024-11-11 16:01:02,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:02,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 16:01:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 16:01:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 16:01:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 16:01:03,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:03,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869559884] [2024-11-11 16:01:03,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869559884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:03,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:03,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 16:01:03,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578050100] [2024-11-11 16:01:03,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:03,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 16:01:03,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:03,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 16:01:03,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:01:03,031 INFO L87 Difference]: Start difference. First operand 266 states and 358 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 16:01:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:03,054 INFO L93 Difference]: Finished difference Result 274 states and 365 transitions. [2024-11-11 16:01:03,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 16:01:03,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2024-11-11 16:01:03,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:03,056 INFO L225 Difference]: With dead ends: 274 [2024-11-11 16:01:03,056 INFO L226 Difference]: Without dead ends: 259 [2024-11-11 16:01:03,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:01:03,056 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 3 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:03,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 487 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-11 16:01:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-11-11 16:01:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 218 states have (on average 1.31651376146789) internal successors, (287), 221 states have internal predecessors, (287), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (34), 25 states have call predecessors, (34), 25 states have call successors, (34) [2024-11-11 16:01:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 347 transitions. [2024-11-11 16:01:03,066 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 347 transitions. Word has length 46 [2024-11-11 16:01:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:03,066 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 347 transitions. [2024-11-11 16:01:03,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 16:01:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 347 transitions. [2024-11-11 16:01:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 16:01:03,067 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:03,068 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:03,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:01:03,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:03,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1312921885, now seen corresponding path program 1 times [2024-11-11 16:01:03,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:03,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278806427] [2024-11-11 16:01:03,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:03,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 16:01:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:01:03,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:03,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278806427] [2024-11-11 16:01:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278806427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:03,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131363765] [2024-11-11 16:01:03,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:03,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:03,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:03,099 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:03,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 16:01:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:01:03,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 16:01:03,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:03,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131363765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:03,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:01:03,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-11 16:01:03,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126468707] [2024-11-11 16:01:03,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:03,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:01:03,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:03,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:01:03,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:01:03,159 INFO L87 Difference]: Start difference. First operand 259 states and 347 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 16:01:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:03,188 INFO L93 Difference]: Finished difference Result 520 states and 701 transitions. [2024-11-11 16:01:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:01:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-11 16:01:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:03,189 INFO L225 Difference]: With dead ends: 520 [2024-11-11 16:01:03,189 INFO L226 Difference]: Without dead ends: 264 [2024-11-11 16:01:03,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 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-11 16:01:03,192 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 6 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:03,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 179 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-11 16:01:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2024-11-11 16:01:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 221 states have (on average 1.3167420814479638) internal successors, (291), 224 states have internal predecessors, (291), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (34), 25 states have call predecessors, (34), 25 states have call successors, (34) [2024-11-11 16:01:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 351 transitions. [2024-11-11 16:01:03,203 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 351 transitions. Word has length 46 [2024-11-11 16:01:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:03,203 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 351 transitions. [2024-11-11 16:01:03,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 16:01:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 351 transitions. [2024-11-11 16:01:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 16:01:03,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:03,204 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:03,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 16:01:03,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:03,405 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:03,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:03,406 INFO L85 PathProgramCache]: Analyzing trace with hash -576237536, now seen corresponding path program 1 times [2024-11-11 16:01:03,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:03,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143244720] [2024-11-11 16:01:03,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:03,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 16:01:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:01:03,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:03,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143244720] [2024-11-11 16:01:03,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143244720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:03,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:03,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 16:01:03,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759728063] [2024-11-11 16:01:03,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:03,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 16:01:03,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:03,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 16:01:03,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:01:03,527 INFO L87 Difference]: Start difference. First operand 262 states and 351 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 16:01:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:03,578 INFO L93 Difference]: Finished difference Result 281 states and 371 transitions. [2024-11-11 16:01:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 16:01:03,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2024-11-11 16:01:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:03,580 INFO L225 Difference]: With dead ends: 281 [2024-11-11 16:01:03,580 INFO L226 Difference]: Without dead ends: 241 [2024-11-11 16:01:03,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:01:03,581 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 11 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 766 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.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:03,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 766 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-11 16:01:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2024-11-11 16:01:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 196 states have (on average 1.3010204081632653) internal successors, (255), 199 states have internal predecessors, (255), 24 states have call successors, (24), 12 states have call predecessors, (24), 14 states have return successors, (32), 23 states have call predecessors, (32), 23 states have call successors, (32) [2024-11-11 16:01:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 311 transitions. [2024-11-11 16:01:03,588 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 311 transitions. Word has length 47 [2024-11-11 16:01:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:03,589 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 311 transitions. [2024-11-11 16:01:03,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 16:01:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 311 transitions. [2024-11-11 16:01:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 16:01:03,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:03,590 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2024-11-11 16:01:03,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:01:03,590 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:03,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2068784251, now seen corresponding path program 1 times [2024-11-11 16:01:03,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:03,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368379727] [2024-11-11 16:01:03,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:03,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 16:01:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 16:01:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 16:01:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:03,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:03,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368379727] [2024-11-11 16:01:03,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368379727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:03,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105904694] [2024-11-11 16:01:03,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:03,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:03,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:03,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:03,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 16:01:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:03,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-11 16:01:03,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 16:01:03,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:04,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105904694] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:04,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:01:04,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-11 16:01:04,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579740728] [2024-11-11 16:01:04,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:04,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-11 16:01:04,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:04,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-11 16:01:04,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-11 16:01:04,246 INFO L87 Difference]: Start difference. First operand 235 states and 311 transitions. Second operand has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-11 16:01:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:05,521 INFO L93 Difference]: Finished difference Result 456 states and 636 transitions. [2024-11-11 16:01:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-11 16:01:05,522 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2024-11-11 16:01:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:05,524 INFO L225 Difference]: With dead ends: 456 [2024-11-11 16:01:05,524 INFO L226 Difference]: Without dead ends: 431 [2024-11-11 16:01:05,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2024-11-11 16:01:05,527 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 241 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 4380 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:05,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 4380 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:01:05,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-11 16:01:05,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 286. [2024-11-11 16:01:05,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 245 states have internal predecessors, (304), 29 states have call successors, (29), 11 states have call predecessors, (29), 19 states have return successors, (49), 29 states have call predecessors, (49), 28 states have call successors, (49) [2024-11-11 16:01:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 382 transitions. [2024-11-11 16:01:05,552 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 382 transitions. Word has length 48 [2024-11-11 16:01:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:05,553 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 382 transitions. [2024-11-11 16:01:05,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-11 16:01:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 382 transitions. [2024-11-11 16:01:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 16:01:05,554 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:05,554 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:05,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 16:01:05,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:05,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:05,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2092939753, now seen corresponding path program 1 times [2024-11-11 16:01:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:05,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733136730] [2024-11-11 16:01:05,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:05,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:05,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:05,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 16:01:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 16:01:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733136730] [2024-11-11 16:01:05,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733136730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213484661] [2024-11-11 16:01:05,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:05,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:05,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:05,793 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:05,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 16:01:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:05,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:01:05,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 16:01:05,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:05,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213484661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:05,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:01:05,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-11 16:01:05,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078036877] [2024-11-11 16:01:05,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:05,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:01:05,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:05,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:01:05,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:01:05,844 INFO L87 Difference]: Start difference. First operand 286 states and 382 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 16:01:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:05,873 INFO L93 Difference]: Finished difference Result 575 states and 773 transitions. [2024-11-11 16:01:05,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:01:05,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-11-11 16:01:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:05,875 INFO L225 Difference]: With dead ends: 575 [2024-11-11 16:01:05,875 INFO L226 Difference]: Without dead ends: 292 [2024-11-11 16:01:05,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:01:05,876 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 5 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:05,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 182 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-11 16:01:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2024-11-11 16:01:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 239 states have (on average 1.2803347280334727) internal successors, (306), 247 states have internal predecessors, (306), 29 states have call successors, (29), 11 states have call predecessors, (29), 19 states have return successors, (49), 29 states have call predecessors, (49), 28 states have call successors, (49) [2024-11-11 16:01:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2024-11-11 16:01:05,887 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 47 [2024-11-11 16:01:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:05,888 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2024-11-11 16:01:05,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 16:01:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2024-11-11 16:01:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 16:01:05,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:05,888 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2024-11-11 16:01:05,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 16:01:06,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:06,090 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:06,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:06,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1429610563, now seen corresponding path program 2 times [2024-11-11 16:01:06,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:06,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848874192] [2024-11-11 16:01:06,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:06,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:06,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:06,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 16:01:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:06,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 16:01:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:06,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:06,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848874192] [2024-11-11 16:01:06,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848874192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:06,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684277887] [2024-11-11 16:01:06,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 16:01:06,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:06,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:06,237 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:06,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 16:01:06,279 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 16:01:06,279 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:01:06,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-11 16:01:06,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 16:01:06,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:06,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684277887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:06,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:01:06,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-11 16:01:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452661974] [2024-11-11 16:01:06,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:06,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-11 16:01:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:06,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-11 16:01:06,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-11 16:01:06,736 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand has 32 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 25 states have internal predecessors, (51), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-11 16:01:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:07,795 INFO L93 Difference]: Finished difference Result 472 states and 674 transitions. [2024-11-11 16:01:07,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-11 16:01:07,795 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 25 states have internal predecessors, (51), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 48 [2024-11-11 16:01:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:07,797 INFO L225 Difference]: With dead ends: 472 [2024-11-11 16:01:07,798 INFO L226 Difference]: Without dead ends: 459 [2024-11-11 16:01:07,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=295, Invalid=3245, Unknown=0, NotChecked=0, Total=3540 [2024-11-11 16:01:07,799 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 278 mSDsluCounter, 3492 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 3697 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:07,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 3697 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:01:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-11 16:01:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 301. [2024-11-11 16:01:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 247 states have (on average 1.271255060728745) internal successors, (314), 255 states have internal predecessors, (314), 33 states have call successors, (33), 12 states have call predecessors, (33), 20 states have return successors, (63), 33 states have call predecessors, (63), 32 states have call successors, (63) [2024-11-11 16:01:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 410 transitions. [2024-11-11 16:01:07,818 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 410 transitions. Word has length 48 [2024-11-11 16:01:07,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:07,818 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 410 transitions. [2024-11-11 16:01:07,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 25 states have internal predecessors, (51), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-11 16:01:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 410 transitions. [2024-11-11 16:01:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 16:01:07,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:07,819 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:07,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-11 16:01:08,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-11 16:01:08,024 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:08,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 548709926, now seen corresponding path program 1 times [2024-11-11 16:01:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:08,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600479070] [2024-11-11 16:01:08,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:08,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:08,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:08,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:08,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 16:01:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 16:01:08,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:08,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600479070] [2024-11-11 16:01:08,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600479070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:08,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:08,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 16:01:08,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744561930] [2024-11-11 16:01:08,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:08,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 16:01:08,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:08,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 16:01:08,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:01:08,188 INFO L87 Difference]: Start difference. First operand 301 states and 410 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:08,266 INFO L93 Difference]: Finished difference Result 476 states and 650 transitions. [2024-11-11 16:01:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 16:01:08,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-11 16:01:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:08,268 INFO L225 Difference]: With dead ends: 476 [2024-11-11 16:01:08,268 INFO L226 Difference]: Without dead ends: 312 [2024-11-11 16:01:08,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:01:08,269 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 60 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:08,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 878 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-11 16:01:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 301. [2024-11-11 16:01:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 247 states have (on average 1.263157894736842) internal successors, (312), 255 states have internal predecessors, (312), 33 states have call successors, (33), 12 states have call predecessors, (33), 20 states have return successors, (63), 33 states have call predecessors, (63), 32 states have call successors, (63) [2024-11-11 16:01:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 408 transitions. [2024-11-11 16:01:08,283 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 408 transitions. Word has length 48 [2024-11-11 16:01:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:08,283 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 408 transitions. [2024-11-11 16:01:08,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 408 transitions. [2024-11-11 16:01:08,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 16:01:08,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:08,284 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:08,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:01:08,284 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:08,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:08,285 INFO L85 PathProgramCache]: Analyzing trace with hash 317586600, now seen corresponding path program 1 times [2024-11-11 16:01:08,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:08,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112055681] [2024-11-11 16:01:08,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:08,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:08,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:08,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 16:01:08,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:08,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112055681] [2024-11-11 16:01:08,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112055681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:08,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013368032] [2024-11-11 16:01:08,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:08,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:08,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:08,387 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:08,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 16:01:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:08,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 16:01:08,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 16:01:08,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 16:01:08,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013368032] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:08,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:01:08,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2024-11-11 16:01:08,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521460768] [2024-11-11 16:01:08,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:08,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 16:01:08,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:08,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 16:01:08,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-11 16:01:08,570 INFO L87 Difference]: Start difference. First operand 301 states and 408 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 16:01:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:08,713 INFO L93 Difference]: Finished difference Result 439 states and 591 transitions. [2024-11-11 16:01:08,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 16:01:08,713 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2024-11-11 16:01:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:08,715 INFO L225 Difference]: With dead ends: 439 [2024-11-11 16:01:08,715 INFO L226 Difference]: Without dead ends: 365 [2024-11-11 16:01:08,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-11 16:01:08,716 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 96 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:08,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1288 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-11 16:01:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 345. [2024-11-11 16:01:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 285 states have (on average 1.2666666666666666) internal successors, (361), 295 states have internal predecessors, (361), 35 states have call successors, (35), 14 states have call predecessors, (35), 24 states have return successors, (64), 35 states have call predecessors, (64), 34 states have call successors, (64) [2024-11-11 16:01:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 460 transitions. [2024-11-11 16:01:08,728 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 460 transitions. Word has length 48 [2024-11-11 16:01:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:08,729 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 460 transitions. [2024-11-11 16:01:08,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 16:01:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 460 transitions. [2024-11-11 16:01:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 16:01:08,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:08,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:08,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-11 16:01:08,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 16:01:08,934 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:08,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:08,934 INFO L85 PathProgramCache]: Analyzing trace with hash -75440410, now seen corresponding path program 2 times [2024-11-11 16:01:08,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:08,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149795967] [2024-11-11 16:01:08,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:08,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:09,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:09,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:09,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 16:01:09,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:09,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149795967] [2024-11-11 16:01:09,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149795967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:09,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92191944] [2024-11-11 16:01:09,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 16:01:09,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:09,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:09,075 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:09,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-11 16:01:09,121 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 16:01:09,122 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:01:09,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 16:01:09,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 16:01:09,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:09,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92191944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:09,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:01:09,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 21 [2024-11-11 16:01:09,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242781433] [2024-11-11 16:01:09,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:09,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 16:01:09,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:09,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 16:01:09,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2024-11-11 16:01:09,801 INFO L87 Difference]: Start difference. First operand 345 states and 460 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:10,184 INFO L93 Difference]: Finished difference Result 480 states and 649 transitions. [2024-11-11 16:01:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 16:01:10,184 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-11 16:01:10,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:10,186 INFO L225 Difference]: With dead ends: 480 [2024-11-11 16:01:10,186 INFO L226 Difference]: Without dead ends: 478 [2024-11-11 16:01:10,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-11-11 16:01:10,187 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 74 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:10,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1463 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 16:01:10,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-11 16:01:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 440. [2024-11-11 16:01:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 366 states have (on average 1.278688524590164) internal successors, (468), 381 states have internal predecessors, (468), 42 states have call successors, (42), 17 states have call predecessors, (42), 31 states have return successors, (79), 41 states have call predecessors, (79), 41 states have call successors, (79) [2024-11-11 16:01:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 589 transitions. [2024-11-11 16:01:10,212 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 589 transitions. Word has length 48 [2024-11-11 16:01:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:10,212 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 589 transitions. [2024-11-11 16:01:10,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2024-11-11 16:01:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 16:01:10,215 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:10,216 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2024-11-11 16:01:10,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-11 16:01:10,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 16:01:10,417 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:10,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2139626181, now seen corresponding path program 1 times [2024-11-11 16:01:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:10,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798673386] [2024-11-11 16:01:10,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:10,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:10,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:10,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:10,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:10,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 16:01:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:10,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 16:01:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 16:01:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:10,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798673386] [2024-11-11 16:01:10,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798673386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:10,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167034861] [2024-11-11 16:01:10,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:10,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:10,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:10,517 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:10,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-11 16:01:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:10,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-11 16:01:10,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 16:01:10,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:10,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167034861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:10,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:01:10,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 21 [2024-11-11 16:01:10,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513741822] [2024-11-11 16:01:10,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:10,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 16:01:10,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:10,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 16:01:10,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-11 16:01:10,843 INFO L87 Difference]: Start difference. First operand 440 states and 589 transitions. Second operand has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 16:01:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:11,210 INFO L93 Difference]: Finished difference Result 570 states and 790 transitions. [2024-11-11 16:01:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 16:01:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 50 [2024-11-11 16:01:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:11,212 INFO L225 Difference]: With dead ends: 570 [2024-11-11 16:01:11,212 INFO L226 Difference]: Without dead ends: 532 [2024-11-11 16:01:11,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2024-11-11 16:01:11,213 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 208 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:11,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1390 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 16:01:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-11 16:01:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 445. [2024-11-11 16:01:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 369 states have (on average 1.2764227642276422) internal successors, (471), 386 states have internal predecessors, (471), 43 states have call successors, (43), 15 states have call predecessors, (43), 32 states have return successors, (93), 43 states have call predecessors, (93), 42 states have call successors, (93) [2024-11-11 16:01:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 607 transitions. [2024-11-11 16:01:11,236 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 607 transitions. Word has length 50 [2024-11-11 16:01:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:11,236 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 607 transitions. [2024-11-11 16:01:11,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 16:01:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 607 transitions. [2024-11-11 16:01:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-11 16:01:11,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:11,237 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:11,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-11 16:01:11,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 16:01:11,438 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:11,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:11,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1494153441, now seen corresponding path program 1 times [2024-11-11 16:01:11,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:11,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223477716] [2024-11-11 16:01:11,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:11,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:11,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:11,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 16:01:11,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:11,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223477716] [2024-11-11 16:01:11,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223477716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:11,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:11,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 16:01:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837476151] [2024-11-11 16:01:11,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:11,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 16:01:11,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:11,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 16:01:11,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:01:11,578 INFO L87 Difference]: Start difference. First operand 445 states and 607 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:11,638 INFO L93 Difference]: Finished difference Result 451 states and 612 transitions. [2024-11-11 16:01:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 16:01:11,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-11 16:01:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:11,640 INFO L225 Difference]: With dead ends: 451 [2024-11-11 16:01:11,640 INFO L226 Difference]: Without dead ends: 449 [2024-11-11 16:01:11,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:01:11,640 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 526 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.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:11,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 526 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-11 16:01:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2024-11-11 16:01:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 372 states have (on average 1.2741935483870968) internal successors, (474), 389 states have internal predecessors, (474), 43 states have call successors, (43), 16 states have call predecessors, (43), 33 states have return successors, (93), 43 states have call predecessors, (93), 42 states have call successors, (93) [2024-11-11 16:01:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 610 transitions. [2024-11-11 16:01:11,680 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 610 transitions. Word has length 49 [2024-11-11 16:01:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:11,680 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 610 transitions. [2024-11-11 16:01:11,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 610 transitions. [2024-11-11 16:01:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 16:01:11,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:11,681 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:11,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 16:01:11,681 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:11,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:11,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1700071189, now seen corresponding path program 1 times [2024-11-11 16:01:11,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:11,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862798786] [2024-11-11 16:01:11,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:11,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:11,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 16:01:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:11,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 16:01:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:11,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 16:01:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:11,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:11,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862798786] [2024-11-11 16:01:11,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862798786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:11,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828241929] [2024-11-11 16:01:11,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:11,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:11,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:11,845 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:11,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-11 16:01:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:11,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-11 16:01:11,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:11,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:12,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828241929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:12,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:01:12,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-11 16:01:12,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351442740] [2024-11-11 16:01:12,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:12,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 16:01:12,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:12,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 16:01:12,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2024-11-11 16:01:12,171 INFO L87 Difference]: Start difference. First operand 449 states and 610 transitions. Second operand has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 16:01:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:12,634 INFO L93 Difference]: Finished difference Result 535 states and 743 transitions. [2024-11-11 16:01:12,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 16:01:12,634 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2024-11-11 16:01:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:12,636 INFO L225 Difference]: With dead ends: 535 [2024-11-11 16:01:12,636 INFO L226 Difference]: Without dead ends: 503 [2024-11-11 16:01:12,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-11-11 16:01:12,637 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 207 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:12,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 2021 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:01:12,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-11 16:01:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 438. [2024-11-11 16:01:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 364 states have (on average 1.2802197802197801) internal successors, (466), 381 states have internal predecessors, (466), 41 states have call successors, (41), 14 states have call predecessors, (41), 32 states have return successors, (89), 42 states have call predecessors, (89), 40 states have call successors, (89) [2024-11-11 16:01:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 596 transitions. [2024-11-11 16:01:12,657 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 596 transitions. Word has length 55 [2024-11-11 16:01:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:12,657 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 596 transitions. [2024-11-11 16:01:12,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 16:01:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 596 transitions. [2024-11-11 16:01:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 16:01:12,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:12,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:12,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-11 16:01:12,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:12,859 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:12,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:12,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1025276331, now seen corresponding path program 2 times [2024-11-11 16:01:12,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:12,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049140304] [2024-11-11 16:01:12,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:12,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:12,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:12,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 16:01:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:12,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 16:01:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:12,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 16:01:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:13,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:13,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049140304] [2024-11-11 16:01:13,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049140304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:13,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084151783] [2024-11-11 16:01:13,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 16:01:13,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:13,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:13,015 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:13,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-11 16:01:13,069 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 16:01:13,069 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:01:13,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-11 16:01:13,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:13,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:13,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084151783] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:13,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:01:13,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2024-11-11 16:01:13,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545543823] [2024-11-11 16:01:13,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:13,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-11 16:01:13,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:13,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-11 16:01:13,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2024-11-11 16:01:13,515 INFO L87 Difference]: Start difference. First operand 438 states and 596 transitions. Second operand has 29 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 24 states have internal predecessors, (58), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 16:01:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:13,959 INFO L93 Difference]: Finished difference Result 523 states and 731 transitions. [2024-11-11 16:01:13,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 16:01:13,960 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 24 states have internal predecessors, (58), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) Word has length 55 [2024-11-11 16:01:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:13,962 INFO L225 Difference]: With dead ends: 523 [2024-11-11 16:01:13,962 INFO L226 Difference]: Without dead ends: 493 [2024-11-11 16:01:13,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2024-11-11 16:01:13,963 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 128 mSDsluCounter, 2559 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:13,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2687 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:01:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-11 16:01:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 430. [2024-11-11 16:01:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 357 states have (on average 1.2857142857142858) internal successors, (459), 376 states have internal predecessors, (459), 40 states have call successors, (40), 12 states have call predecessors, (40), 32 states have return successors, (88), 41 states have call predecessors, (88), 39 states have call successors, (88) [2024-11-11 16:01:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 587 transitions. [2024-11-11 16:01:13,984 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 587 transitions. Word has length 55 [2024-11-11 16:01:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:13,984 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 587 transitions. [2024-11-11 16:01:13,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 24 states have internal predecessors, (58), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 16:01:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 587 transitions. [2024-11-11 16:01:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 16:01:13,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:13,986 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:14,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-11 16:01:14,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-11 16:01:14,191 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:14,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:14,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1682588005, now seen corresponding path program 1 times [2024-11-11 16:01:14,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:14,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469866331] [2024-11-11 16:01:14,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:14,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 16:01:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 16:01:14,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:14,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469866331] [2024-11-11 16:01:14,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469866331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:14,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:14,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 16:01:14,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785313710] [2024-11-11 16:01:14,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:14,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 16:01:14,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:14,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 16:01:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:01:14,255 INFO L87 Difference]: Start difference. First operand 430 states and 587 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 16:01:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:14,311 INFO L93 Difference]: Finished difference Result 485 states and 670 transitions. [2024-11-11 16:01:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 16:01:14,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2024-11-11 16:01:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:14,313 INFO L225 Difference]: With dead ends: 485 [2024-11-11 16:01:14,314 INFO L226 Difference]: Without dead ends: 483 [2024-11-11 16:01:14,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:01:14,314 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 11 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:14,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 364 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-11 16:01:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 455. [2024-11-11 16:01:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 374 states have (on average 1.3101604278074865) internal successors, (490), 400 states have internal predecessors, (490), 47 states have call successors, (47), 13 states have call predecessors, (47), 33 states have return successors, (95), 41 states have call predecessors, (95), 46 states have call successors, (95) [2024-11-11 16:01:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 632 transitions. [2024-11-11 16:01:14,338 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 632 transitions. Word has length 57 [2024-11-11 16:01:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:14,339 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 632 transitions. [2024-11-11 16:01:14,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 16:01:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 632 transitions. [2024-11-11 16:01:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 16:01:14,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:14,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:14,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 16:01:14,341 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:14,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash 712762254, now seen corresponding path program 1 times [2024-11-11 16:01:14,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:14,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154882217] [2024-11-11 16:01:14,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:14,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 16:01:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 16:01:14,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:14,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154882217] [2024-11-11 16:01:14,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154882217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:14,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508947205] [2024-11-11 16:01:14,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:14,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:14,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:14,458 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:14,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-11 16:01:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 16:01:14,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 16:01:14,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:14,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508947205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:14,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:01:14,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-11-11 16:01:14,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711142790] [2024-11-11 16:01:14,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:14,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 16:01:14,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:14,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 16:01:14,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-11 16:01:14,550 INFO L87 Difference]: Start difference. First operand 455 states and 632 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 16:01:14,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:14,630 INFO L93 Difference]: Finished difference Result 809 states and 1123 transitions. [2024-11-11 16:01:14,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 16:01:14,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2024-11-11 16:01:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:14,634 INFO L225 Difference]: With dead ends: 809 [2024-11-11 16:01:14,636 INFO L226 Difference]: Without dead ends: 632 [2024-11-11 16:01:14,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-11 16:01:14,637 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 17 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:14,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 456 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-11 16:01:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 462. [2024-11-11 16:01:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 381 states have (on average 1.304461942257218) internal successors, (497), 407 states have internal predecessors, (497), 47 states have call successors, (47), 13 states have call predecessors, (47), 33 states have return successors, (95), 41 states have call predecessors, (95), 46 states have call successors, (95) [2024-11-11 16:01:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 639 transitions. [2024-11-11 16:01:14,663 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 639 transitions. Word has length 58 [2024-11-11 16:01:14,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:14,663 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 639 transitions. [2024-11-11 16:01:14,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 16:01:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 639 transitions. [2024-11-11 16:01:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 16:01:14,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:14,664 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:14,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-11 16:01:14,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:14,865 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash 377725904, now seen corresponding path program 1 times [2024-11-11 16:01:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601667700] [2024-11-11 16:01:14,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:14,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 16:01:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 16:01:14,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601667700] [2024-11-11 16:01:14,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601667700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:14,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:14,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 16:01:14,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814979593] [2024-11-11 16:01:14,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:14,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 16:01:14,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:14,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 16:01:14,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:01:14,973 INFO L87 Difference]: Start difference. First operand 462 states and 639 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 16:01:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:15,058 INFO L93 Difference]: Finished difference Result 510 states and 708 transitions. [2024-11-11 16:01:15,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 16:01:15,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 59 [2024-11-11 16:01:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:15,061 INFO L225 Difference]: With dead ends: 510 [2024-11-11 16:01:15,061 INFO L226 Difference]: Without dead ends: 508 [2024-11-11 16:01:15,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:01:15,062 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 10 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:15,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 473 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-11 16:01:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 462. [2024-11-11 16:01:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 381 states have (on average 1.304461942257218) internal successors, (497), 407 states have internal predecessors, (497), 47 states have call successors, (47), 13 states have call predecessors, (47), 33 states have return successors, (95), 41 states have call predecessors, (95), 46 states have call successors, (95) [2024-11-11 16:01:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 639 transitions. [2024-11-11 16:01:15,092 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 639 transitions. Word has length 59 [2024-11-11 16:01:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:15,092 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 639 transitions. [2024-11-11 16:01:15,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 16:01:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 639 transitions. [2024-11-11 16:01:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 16:01:15,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:15,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:15,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 16:01:15,094 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:15,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2040063704, now seen corresponding path program 1 times [2024-11-11 16:01:15,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:15,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261056743] [2024-11-11 16:01:15,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:15,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:15,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 16:01:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:15,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-11 16:01:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:15,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 16:01:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 16:01:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 16:01:15,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:01:15,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261056743] [2024-11-11 16:01:15,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261056743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:01:15,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118572129] [2024-11-11 16:01:15,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:15,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:15,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:15,223 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:01:15,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-11 16:01:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:15,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-11 16:01:15,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 16:01:15,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:15,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118572129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:15,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:01:15,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 14 [2024-11-11 16:01:15,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904101357] [2024-11-11 16:01:15,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:15,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 16:01:15,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:01:15,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 16:01:15,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-11 16:01:15,340 INFO L87 Difference]: Start difference. First operand 462 states and 639 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 16:01:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:15,441 INFO L93 Difference]: Finished difference Result 580 states and 795 transitions. [2024-11-11 16:01:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 16:01:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2024-11-11 16:01:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:15,444 INFO L225 Difference]: With dead ends: 580 [2024-11-11 16:01:15,444 INFO L226 Difference]: Without dead ends: 478 [2024-11-11 16:01:15,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-11 16:01:15,445 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 62 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:15,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 751 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-11 16:01:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 462. [2024-11-11 16:01:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 381 states have (on average 1.2992125984251968) internal successors, (495), 407 states have internal predecessors, (495), 47 states have call successors, (47), 13 states have call predecessors, (47), 33 states have return successors, (95), 41 states have call predecessors, (95), 46 states have call successors, (95) [2024-11-11 16:01:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 637 transitions. [2024-11-11 16:01:15,467 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 637 transitions. Word has length 59 [2024-11-11 16:01:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:15,467 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 637 transitions. [2024-11-11 16:01:15,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 16:01:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 637 transitions. [2024-11-11 16:01:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-11 16:01:15,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:15,468 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:15,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-11 16:01:15,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:01:15,669 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:15,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:15,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1200934901, now seen corresponding path program 1 times [2024-11-11 16:01:15,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:01:15,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984658513] [2024-11-11 16:01:15,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:01:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 16:01:15,686 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 16:01:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 16:01:15,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 16:01:15,723 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 16:01:15,723 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:01:15,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 16:01:15,728 INFO L421 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:15,760 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:01:15,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:01:15 BoogieIcfgContainer [2024-11-11 16:01:15,763 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:01:15,764 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:01:15,764 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:01:15,764 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:01:15,764 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:00:58" (3/4) ... [2024-11-11 16:01:15,766 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 16:01:15,767 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:01:15,767 INFO L158 Benchmark]: Toolchain (without parser) took 18005.04ms. Allocated memory was 205.5MB in the beginning and 432.0MB in the end (delta: 226.5MB). Free memory was 138.4MB in the beginning and 159.2MB in the end (delta: -20.8MB). Peak memory consumption was 206.9MB. Max. memory is 16.1GB. [2024-11-11 16:01:15,767 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory was 76.0MB in the beginning and 75.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:01:15,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.04ms. Allocated memory is still 205.5MB. Free memory was 138.2MB in the beginning and 122.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 16:01:15,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.51ms. Allocated memory is still 205.5MB. Free memory was 122.9MB in the beginning and 121.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 16:01:15,768 INFO L158 Benchmark]: Boogie Preprocessor took 51.11ms. Allocated memory is still 205.5MB. Free memory was 121.4MB in the beginning and 119.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 16:01:15,768 INFO L158 Benchmark]: RCFGBuilder took 379.71ms. Allocated memory is still 205.5MB. Free memory was 119.0MB in the beginning and 164.0MB in the end (delta: -45.0MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-11-11 16:01:15,769 INFO L158 Benchmark]: TraceAbstraction took 17237.85ms. Allocated memory was 205.5MB in the beginning and 432.0MB in the end (delta: 226.5MB). Free memory was 163.2MB in the beginning and 159.2MB in the end (delta: 3.9MB). Peak memory consumption was 231.1MB. Max. memory is 16.1GB. [2024-11-11 16:01:15,769 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 432.0MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:01:15,770 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.13ms. Allocated memory is still 104.9MB. Free memory was 76.0MB in the beginning and 75.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.04ms. Allocated memory is still 205.5MB. Free memory was 138.2MB in the beginning and 122.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.51ms. Allocated memory is still 205.5MB. Free memory was 122.9MB in the beginning and 121.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.11ms. Allocated memory is still 205.5MB. Free memory was 121.4MB in the beginning and 119.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 379.71ms. Allocated memory is still 205.5MB. Free memory was 119.0MB in the beginning and 164.0MB in the end (delta: -45.0MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17237.85ms. Allocated memory was 205.5MB in the beginning and 432.0MB in the end (delta: 226.5MB). Free memory was 163.2MB in the beginning and 159.2MB in the end (delta: 3.9MB). Peak memory consumption was 231.1MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 432.0MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 114, overapproximation of bitwiseAnd at line 127. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add1 ; [L234] unsigned int r_add2 ; [L235] unsigned int zero ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int __retres14 ; VAL [ea=127, eb=127] [L242] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L242] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=127] [L242] zero = base2flt(0, 0) [L243] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=4328521728] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=4328521728, __retres4=4294967295, m=4328521728] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=4328521728, \result=4294967295, m=4328521728] [L243] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=127, ma=4328521728] [L243] a = base2flt(ma, ea) [L244] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L244] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432] [L244] b = base2flt(mb, eb) [L245] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=4294967295] [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L95] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=127, ma=16777215] [L111] EXPR ma | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=127] [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217, mb=16777215] [L114] EXPR mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217] [L114] mb = mb | (1U << 24U) [L115] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L115] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217, mb=-4278190080] [L116] delta = ea - eb VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, delta=0, ea=127, ma=16777217, mb=-4278190080] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, delta=0, ea=127, ma=16777217, mb=-4278190080] [L118] EXPR mb >> delta VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=16777217] [L118] mb = mb >> delta [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=-4261412863] [L127] ma & (1U << 25U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=-4261412863] [L127] COND FALSE !(ma & (1U << 25U)) [L140] CALL __VERIFIER_assert(ma < 1U << 25U) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L18] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1942 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1804 mSDsluCounter, 30031 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27231 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5890 IncrementalHoareTripleChecker+Invalid, 6135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 2800 mSDtfsCounter, 5890 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1620 GetRequests, 1193 SyntacticMatches, 4 SemanticMatches, 423 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=462occurred in iteration=22, InterpolantAutomatonStates: 322, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 1008 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1945 NumberOfCodeBlocks, 1909 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2219 ConstructedInterpolants, 1 QuantifiedInterpolants, 4985 SizeOfPredicates, 24 NumberOfNonLiveVariables, 2156 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 47 InterpolantComputations, 16 PerfectInterpolantSequences, 777/907 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-11 16:01:15,795 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:01:17,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:01:17,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-11 16:01:17,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:01:17,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:01:17,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:01:17,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:01:17,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:01:17,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:01:17,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:01:17,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:01:17,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:01:17,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:01:17,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:01:17,667 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:01:17,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:01:17,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:01:17,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:01:17,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:01:17,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:01:17,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:01:17,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:01:17,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:01:17,673 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 16:01:17,673 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 16:01:17,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:01:17,673 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 16:01:17,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:01:17,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:01:17,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:01:17,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:01:17,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:01:17,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:01:17,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:01:17,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:01:17,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:01:17,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:01:17,677 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:01:17,677 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 16:01:17,677 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 16:01:17,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:01:17,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:01:17,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:01:17,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:01:17,678 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2024-11-11 16:01:17,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:01:17,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:01:17,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:01:17,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:01:17,956 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:01:17,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-11 16:01:19,195 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:01:19,358 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:01:19,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-11 16:01:19,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71bd73e35/d382baf548a84e17943f4f0cb2d44b60/FLAG5e2cb41d4 [2024-11-11 16:01:19,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71bd73e35/d382baf548a84e17943f4f0cb2d44b60 [2024-11-11 16:01:19,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:01:19,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:01:19,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:01:19,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:01:19,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:01:19,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfa5526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19, skipping insertion in model container [2024-11-11 16:01:19,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:01:19,565 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c[755,768] [2024-11-11 16:01:19,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:01:19,629 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:01:19,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c[755,768] [2024-11-11 16:01:19,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:01:19,683 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:01:19,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19 WrapperNode [2024-11-11 16:01:19,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:01:19,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:01:19,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:01:19,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:01:19,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,709 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-11 16:01:19,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:01:19,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:01:19,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:01:19,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:01:19,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,732 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:01:19,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:01:19,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:01:19,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:01:19,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:01:19,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (1/1) ... [2024-11-11 16:01:19,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:01:19,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:01:19,768 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-11 16:01:19,773 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-11 16:01:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:01:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 16:01:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-11 16:01:19,804 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-11 16:01:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:01:19,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:01:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-11 16:01:19,804 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-11 16:01:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-11 16:01:19,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-11 16:01:19,862 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:01:19,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:01:20,086 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-11 16:01:20,087 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:01:20,101 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:01:20,101 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 16:01:20,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:01:20 BoogieIcfgContainer [2024-11-11 16:01:20,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:01:20,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:01:20,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:01:20,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:01:20,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:01:19" (1/3) ... [2024-11-11 16:01:20,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d994c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:01:20, skipping insertion in model container [2024-11-11 16:01:20,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:01:19" (2/3) ... [2024-11-11 16:01:20,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d994c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:01:20, skipping insertion in model container [2024-11-11 16:01:20,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:01:20" (3/3) ... [2024-11-11 16:01:20,111 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2024-11-11 16:01:20,125 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:01:20,125 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:01:20,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:01:20,185 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;@1e9d6738, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:01:20,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:01:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 42 states have internal predecessors, (61), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-11 16:01:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 16:01:20,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:20,195 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:20,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:20,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:20,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2030319843, now seen corresponding path program 1 times [2024-11-11 16:01:20,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:20,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119191953] [2024-11-11 16:01:20,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:20,211 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-11 16:01:20,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:20,214 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-11 16:01:20,215 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-11 16:01:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:20,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 16:01:20,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:01:20,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:20,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:20,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119191953] [2024-11-11 16:01:20,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119191953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:20,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:20,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 16:01:20,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824717515] [2024-11-11 16:01:20,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:20,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 16:01:20,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:20,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 16:01:20,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:01:20,447 INFO L87 Difference]: Start difference. First operand has 54 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 42 states have internal predecessors, (61), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:20,550 INFO L93 Difference]: Finished difference Result 125 states and 189 transitions. [2024-11-11 16:01:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 16:01:20,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2024-11-11 16:01:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:20,560 INFO L225 Difference]: With dead ends: 125 [2024-11-11 16:01:20,560 INFO L226 Difference]: Without dead ends: 68 [2024-11-11 16:01:20,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:01:20,566 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 14 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:20,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 445 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-11 16:01:20,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2024-11-11 16:01:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 48 states have internal predecessors, (60), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-11-11 16:01:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2024-11-11 16:01:20,601 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 31 [2024-11-11 16:01:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:20,601 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2024-11-11 16:01:20,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-11-11 16:01:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 16:01:20,603 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:20,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:20,607 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-11 16:01:20,806 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-11 16:01:20,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:20,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1468368814, now seen corresponding path program 1 times [2024-11-11 16:01:20,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:20,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324599627] [2024-11-11 16:01:20,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:20,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:01:20,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:20,810 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-11 16:01:20,811 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-11 16:01:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:20,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 16:01:20,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:01:20,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:01:20,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:20,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324599627] [2024-11-11 16:01:20,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324599627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:20,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:20,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-11 16:01:20,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325008221] [2024-11-11 16:01:20,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:20,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 16:01:20,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 16:01:20,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:01:20,966 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 16:01:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:21,043 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2024-11-11 16:01:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 16:01:21,044 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-11 16:01:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:21,045 INFO L225 Difference]: With dead ends: 115 [2024-11-11 16:01:21,045 INFO L226 Difference]: Without dead ends: 87 [2024-11-11 16:01:21,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-11 16:01:21,046 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:21,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 477 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-11 16:01:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2024-11-11 16:01:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 55 states have internal predecessors, (68), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-11 16:01:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2024-11-11 16:01:21,060 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 35 [2024-11-11 16:01:21,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:21,060 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2024-11-11 16:01:21,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 16:01:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2024-11-11 16:01:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 16:01:21,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:21,061 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-11 16:01:21,065 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 (3)] Ended with exit code 0 [2024-11-11 16:01:21,264 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-11 16:01:21,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:21,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash -686479404, now seen corresponding path program 1 times [2024-11-11 16:01:21,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:21,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411081391] [2024-11-11 16:01:21,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:21,266 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-11 16:01:21,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:21,268 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-11 16:01:21,298 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-11 16:01:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:21,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 16:01:21,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:01:21,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 16:01:21,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:21,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411081391] [2024-11-11 16:01:21,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411081391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:21,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:21,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-11 16:01:21,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211284747] [2024-11-11 16:01:21,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:21,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 16:01:21,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:21,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 16:01:21,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:01:21,446 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 16:01:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:21,506 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2024-11-11 16:01:21,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 16:01:21,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2024-11-11 16:01:21,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:21,508 INFO L225 Difference]: With dead ends: 110 [2024-11-11 16:01:21,508 INFO L226 Difference]: Without dead ends: 86 [2024-11-11 16:01:21,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:01:21,509 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 12 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:21,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 446 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-11 16:01:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-11 16:01:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.25) internal successors, (75), 62 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-11 16:01:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-11-11 16:01:21,522 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 39 [2024-11-11 16:01:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:21,522 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-11-11 16:01:21,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 16:01:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-11-11 16:01:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 16:01:21,524 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:21,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 16:01:21,526 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-11 16:01:21,724 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-11 16:01:21,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:21,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash 461161469, now seen corresponding path program 2 times [2024-11-11 16:01:21,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:21,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545327246] [2024-11-11 16:01:21,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 16:01:21,726 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-11 16:01:21,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:21,728 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-11 16:01:21,729 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-11 16:01:21,759 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 16:01:21,759 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:01:21,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 16:01:21,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 16:01:21,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:21,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545327246] [2024-11-11 16:01:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545327246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:21,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:21,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 16:01:21,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204691628] [2024-11-11 16:01:21,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:21,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 16:01:21,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:21,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 16:01:21,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:01:21,905 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:21,967 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2024-11-11 16:01:21,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 16:01:21,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-11 16:01:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:21,969 INFO L225 Difference]: With dead ends: 91 [2024-11-11 16:01:21,969 INFO L226 Difference]: Without dead ends: 89 [2024-11-11 16:01:21,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:01:21,970 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:21,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 309 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-11 16:01:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-11 16:01:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.25) internal successors, (80), 67 states have internal predecessors, (80), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (17), 12 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-11 16:01:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2024-11-11 16:01:21,984 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 39 [2024-11-11 16:01:21,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:21,984 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2024-11-11 16:01:21,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2024-11-11 16:01:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 16:01:21,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:21,986 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 16:01:21,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-11 16:01:22,187 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-11 16:01:22,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:22,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash 518419771, now seen corresponding path program 1 times [2024-11-11 16:01:22,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:22,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796157507] [2024-11-11 16:01:22,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:22,188 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-11 16:01:22,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:22,190 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-11 16:01:22,192 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-11 16:01:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:22,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 16:01:22,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 16:01:22,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:22,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:22,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796157507] [2024-11-11 16:01:22,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796157507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:22,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:22,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 16:01:22,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463011715] [2024-11-11 16:01:22,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:22,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 16:01:22,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:22,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 16:01:22,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:01:22,316 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:22,419 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2024-11-11 16:01:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 16:01:22,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-11 16:01:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:22,421 INFO L225 Difference]: With dead ends: 93 [2024-11-11 16:01:22,421 INFO L226 Difference]: Without dead ends: 91 [2024-11-11 16:01:22,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:01:22,422 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 304 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:22,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 304 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-11 16:01:22,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-11-11 16:01:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 65 states have internal predecessors, (78), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-11 16:01:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2024-11-11 16:01:22,430 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 39 [2024-11-11 16:01:22,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:22,430 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2024-11-11 16:01:22,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 16:01:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2024-11-11 16:01:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 16:01:22,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:22,432 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:22,435 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 (6)] Ended with exit code 0 [2024-11-11 16:01:22,635 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-11 16:01:22,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:22,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:22,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1162622522, now seen corresponding path program 1 times [2024-11-11 16:01:22,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:22,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535315465] [2024-11-11 16:01:22,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:22,637 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-11 16:01:22,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:22,639 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-11 16:01:22,640 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-11 16:01:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:22,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 16:01:22,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 16:01:22,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:22,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:22,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535315465] [2024-11-11 16:01:22,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535315465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:22,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:22,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 16:01:22,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049239767] [2024-11-11 16:01:22,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:22,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 16:01:22,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:22,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 16:01:22,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:01:22,763 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 16:01:22,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:22,924 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2024-11-11 16:01:22,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 16:01:22,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2024-11-11 16:01:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:22,926 INFO L225 Difference]: With dead ends: 124 [2024-11-11 16:01:22,926 INFO L226 Difference]: Without dead ends: 117 [2024-11-11 16:01:22,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-11 16:01:22,927 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:22,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 652 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-11 16:01:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2024-11-11 16:01:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 76 states have internal predecessors, (91), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2024-11-11 16:01:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2024-11-11 16:01:22,940 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 44 [2024-11-11 16:01:22,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:22,940 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2024-11-11 16:01:22,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 16:01:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2024-11-11 16:01:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 16:01:22,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:22,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:22,951 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-11 16:01:23,146 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-11 16:01:23,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:23,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash -977013140, now seen corresponding path program 1 times [2024-11-11 16:01:23,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:23,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814759389] [2024-11-11 16:01:23,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:23,147 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-11 16:01:23,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:23,149 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-11 16:01:23,150 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-11 16:01:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:23,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 16:01:23,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 16:01:23,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 16:01:23,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:23,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814759389] [2024-11-11 16:01:23,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814759389] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:23,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:23,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2024-11-11 16:01:23,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647917645] [2024-11-11 16:01:23,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:23,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 16:01:23,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:23,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 16:01:23,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-11 16:01:23,401 INFO L87 Difference]: Start difference. First operand 100 states and 129 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 16:01:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:23,575 INFO L93 Difference]: Finished difference Result 131 states and 169 transitions. [2024-11-11 16:01:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 16:01:23,576 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2024-11-11 16:01:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:23,579 INFO L225 Difference]: With dead ends: 131 [2024-11-11 16:01:23,579 INFO L226 Difference]: Without dead ends: 123 [2024-11-11 16:01:23,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-11 16:01:23,580 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 24 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:23,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 665 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-11 16:01:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2024-11-11 16:01:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.216867469879518) internal successors, (101), 84 states have internal predecessors, (101), 17 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (24), 19 states have call predecessors, (24), 16 states have call successors, (24) [2024-11-11 16:01:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 142 transitions. [2024-11-11 16:01:23,591 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 142 transitions. Word has length 46 [2024-11-11 16:01:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:23,591 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 142 transitions. [2024-11-11 16:01:23,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 16:01:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 142 transitions. [2024-11-11 16:01:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 16:01:23,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:23,593 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:23,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-11 16:01:23,793 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-11 16:01:23,794 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:23,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:23,794 INFO L85 PathProgramCache]: Analyzing trace with hash -919754838, now seen corresponding path program 1 times [2024-11-11 16:01:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:23,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093574319] [2024-11-11 16:01:23,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:23,795 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-11 16:01:23,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:23,797 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-11 16:01:23,798 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-11 16:01:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:23,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 16:01:23,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 16:01:23,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:23,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:23,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093574319] [2024-11-11 16:01:23,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093574319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:23,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:23,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 16:01:23,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274730726] [2024-11-11 16:01:23,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:23,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 16:01:23,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:23,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 16:01:23,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:01:23,854 INFO L87 Difference]: Start difference. First operand 111 states and 142 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 16:01:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:23,888 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2024-11-11 16:01:23,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 16:01:23,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2024-11-11 16:01:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:23,890 INFO L225 Difference]: With dead ends: 119 [2024-11-11 16:01:23,890 INFO L226 Difference]: Without dead ends: 104 [2024-11-11 16:01:23,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:01:23,890 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:23,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 312 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-11 16:01:23,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-11 16:01:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (21), 16 states have call predecessors, (21), 14 states have call successors, (21) [2024-11-11 16:01:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2024-11-11 16:01:23,898 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 46 [2024-11-11 16:01:23,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:23,898 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2024-11-11 16:01:23,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 16:01:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2024-11-11 16:01:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 16:01:23,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:23,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2024-11-11 16:01:23,906 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-11 16:01:24,100 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-11 16:01:24,100 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:24,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash -168643793, now seen corresponding path program 1 times [2024-11-11 16:01:24,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:24,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062020633] [2024-11-11 16:01:24,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:24,101 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-11 16:01:24,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:24,103 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-11 16:01:24,104 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-11 16:01:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:24,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-11 16:01:24,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:24,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:24,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:24,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062020633] [2024-11-11 16:01:24,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062020633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:24,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:24,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-11 16:01:24,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419214763] [2024-11-11 16:01:24,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:24,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-11 16:01:24,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:24,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-11 16:01:24,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2024-11-11 16:01:24,529 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 16:01:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:25,266 INFO L93 Difference]: Finished difference Result 146 states and 202 transitions. [2024-11-11 16:01:25,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 16:01:25,266 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 48 [2024-11-11 16:01:25,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:25,267 INFO L225 Difference]: With dead ends: 146 [2024-11-11 16:01:25,267 INFO L226 Difference]: Without dead ends: 109 [2024-11-11 16:01:25,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=1404, Unknown=0, NotChecked=0, Total=1560 [2024-11-11 16:01:25,268 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 70 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:25,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1102 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:01:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-11 16:01:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 86. [2024-11-11 16:01:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (24), 12 states have call predecessors, (24), 11 states have call successors, (24) [2024-11-11 16:01:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2024-11-11 16:01:25,282 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 48 [2024-11-11 16:01:25,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:25,284 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2024-11-11 16:01:25,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 16:01:25,284 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2024-11-11 16:01:25,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 16:01:25,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:25,285 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2024-11-11 16:01:25,288 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-11 16:01:25,485 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-11 16:01:25,485 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:25,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:25,486 INFO L85 PathProgramCache]: Analyzing trace with hash 291178745, now seen corresponding path program 2 times [2024-11-11 16:01:25,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:25,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355212058] [2024-11-11 16:01:25,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 16:01:25,486 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-11 16:01:25,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:25,488 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-11 16:01:25,489 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-11 16:01:25,528 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 16:01:25,528 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:01:25,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-11 16:01:25,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:25,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:25,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355212058] [2024-11-11 16:01:25,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355212058] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:25,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:25,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-11 16:01:25,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854059329] [2024-11-11 16:01:25,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:25,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-11 16:01:25,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:25,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-11 16:01:25,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2024-11-11 16:01:25,928 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 16:01:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:26,576 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2024-11-11 16:01:26,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 16:01:26,576 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 48 [2024-11-11 16:01:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:26,577 INFO L225 Difference]: With dead ends: 119 [2024-11-11 16:01:26,577 INFO L226 Difference]: Without dead ends: 108 [2024-11-11 16:01:26,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-11-11 16:01:26,578 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 81 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:26,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1207 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:01:26,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-11 16:01:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2024-11-11 16:01:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 69 states have internal predecessors, (80), 13 states have call successors, (13), 5 states have call predecessors, (13), 9 states have return successors, (27), 13 states have call predecessors, (27), 12 states have call successors, (27) [2024-11-11 16:01:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2024-11-11 16:01:26,588 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 48 [2024-11-11 16:01:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:26,589 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2024-11-11 16:01:26,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 16:01:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-11-11 16:01:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-11 16:01:26,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:26,590 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-11 16:01:26,593 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-11 16:01:26,792 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-11 16:01:26,793 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:26,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:26,793 INFO L85 PathProgramCache]: Analyzing trace with hash -744862915, now seen corresponding path program 1 times [2024-11-11 16:01:26,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:26,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665792052] [2024-11-11 16:01:26,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:26,793 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-11 16:01:26,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:26,794 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-11 16:01:26,795 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-11 16:01:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:26,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 16:01:26,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 16:01:30,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:30,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:30,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665792052] [2024-11-11 16:01:30,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665792052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:30,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:30,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 16:01:30,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016488549] [2024-11-11 16:01:30,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:30,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 16:01:30,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:30,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 16:01:30,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=36, Unknown=1, NotChecked=0, Total=56 [2024-11-11 16:01:30,341 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 16:01:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:30,448 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2024-11-11 16:01:30,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 16:01:30,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2024-11-11 16:01:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:30,449 INFO L225 Difference]: With dead ends: 102 [2024-11-11 16:01:30,449 INFO L226 Difference]: Without dead ends: 100 [2024-11-11 16:01:30,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=23, Invalid=48, Unknown=1, NotChecked=0, Total=72 [2024-11-11 16:01:30,450 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 10 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:30,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 354 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-11 16:01:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-11-11 16:01:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 73 states have internal predecessors, (83), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (28), 13 states have call predecessors, (28), 13 states have call successors, (28) [2024-11-11 16:01:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2024-11-11 16:01:30,458 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 49 [2024-11-11 16:01:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:30,459 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2024-11-11 16:01:30,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 16:01:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2024-11-11 16:01:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 16:01:30,459 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:30,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2024-11-11 16:01:30,462 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-11 16:01:30,660 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-11 16:01:30,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:30,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash -325172767, now seen corresponding path program 1 times [2024-11-11 16:01:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439093674] [2024-11-11 16:01:30,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:30,661 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-11 16:01:30,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:30,663 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-11 16:01:30,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 (13)] Waiting until timeout for monitored process [2024-11-11 16:01:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:30,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 16:01:30,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:30,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:30,926 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:01:30,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:30,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439093674] [2024-11-11 16:01:30,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439093674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:30,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:30,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-11 16:01:30,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524249574] [2024-11-11 16:01:30,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:30,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 16:01:30,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:30,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 16:01:30,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-11 16:01:30,927 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 16:01:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:31,130 INFO L93 Difference]: Finished difference Result 125 states and 172 transitions. [2024-11-11 16:01:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 16:01:31,131 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 50 [2024-11-11 16:01:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:31,131 INFO L225 Difference]: With dead ends: 125 [2024-11-11 16:01:31,131 INFO L226 Difference]: Without dead ends: 114 [2024-11-11 16:01:31,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-11 16:01:31,132 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 18 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:31,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 714 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-11 16:01:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2024-11-11 16:01:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 76 states have internal predecessors, (85), 14 states have call successors, (14), 6 states have call predecessors, (14), 11 states have return successors, (31), 13 states have call predecessors, (31), 13 states have call successors, (31) [2024-11-11 16:01:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2024-11-11 16:01:31,146 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 50 [2024-11-11 16:01:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:31,147 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2024-11-11 16:01:31,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 16:01:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2024-11-11 16:01:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 16:01:31,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:31,147 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:31,151 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-11 16:01:31,348 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-11 16:01:31,348 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:31,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:31,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1583051783, now seen corresponding path program 1 times [2024-11-11 16:01:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:31,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190716220] [2024-11-11 16:01:31,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:31,349 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-11 16:01:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:31,350 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-11 16:01:31,351 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-11 16:01:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:31,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 16:01:31,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 16:01:31,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:31,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:31,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190716220] [2024-11-11 16:01:31,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190716220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:31,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:31,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 16:01:31,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259534237] [2024-11-11 16:01:31,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:31,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 16:01:31,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:31,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 16:01:31,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:01:31,441 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 16:01:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:31,508 INFO L93 Difference]: Finished difference Result 156 states and 196 transitions. [2024-11-11 16:01:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 16:01:31,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2024-11-11 16:01:31,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:31,509 INFO L225 Difference]: With dead ends: 156 [2024-11-11 16:01:31,509 INFO L226 Difference]: Without dead ends: 88 [2024-11-11 16:01:31,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-11 16:01:31,510 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:31,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 500 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:01:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-11 16:01:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-11 16:01:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.234375) internal successors, (79), 70 states have internal predecessors, (79), 13 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (29), 12 states have call predecessors, (29), 12 states have call successors, (29) [2024-11-11 16:01:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2024-11-11 16:01:31,517 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 54 [2024-11-11 16:01:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:31,517 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2024-11-11 16:01:31,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 16:01:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2024-11-11 16:01:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 16:01:31,518 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:31,518 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2024-11-11 16:01:31,523 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 (14)] Ended with exit code 0 [2024-11-11 16:01:31,718 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-11 16:01:31,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:31,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:31,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1846975685, now seen corresponding path program 1 times [2024-11-11 16:01:31,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:31,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57246054] [2024-11-11 16:01:31,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:31,719 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-11 16:01:31,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:31,722 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-11 16:01:31,723 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-11 16:01:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:31,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 16:01:31,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 16:01:41,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:01:41,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:41,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57246054] [2024-11-11 16:01:41,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57246054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:01:41,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:01:41,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 16:01:41,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916909190] [2024-11-11 16:01:41,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:01:41,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 16:01:41,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:41,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 16:01:41,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=37, Unknown=3, NotChecked=0, Total=56 [2024-11-11 16:01:41,200 INFO L87 Difference]: Start difference. First operand 88 states and 121 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 16:01:43,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-11 16:01:45,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-11 16:01:47,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-11 16:01:49,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-11 16:01:52,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-11 16:01:54,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-11 16:01:57,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-11 16:01:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:57,687 INFO L93 Difference]: Finished difference Result 98 states and 133 transitions. [2024-11-11 16:01:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 16:01:57,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2024-11-11 16:01:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:57,688 INFO L225 Difference]: With dead ends: 98 [2024-11-11 16:01:57,688 INFO L226 Difference]: Without dead ends: 94 [2024-11-11 16:01:57,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=20, Invalid=49, Unknown=3, NotChecked=0, Total=72 [2024-11-11 16:01:57,688 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 8 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:57,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 301 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 7 Unknown, 0 Unchecked, 16.5s Time] [2024-11-11 16:01:57,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-11 16:01:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2024-11-11 16:01:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (28), 12 states have call predecessors, (28), 11 states have call successors, (28) [2024-11-11 16:01:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-11-11 16:01:57,697 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 50 [2024-11-11 16:01:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:57,697 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-11-11 16:01:57,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 16:01:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-11-11 16:01:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-11 16:01:57,698 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:57,698 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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] [2024-11-11 16:01:57,701 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-11 16:01:57,898 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-11 16:01:57,899 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:57,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:57,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1592416888, now seen corresponding path program 1 times [2024-11-11 16:01:57,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:57,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446456954] [2024-11-11 16:01:57,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:57,900 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-11 16:01:57,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:57,902 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-11 16:01:57,903 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-11 16:01:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:57,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 16:01:57,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 16:01:57,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 16:01:58,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:58,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446456954] [2024-11-11 16:01:58,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446456954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:58,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:58,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-11 16:01:58,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664015683] [2024-11-11 16:01:58,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:58,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 16:01:58,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:58,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 16:01:58,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:01:58,055 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 16:01:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:58,168 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2024-11-11 16:01:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 16:01:58,168 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2024-11-11 16:01:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:58,169 INFO L225 Difference]: With dead ends: 111 [2024-11-11 16:01:58,169 INFO L226 Difference]: Without dead ends: 98 [2024-11-11 16:01:58,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-11 16:01:58,169 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:58,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 433 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-11 16:01:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-11-11 16:01:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 70 states have internal predecessors, (79), 12 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (31), 12 states have call predecessors, (31), 11 states have call successors, (31) [2024-11-11 16:01:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2024-11-11 16:01:58,184 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 54 [2024-11-11 16:01:58,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:58,185 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2024-11-11 16:01:58,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 16:01:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2024-11-11 16:01:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 16:01:58,185 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:58,186 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:58,190 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-11 16:01:58,388 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-11 16:01:58,388 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:58,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:58,389 INFO L85 PathProgramCache]: Analyzing trace with hash -177633806, now seen corresponding path program 1 times [2024-11-11 16:01:58,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:58,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016672828] [2024-11-11 16:01:58,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:58,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:01:58,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:58,390 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-11 16:01:58,391 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-11 16:01:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:58,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 16:01:58,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 16:01:58,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 16:01:58,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:58,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016672828] [2024-11-11 16:01:58,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016672828] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:58,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:58,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-11 16:01:58,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112546451] [2024-11-11 16:01:58,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:58,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 16:01:58,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:58,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 16:01:58,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:01:58,577 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 16:01:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:58,684 INFO L93 Difference]: Finished difference Result 111 states and 161 transitions. [2024-11-11 16:01:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 16:01:58,685 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2024-11-11 16:01:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:58,686 INFO L225 Difference]: With dead ends: 111 [2024-11-11 16:01:58,686 INFO L226 Difference]: Without dead ends: 98 [2024-11-11 16:01:58,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-11 16:01:58,687 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 21 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:58,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 540 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-11 16:01:58,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-11-11 16:01:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 70 states have internal predecessors, (79), 12 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (30), 12 states have call predecessors, (30), 11 states have call successors, (30) [2024-11-11 16:01:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2024-11-11 16:01:58,699 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 63 [2024-11-11 16:01:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:58,699 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2024-11-11 16:01:58,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 16:01:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2024-11-11 16:01:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 16:01:58,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:58,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:58,703 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-11 16:01:58,900 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-11 16:01:58,901 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:58,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:58,901 INFO L85 PathProgramCache]: Analyzing trace with hash -378794195, now seen corresponding path program 1 times [2024-11-11 16:01:58,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:58,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43792149] [2024-11-11 16:01:58,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:58,901 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-11 16:01:58,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:58,903 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-11 16:01:58,904 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-11 16:01:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:58,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 16:01:58,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 16:01:58,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 16:01:59,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:59,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43792149] [2024-11-11 16:01:59,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43792149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:59,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:59,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-11 16:01:59,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990554332] [2024-11-11 16:01:59,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:59,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 16:01:59,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:59,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 16:01:59,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:01:59,101 INFO L87 Difference]: Start difference. First operand 88 states and 121 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 16:01:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:59,216 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2024-11-11 16:01:59,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 16:01:59,217 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2024-11-11 16:01:59,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:59,218 INFO L225 Difference]: With dead ends: 109 [2024-11-11 16:01:59,218 INFO L226 Difference]: Without dead ends: 95 [2024-11-11 16:01:59,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-11 16:01:59,219 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:59,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 411 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-11 16:01:59,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2024-11-11 16:01:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 67 states have internal predecessors, (76), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (27), 12 states have call predecessors, (27), 11 states have call successors, (27) [2024-11-11 16:01:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2024-11-11 16:01:59,230 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 115 transitions. Word has length 63 [2024-11-11 16:01:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:59,231 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 115 transitions. [2024-11-11 16:01:59,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 16:01:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2024-11-11 16:01:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 16:01:59,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:59,232 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:01:59,235 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-11 16:01:59,432 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-11 16:01:59,432 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:59,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:59,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2130957302, now seen corresponding path program 1 times [2024-11-11 16:01:59,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:59,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048452066] [2024-11-11 16:01:59,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:59,433 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-11 16:01:59,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:59,436 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-11 16:01:59,436 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-11 16:01:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:59,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 16:01:59,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:01:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 16:01:59,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:01:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 16:01:59,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:01:59,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048452066] [2024-11-11 16:01:59,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048452066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:01:59,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:01:59,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-11 16:01:59,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896195016] [2024-11-11 16:01:59,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:01:59,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 16:01:59,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:01:59,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 16:01:59,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:01:59,621 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 16:01:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:01:59,722 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2024-11-11 16:01:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 16:01:59,722 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2024-11-11 16:01:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:01:59,723 INFO L225 Difference]: With dead ends: 106 [2024-11-11 16:01:59,723 INFO L226 Difference]: Without dead ends: 92 [2024-11-11 16:01:59,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-11 16:01:59,723 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 38 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:01:59,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 507 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:01:59,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-11 16:01:59,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2024-11-11 16:01:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 64 states have internal predecessors, (73), 12 states have call successors, (12), 5 states have call predecessors, (12), 8 states have return successors, (25), 12 states have call predecessors, (25), 11 states have call successors, (25) [2024-11-11 16:01:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2024-11-11 16:01:59,729 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 65 [2024-11-11 16:01:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:01:59,729 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2024-11-11 16:01:59,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 16:01:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2024-11-11 16:01:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 16:01:59,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:01:59,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:01:59,733 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-11 16:01:59,930 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-11 16:01:59,930 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:01:59,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:01:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1951422266, now seen corresponding path program 1 times [2024-11-11 16:01:59,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:01:59,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888017152] [2024-11-11 16:01:59,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:01:59,931 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-11 16:01:59,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:01:59,933 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-11 16:01:59,934 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-11 16:01:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:01:59,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-11 16:01:59,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 16:02:00,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:02:00,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:00,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888017152] [2024-11-11 16:02:00,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888017152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:00,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:00,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 16:02:00,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143548427] [2024-11-11 16:02:00,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:00,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 16:02:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 16:02:00,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 16:02:00,241 INFO L87 Difference]: Start difference. First operand 82 states and 110 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 16:02:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:00,362 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2024-11-11 16:02:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 16:02:00,362 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2024-11-11 16:02:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:00,363 INFO L225 Difference]: With dead ends: 96 [2024-11-11 16:02:00,363 INFO L226 Difference]: Without dead ends: 87 [2024-11-11 16:02:00,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 16:02:00,364 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 6 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:00,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 521 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:02:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-11 16:02:00,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-11-11 16:02:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 64 states have internal predecessors, (73), 12 states have call successors, (12), 5 states have call predecessors, (12), 8 states have return successors, (24), 12 states have call predecessors, (24), 11 states have call successors, (24) [2024-11-11 16:02:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2024-11-11 16:02:00,369 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 72 [2024-11-11 16:02:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:00,369 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2024-11-11 16:02:00,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 16:02:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2024-11-11 16:02:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 16:02:00,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:00,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:02:00,375 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 (20)] Forceful destruction successful, exit code 0 [2024-11-11 16:02:00,570 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-11 16:02:00,571 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:00,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:00,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1060490927, now seen corresponding path program 1 times [2024-11-11 16:02:00,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:00,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10784620] [2024-11-11 16:02:00,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:00,571 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-11 16:02:00,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:00,574 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-11 16:02:00,574 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-11 16:02:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:00,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 16:02:00,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 16:02:01,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 16:02:01,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:01,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10784620] [2024-11-11 16:02:01,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10784620] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:02:01,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:02:01,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2024-11-11 16:02:01,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013022613] [2024-11-11 16:02:01,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:02:01,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 16:02:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 16:02:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2024-11-11 16:02:01,778 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-11 16:02:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:03,437 INFO L93 Difference]: Finished difference Result 108 states and 148 transitions. [2024-11-11 16:02:03,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 16:02:03,437 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 72 [2024-11-11 16:02:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:03,438 INFO L225 Difference]: With dead ends: 108 [2024-11-11 16:02:03,438 INFO L226 Difference]: Without dead ends: 99 [2024-11-11 16:02:03,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2024-11-11 16:02:03,439 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:03,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 967 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:02:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-11 16:02:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2024-11-11 16:02:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 69 states have internal predecessors, (79), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (28), 12 states have call predecessors, (28), 11 states have call successors, (28) [2024-11-11 16:02:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-11-11 16:02:03,446 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 72 [2024-11-11 16:02:03,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:03,446 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-11-11 16:02:03,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-11 16:02:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-11-11 16:02:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 16:02:03,447 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:03,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11 16:02:03,450 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-11 16:02:03,647 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-11 16:02:03,647 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:03,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:03,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1279345645, now seen corresponding path program 1 times [2024-11-11 16:02:03,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:03,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588599627] [2024-11-11 16:02:03,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:03,648 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-11 16:02:03,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:03,649 INFO L229 MonitoredProcess]: Starting monitored process 22 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-11 16:02:03,650 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 (22)] Waiting until timeout for monitored process [2024-11-11 16:02:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:03,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 16:02:03,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-11 16:02:04,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 16:02:05,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:05,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588599627] [2024-11-11 16:02:05,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588599627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:02:05,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:02:05,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2024-11-11 16:02:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159706448] [2024-11-11 16:02:05,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:02:05,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 16:02:05,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:05,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 16:02:05,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-11-11 16:02:05,276 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-11 16:02:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:07,567 INFO L93 Difference]: Finished difference Result 145 states and 199 transitions. [2024-11-11 16:02:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 16:02:07,568 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 72 [2024-11-11 16:02:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:07,569 INFO L225 Difference]: With dead ends: 145 [2024-11-11 16:02:07,569 INFO L226 Difference]: Without dead ends: 130 [2024-11-11 16:02:07,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=342, Invalid=2108, Unknown=0, NotChecked=0, Total=2450 [2024-11-11 16:02:07,570 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 88 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:07,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 894 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:02:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-11 16:02:07,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2024-11-11 16:02:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.216867469879518) internal successors, (101), 87 states have internal predecessors, (101), 16 states have call successors, (16), 6 states have call predecessors, (16), 10 states have return successors, (38), 16 states have call predecessors, (38), 15 states have call successors, (38) [2024-11-11 16:02:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2024-11-11 16:02:07,581 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 72 [2024-11-11 16:02:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:07,581 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2024-11-11 16:02:07,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-11 16:02:07,581 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2024-11-11 16:02:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 16:02:07,582 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:07,582 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11 16:02:07,586 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 (22)] Ended with exit code 0 [2024-11-11 16:02:07,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-11 16:02:07,783 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:07,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash -784876239, now seen corresponding path program 2 times [2024-11-11 16:02:07,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:07,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984068454] [2024-11-11 16:02:07,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 16:02:07,784 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-11 16:02:07,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:07,785 INFO L229 MonitoredProcess]: Starting monitored process 23 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-11 16:02:07,787 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 (23)] Waiting until timeout for monitored process [2024-11-11 16:02:07,830 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 16:02:07,830 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:02:07,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 16:02:07,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-11 16:02:08,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 16:02:09,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:09,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984068454] [2024-11-11 16:02:09,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984068454] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:02:09,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:02:09,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2024-11-11 16:02:09,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365688042] [2024-11-11 16:02:09,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:02:09,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 16:02:09,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:09,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 16:02:09,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2024-11-11 16:02:09,331 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-11 16:02:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:11,145 INFO L93 Difference]: Finished difference Result 179 states and 250 transitions. [2024-11-11 16:02:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-11 16:02:11,146 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 72 [2024-11-11 16:02:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:11,147 INFO L225 Difference]: With dead ends: 179 [2024-11-11 16:02:11,147 INFO L226 Difference]: Without dead ends: 162 [2024-11-11 16:02:11,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2024-11-11 16:02:11,148 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 96 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:11,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1023 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:02:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-11 16:02:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 141. [2024-11-11 16:02:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 112 states have internal predecessors, (131), 21 states have call successors, (21), 7 states have call predecessors, (21), 12 states have return successors, (51), 21 states have call predecessors, (51), 20 states have call successors, (51) [2024-11-11 16:02:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2024-11-11 16:02:11,164 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 72 [2024-11-11 16:02:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:11,164 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2024-11-11 16:02:11,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-11 16:02:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2024-11-11 16:02:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 16:02:11,165 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:11,165 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11 16:02:11,169 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 (23)] Ended with exit code 0 [2024-11-11 16:02:11,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-11 16:02:11,366 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:11,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:11,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1031466431, now seen corresponding path program 1 times [2024-11-11 16:02:11,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:11,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226130858] [2024-11-11 16:02:11,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:11,367 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-11 16:02:11,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:11,369 INFO L229 MonitoredProcess]: Starting monitored process 24 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-11 16:02:11,370 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 (24)] Waiting until timeout for monitored process [2024-11-11 16:02:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:11,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 16:02:11,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 16:02:11,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:11,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226130858] [2024-11-11 16:02:11,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226130858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:02:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [88336847] [2024-11-11 16:02:11,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:11,918 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-11 16:02:11,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-11 16:02:11,920 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-11 16:02:11,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-11 16:02:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:11,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 16:02:11,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 16:02:12,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:02:12,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [88336847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:12,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:02:12,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-11-11 16:02:12,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602649439] [2024-11-11 16:02:12,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:12,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 16:02:12,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:12,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 16:02:12,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-11 16:02:12,132 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 16:02:12,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:12,182 INFO L93 Difference]: Finished difference Result 184 states and 270 transitions. [2024-11-11 16:02:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 16:02:12,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2024-11-11 16:02:12,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:12,184 INFO L225 Difference]: With dead ends: 184 [2024-11-11 16:02:12,184 INFO L226 Difference]: Without dead ends: 155 [2024-11-11 16:02:12,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-11 16:02:12,184 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:12,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 253 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:12,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-11 16:02:12,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2024-11-11 16:02:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 105 states have (on average 1.2) internal successors, (126), 111 states have internal predecessors, (126), 22 states have call successors, (22), 7 states have call predecessors, (22), 13 states have return successors, (56), 22 states have call predecessors, (56), 21 states have call successors, (56) [2024-11-11 16:02:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2024-11-11 16:02:12,202 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 74 [2024-11-11 16:02:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:12,202 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2024-11-11 16:02:12,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 16:02:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2024-11-11 16:02:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 16:02:12,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:12,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2024-11-11 16:02:12,210 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 (24)] Ended with exit code 0 [2024-11-11 16:02:12,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2024-11-11 16:02:12,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-11 16:02:12,604 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:12,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1250321149, now seen corresponding path program 1 times [2024-11-11 16:02:12,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:12,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959125086] [2024-11-11 16:02:12,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:12,605 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-11 16:02:12,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:12,606 INFO L229 MonitoredProcess]: Starting monitored process 26 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-11 16:02:12,606 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 (26)] Waiting until timeout for monitored process [2024-11-11 16:02:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:12,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 16:02:12,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-11 16:02:13,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 16:02:14,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:14,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959125086] [2024-11-11 16:02:14,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959125086] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:02:14,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:02:14,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2024-11-11 16:02:14,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743147307] [2024-11-11 16:02:14,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:02:14,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 16:02:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:14,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 16:02:14,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2024-11-11 16:02:14,251 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-11 16:02:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:15,517 INFO L93 Difference]: Finished difference Result 175 states and 243 transitions. [2024-11-11 16:02:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-11 16:02:15,518 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 74 [2024-11-11 16:02:15,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:15,519 INFO L225 Difference]: With dead ends: 175 [2024-11-11 16:02:15,519 INFO L226 Difference]: Without dead ends: 155 [2024-11-11 16:02:15,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2024-11-11 16:02:15,520 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 58 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:15,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1081 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:02:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-11 16:02:15,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2024-11-11 16:02:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 112 states have internal predecessors, (128), 22 states have call successors, (22), 8 states have call predecessors, (22), 13 states have return successors, (51), 22 states have call predecessors, (51), 21 states have call successors, (51) [2024-11-11 16:02:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 201 transitions. [2024-11-11 16:02:15,539 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 201 transitions. Word has length 74 [2024-11-11 16:02:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:15,540 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 201 transitions. [2024-11-11 16:02:15,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-11 16:02:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 201 transitions. [2024-11-11 16:02:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 16:02:15,541 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:15,541 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:02:15,544 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 (26)] Ended with exit code 0 [2024-11-11 16:02:15,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-11 16:02:15,741 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:15,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash 359389810, now seen corresponding path program 1 times [2024-11-11 16:02:15,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:15,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207438281] [2024-11-11 16:02:15,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:15,742 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-11 16:02:15,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:15,743 INFO L229 MonitoredProcess]: Starting monitored process 27 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-11 16:02:15,744 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 (27)] Waiting until timeout for monitored process [2024-11-11 16:02:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:15,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 16:02:15,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 16:02:15,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:02:15,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:15,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207438281] [2024-11-11 16:02:15,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207438281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:02:15,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:02:15,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 16:02:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447819321] [2024-11-11 16:02:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:02:15,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 16:02:15,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:15,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 16:02:15,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:02:15,833 INFO L87 Difference]: Start difference. First operand 143 states and 201 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 16:02:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:15,892 INFO L93 Difference]: Finished difference Result 155 states and 214 transitions. [2024-11-11 16:02:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 16:02:15,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 74 [2024-11-11 16:02:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:15,893 INFO L225 Difference]: With dead ends: 155 [2024-11-11 16:02:15,893 INFO L226 Difference]: Without dead ends: 146 [2024-11-11 16:02:15,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:02:15,894 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 3 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:15,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 462 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:02:15,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-11 16:02:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-11-11 16:02:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 112 states have internal predecessors, (128), 22 states have call successors, (22), 8 states have call predecessors, (22), 13 states have return successors, (48), 22 states have call predecessors, (48), 21 states have call successors, (48) [2024-11-11 16:02:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 198 transitions. [2024-11-11 16:02:15,910 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 198 transitions. Word has length 74 [2024-11-11 16:02:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:15,911 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 198 transitions. [2024-11-11 16:02:15,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 16:02:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 198 transitions. [2024-11-11 16:02:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 16:02:15,912 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:15,912 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2024-11-11 16:02:15,918 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 (27)] Forceful destruction successful, exit code 0 [2024-11-11 16:02:16,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-11 16:02:16,112 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:16,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:16,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1455113153, now seen corresponding path program 2 times [2024-11-11 16:02:16,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:16,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531067134] [2024-11-11 16:02:16,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 16:02:16,113 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-11 16:02:16,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:16,114 INFO L229 MonitoredProcess]: Starting monitored process 28 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-11 16:02:16,117 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 (28)] Waiting until timeout for monitored process [2024-11-11 16:02:16,160 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 16:02:16,161 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:02:16,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 16:02:16,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:16,549 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-11 16:02:16,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 16:02:17,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:17,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531067134] [2024-11-11 16:02:17,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531067134] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:02:17,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:02:17,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2024-11-11 16:02:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126824970] [2024-11-11 16:02:17,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:02:17,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 16:02:17,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:17,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 16:02:17,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-11 16:02:17,732 INFO L87 Difference]: Start difference. First operand 143 states and 198 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-11 16:02:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:18,974 INFO L93 Difference]: Finished difference Result 179 states and 239 transitions. [2024-11-11 16:02:18,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 16:02:18,975 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 74 [2024-11-11 16:02:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:18,976 INFO L225 Difference]: With dead ends: 179 [2024-11-11 16:02:18,976 INFO L226 Difference]: Without dead ends: 165 [2024-11-11 16:02:18,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2024-11-11 16:02:18,977 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 33 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:18,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1133 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:02:18,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-11 16:02:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2024-11-11 16:02:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 118 states have internal predecessors, (136), 23 states have call successors, (23), 9 states have call predecessors, (23), 13 states have return successors, (46), 23 states have call predecessors, (46), 22 states have call successors, (46) [2024-11-11 16:02:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2024-11-11 16:02:19,000 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 74 [2024-11-11 16:02:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:19,000 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2024-11-11 16:02:19,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-11 16:02:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2024-11-11 16:02:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 16:02:19,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:19,001 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2024-11-11 16:02:19,007 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 (28)] Ended with exit code 0 [2024-11-11 16:02:19,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-11 16:02:19,202 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:19,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:19,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1126803066, now seen corresponding path program 1 times [2024-11-11 16:02:19,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:19,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176718385] [2024-11-11 16:02:19,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:19,202 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-11 16:02:19,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:19,203 INFO L229 MonitoredProcess]: Starting monitored process 29 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-11 16:02:19,204 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 (29)] Waiting until timeout for monitored process [2024-11-11 16:02:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:19,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-11 16:02:19,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 16:02:19,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 16:02:21,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:21,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176718385] [2024-11-11 16:02:21,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176718385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:02:21,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:02:21,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2024-11-11 16:02:21,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267878883] [2024-11-11 16:02:21,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:02:21,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-11 16:02:21,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:21,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-11 16:02:21,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2024-11-11 16:02:21,338 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-11 16:02:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:22,793 INFO L93 Difference]: Finished difference Result 184 states and 242 transitions. [2024-11-11 16:02:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 16:02:22,794 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) Word has length 77 [2024-11-11 16:02:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:22,795 INFO L225 Difference]: With dead ends: 184 [2024-11-11 16:02:22,795 INFO L226 Difference]: Without dead ends: 163 [2024-11-11 16:02:22,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2024-11-11 16:02:22,795 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 46 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:22,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 891 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:02:22,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-11 16:02:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2024-11-11 16:02:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 114 states have (on average 1.1754385964912282) internal successors, (134), 118 states have internal predecessors, (134), 23 states have call successors, (23), 9 states have call predecessors, (23), 13 states have return successors, (43), 23 states have call predecessors, (43), 22 states have call successors, (43) [2024-11-11 16:02:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 200 transitions. [2024-11-11 16:02:22,818 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 200 transitions. Word has length 77 [2024-11-11 16:02:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:22,819 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 200 transitions. [2024-11-11 16:02:22,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 29 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-11 16:02:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 200 transitions. [2024-11-11 16:02:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 16:02:22,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:22,820 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2024-11-11 16:02:22,824 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 (29)] Ended with exit code 0 [2024-11-11 16:02:23,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-11 16:02:23,021 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:23,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1449154486, now seen corresponding path program 2 times [2024-11-11 16:02:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:23,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337913369] [2024-11-11 16:02:23,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 16:02:23,021 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-11 16:02:23,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:23,022 INFO L229 MonitoredProcess]: Starting monitored process 30 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-11 16:02:23,023 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 (30)] Waiting until timeout for monitored process [2024-11-11 16:02:23,072 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 16:02:23,073 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 16:02:23,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-11 16:02:23,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 16:02:23,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 16:02:25,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:25,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337913369] [2024-11-11 16:02:25,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337913369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:02:25,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:02:25,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2024-11-11 16:02:25,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112008396] [2024-11-11 16:02:25,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:02:25,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 16:02:25,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:25,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 16:02:25,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2024-11-11 16:02:25,046 INFO L87 Difference]: Start difference. First operand 151 states and 200 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-11 16:02:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:27,216 INFO L93 Difference]: Finished difference Result 177 states and 229 transitions. [2024-11-11 16:02:27,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-11 16:02:27,217 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) Word has length 77 [2024-11-11 16:02:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:27,218 INFO L225 Difference]: With dead ends: 177 [2024-11-11 16:02:27,218 INFO L226 Difference]: Without dead ends: 163 [2024-11-11 16:02:27,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2024-11-11 16:02:27,219 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 59 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:27,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 774 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:02:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-11 16:02:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2024-11-11 16:02:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 118 states have internal predecessors, (133), 23 states have call successors, (23), 9 states have call predecessors, (23), 13 states have return successors, (43), 23 states have call predecessors, (43), 22 states have call successors, (43) [2024-11-11 16:02:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 199 transitions. [2024-11-11 16:02:27,243 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 199 transitions. Word has length 77 [2024-11-11 16:02:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:27,243 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 199 transitions. [2024-11-11 16:02:27,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-11 16:02:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 199 transitions. [2024-11-11 16:02:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 16:02:27,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:27,245 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2024-11-11 16:02:27,249 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 (30)] Ended with exit code 0 [2024-11-11 16:02:27,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-11 16:02:27,446 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:27,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:27,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2068625504, now seen corresponding path program 1 times [2024-11-11 16:02:27,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:27,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674298097] [2024-11-11 16:02:27,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:27,447 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-11 16:02:27,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:27,448 INFO L229 MonitoredProcess]: Starting monitored process 31 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-11 16:02:27,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2024-11-11 16:02:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:27,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-11 16:02:27,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:02:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 16:02:27,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:02:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 16:02:28,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:02:28,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674298097] [2024-11-11 16:02:28,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674298097] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:02:28,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:02:28,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2024-11-11 16:02:28,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713601563] [2024-11-11 16:02:28,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:02:28,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 16:02:28,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:02:28,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 16:02:28,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2024-11-11 16:02:28,747 INFO L87 Difference]: Start difference. First operand 151 states and 199 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-11 16:02:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:02:29,620 INFO L93 Difference]: Finished difference Result 170 states and 219 transitions. [2024-11-11 16:02:29,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 16:02:29,621 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) Word has length 78 [2024-11-11 16:02:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:02:29,622 INFO L225 Difference]: With dead ends: 170 [2024-11-11 16:02:29,622 INFO L226 Difference]: Without dead ends: 128 [2024-11-11 16:02:29,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2024-11-11 16:02:29,623 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 46 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:02:29,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 836 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:02:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-11 16:02:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2024-11-11 16:02:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 95 states have internal predecessors, (106), 19 states have call successors, (19), 8 states have call predecessors, (19), 11 states have return successors, (37), 19 states have call predecessors, (37), 18 states have call successors, (37) [2024-11-11 16:02:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 162 transitions. [2024-11-11 16:02:29,643 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 162 transitions. Word has length 78 [2024-11-11 16:02:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:02:29,643 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 162 transitions. [2024-11-11 16:02:29,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 9 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-11 16:02:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 162 transitions. [2024-11-11 16:02:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 16:02:29,644 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:02:29,644 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2024-11-11 16:02:29,649 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 (31)] Forceful destruction successful, exit code 0 [2024-11-11 16:02:29,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-11 16:02:29,844 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:02:29,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:02:29,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1678929915, now seen corresponding path program 1 times [2024-11-11 16:02:29,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:02:29,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774668210] [2024-11-11 16:02:29,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:02:29,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:02:29,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:02:29,846 INFO L229 MonitoredProcess]: Starting monitored process 32 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-11 16:02:29,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-11-11 16:02:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:02:29,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-11 16:02:29,933 INFO L279 TraceCheckSpWp]: Computing forward predicates...