./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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.dd.update-z3-fca748b-m [2024-11-19 17:14:14,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 17:14:14,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 17:14:14,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 17:14:14,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 17:14:14,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 17:14:14,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 17:14:14,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 17:14:14,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 17:14:14,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 17:14:14,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 17:14:14,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 17:14:14,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 17:14:14,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 17:14:14,546 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 17:14:14,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 17:14:14,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 17:14:14,548 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 17:14:14,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 17:14:14,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 17:14:14,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 17:14:14,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 17:14:14,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 17:14:14,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 17:14:14,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 17:14:14,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 17:14:14,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 17:14:14,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 17:14:14,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 17:14:14,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 17:14:14,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 17:14:14,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 17:14:14,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:14:14,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 17:14:14,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 17:14:14,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 17:14:14,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 17:14:14,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 17:14:14,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 17:14:14,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 17:14:14,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 17:14:14,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 17:14:14,558 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-19 17:14:14,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 17:14:14,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 17:14:14,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 17:14:14,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 17:14:14,787 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 17:14:14,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-19 17:14:16,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 17:14:16,311 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 17:14:16,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-19 17:14:16,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/960d06601/fe69245dfac9416e91732dd01c5197de/FLAG0b526fe20 [2024-11-19 17:14:16,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/960d06601/fe69245dfac9416e91732dd01c5197de [2024-11-19 17:14:16,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 17:14:16,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 17:14:16,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 17:14:16,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 17:14:16,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 17:14:16,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:14:16" (1/1) ... [2024-11-19 17:14:16,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a010d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:16, skipping insertion in model container [2024-11-19 17:14:16,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:14:16" (1/1) ... [2024-11-19 17:14:16,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 17:14:16,906 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-19 17:14:16,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:14:16,964 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 17:14:16,975 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-19 17:14:16,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:14:17,014 INFO L204 MainTranslator]: Completed translation [2024-11-19 17:14:17,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17 WrapperNode [2024-11-19 17:14:17,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 17:14:17,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 17:14:17,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 17:14:17,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 17:14:17,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (1/1) ... [2024-11-19 17:14:17,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (1/1) ... [2024-11-19 17:14:17,050 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-19 17:14:17,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 17:14:17,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 17:14:17,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 17:14:17,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 17:14:17,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (1/1) ... [2024-11-19 17:14:17,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (1/1) ... [2024-11-19 17:14:17,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (1/1) ... [2024-11-19 17:14:17,084 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-19 17:14:17,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (1/1) ... [2024-11-19 17:14:17,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (1/1) ... [2024-11-19 17:14:17,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (1/1) ... [2024-11-19 17:14:17,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (1/1) ... [2024-11-19 17:14:17,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (1/1) ... [2024-11-19 17:14:17,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (1/1) ... [2024-11-19 17:14:17,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 17:14:17,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 17:14:17,104 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 17:14:17,104 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 17:14:17,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (1/1) ... [2024-11-19 17:14:17,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:14:17,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:17,140 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-19 17:14:17,144 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-19 17:14:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 17:14:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 17:14:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-19 17:14:17,198 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-19 17:14:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 17:14:17,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 17:14:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-19 17:14:17,200 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-19 17:14:17,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 17:14:17,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 17:14:17,289 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 17:14:17,291 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 17:14:17,692 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-19 17:14:17,694 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 17:14:17,711 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 17:14:17,711 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 17:14:17,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:17 BoogieIcfgContainer [2024-11-19 17:14:17,712 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 17:14:17,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 17:14:17,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 17:14:17,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 17:14:17,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:14:16" (1/3) ... [2024-11-19 17:14:17,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d8f682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:14:17, skipping insertion in model container [2024-11-19 17:14:17,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:17" (2/3) ... [2024-11-19 17:14:17,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d8f682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:14:17, skipping insertion in model container [2024-11-19 17:14:17,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:17" (3/3) ... [2024-11-19 17:14:17,723 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2024-11-19 17:14:17,739 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 17:14:17,739 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 17:14:17,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 17:14:17,814 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;@4dbba013, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 17:14:17,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 17:14:17,819 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-19 17:14:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 17:14:17,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:17,828 INFO L215 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-19 17:14:17,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:17,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:17,836 INFO L85 PathProgramCache]: Analyzing trace with hash 548859888, now seen corresponding path program 1 times [2024-11-19 17:14:17,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:17,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785172994] [2024-11-19 17:14:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:18,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:18,475 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-19 17:14:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785172994] [2024-11-19 17:14:18,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785172994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:18,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102390266] [2024-11-19 17:14:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:18,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:18,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:18,484 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-19 17:14:18,486 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-19 17:14:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:18,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 17:14:18,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:18,611 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-19 17:14:18,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:18,801 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-19 17:14:18,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102390266] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:18,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:18,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-19 17:14:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201994261] [2024-11-19 17:14:18,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:18,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 17:14:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:18,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 17:14:18,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-19 17:14:18,868 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-19 17:14:19,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:19,111 INFO L93 Difference]: Finished difference Result 176 states and 270 transitions. [2024-11-19 17:14:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 17:14:19,114 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-19 17:14:19,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:19,124 INFO L225 Difference]: With dead ends: 176 [2024-11-19 17:14:19,124 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 17:14:19,129 INFO L431 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-19 17:14:19,133 INFO L432 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-19 17:14:19,133 INFO L433 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-19 17:14:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 17:14:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2024-11-19 17:14:19,174 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-19 17:14:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 120 transitions. [2024-11-19 17:14:19,178 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 120 transitions. Word has length 35 [2024-11-19 17:14:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:19,179 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 120 transitions. [2024-11-19 17:14:19,179 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-19 17:14:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 120 transitions. [2024-11-19 17:14:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 17:14:19,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:19,182 INFO L215 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-19 17:14:19,191 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-19 17:14:19,382 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-19 17:14:19,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:19,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:19,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1587358369, now seen corresponding path program 1 times [2024-11-19 17:14:19,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:19,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444109372] [2024-11-19 17:14:19,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:19,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:19,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:19,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:19,565 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-19 17:14:19,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:19,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444109372] [2024-11-19 17:14:19,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444109372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:19,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:19,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 17:14:19,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218950398] [2024-11-19 17:14:19,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:19,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 17:14:19,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:19,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 17:14:19,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 17:14:19,568 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-19 17:14:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:19,647 INFO L93 Difference]: Finished difference Result 159 states and 214 transitions. [2024-11-19 17:14:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 17:14:19,648 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-19 17:14:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:19,650 INFO L225 Difference]: With dead ends: 159 [2024-11-19 17:14:19,650 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 17:14:19,651 INFO L431 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-19 17:14:19,652 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:19,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 663 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 17:14:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-11-19 17:14:19,671 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-19 17:14:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2024-11-19 17:14:19,674 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 39 [2024-11-19 17:14:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:19,675 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2024-11-19 17:14:19,675 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-19 17:14:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2024-11-19 17:14:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 17:14:19,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:19,680 INFO L215 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-19 17:14:19,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 17:14:19,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:19,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash -831428749, now seen corresponding path program 1 times [2024-11-19 17:14:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:19,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199907234] [2024-11-19 17:14:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:19,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:19,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:19,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:19,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 17:14:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:19,875 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-19 17:14:19,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:19,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199907234] [2024-11-19 17:14:19,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199907234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:19,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:19,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 17:14:19,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749604839] [2024-11-19 17:14:19,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:19,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 17:14:19,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:19,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 17:14:19,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 17:14:19,878 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-19 17:14:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:19,982 INFO L93 Difference]: Finished difference Result 178 states and 241 transitions. [2024-11-19 17:14:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 17:14:19,984 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-19 17:14:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:19,985 INFO L225 Difference]: With dead ends: 178 [2024-11-19 17:14:19,986 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 17:14:19,988 INFO L431 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-19 17:14:19,989 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 85 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:19,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 781 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 17:14:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2024-11-19 17:14:20,004 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-19 17:14:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2024-11-19 17:14:20,006 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 43 [2024-11-19 17:14:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:20,006 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2024-11-19 17:14:20,007 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-19 17:14:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2024-11-19 17:14:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 17:14:20,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:20,008 INFO L215 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-19 17:14:20,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 17:14:20,008 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:20,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:20,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1224455759, now seen corresponding path program 1 times [2024-11-19 17:14:20,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:20,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940043784] [2024-11-19 17:14:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:20,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:20,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:20,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 17:14:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:20,251 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-19 17:14:20,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940043784] [2024-11-19 17:14:20,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940043784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031288734] [2024-11-19 17:14:20,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:20,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:20,256 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-19 17:14:20,257 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-19 17:14:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:20,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 17:14:20,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:20,353 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-19 17:14:20,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:20,504 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-19 17:14:20,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031288734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:20,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:20,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-19 17:14:20,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806446567] [2024-11-19 17:14:20,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:20,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 17:14:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:20,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 17:14:20,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-19 17:14:20,507 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-19 17:14:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:20,600 INFO L93 Difference]: Finished difference Result 224 states and 304 transitions. [2024-11-19 17:14:20,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 17:14:20,602 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-19 17:14:20,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:20,603 INFO L225 Difference]: With dead ends: 224 [2024-11-19 17:14:20,604 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 17:14:20,604 INFO L431 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-19 17:14:20,608 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:20,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 982 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 17:14:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2024-11-19 17:14:20,627 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-19 17:14:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 188 transitions. [2024-11-19 17:14:20,628 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 188 transitions. Word has length 43 [2024-11-19 17:14:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:20,632 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 188 transitions. [2024-11-19 17:14:20,632 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-19 17:14:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 188 transitions. [2024-11-19 17:14:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 17:14:20,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:20,633 INFO L215 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-19 17:14:20,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 17:14:20,834 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-19 17:14:20,835 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:20,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:20,835 INFO L85 PathProgramCache]: Analyzing trace with hash 651525582, now seen corresponding path program 1 times [2024-11-19 17:14:20,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:20,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392854218] [2024-11-19 17:14:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:20,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 17:14:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 17:14:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,232 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-19 17:14:21,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:21,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392854218] [2024-11-19 17:14:21,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392854218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:21,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:21,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 17:14:21,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328530769] [2024-11-19 17:14:21,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:21,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 17:14:21,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:21,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 17:14:21,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-19 17:14:21,235 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-19 17:14:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:21,462 INFO L93 Difference]: Finished difference Result 203 states and 270 transitions. [2024-11-19 17:14:21,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 17:14:21,463 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-19 17:14:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:21,465 INFO L225 Difference]: With dead ends: 203 [2024-11-19 17:14:21,465 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 17:14:21,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-19 17:14:21,466 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:21,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1479 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 17:14:21,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 17:14:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2024-11-19 17:14:21,479 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-19 17:14:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 194 transitions. [2024-11-19 17:14:21,480 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 194 transitions. Word has length 44 [2024-11-19 17:14:21,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:21,480 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 194 transitions. [2024-11-19 17:14:21,480 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-19 17:14:21,480 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 194 transitions. [2024-11-19 17:14:21,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 17:14:21,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:21,485 INFO L215 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-19 17:14:21,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 17:14:21,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:21,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:21,486 INFO L85 PathProgramCache]: Analyzing trace with hash 35658448, now seen corresponding path program 2 times [2024-11-19 17:14:21,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:21,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22948972] [2024-11-19 17:14:21,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:21,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,642 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-19 17:14:21,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:21,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22948972] [2024-11-19 17:14:21,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22948972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:21,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986569447] [2024-11-19 17:14:21,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:14:21,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:21,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:21,647 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-19 17:14:21,648 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-19 17:14:21,697 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 17:14:21,697 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:14:21,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 17:14:21,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:21,849 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-19 17:14:21,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:21,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986569447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:21,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 17:14:21,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2024-11-19 17:14:21,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379477615] [2024-11-19 17:14:21,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:21,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 17:14:21,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:21,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 17:14:21,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-19 17:14:21,851 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-19 17:14:22,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:22,096 INFO L93 Difference]: Finished difference Result 286 states and 386 transitions. [2024-11-19 17:14:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 17:14:22,096 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-19 17:14:22,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:22,098 INFO L225 Difference]: With dead ends: 286 [2024-11-19 17:14:22,098 INFO L226 Difference]: Without dead ends: 229 [2024-11-19 17:14:22,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-19 17:14:22,100 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:22,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1294 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 17:14:22,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-19 17:14:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 192. [2024-11-19 17:14:22,113 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-19 17:14:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 258 transitions. [2024-11-19 17:14:22,115 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 258 transitions. Word has length 43 [2024-11-19 17:14:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:22,115 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 258 transitions. [2024-11-19 17:14:22,116 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-19 17:14:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 258 transitions. [2024-11-19 17:14:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 17:14:22,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:22,117 INFO L215 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-19 17:14:22,125 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-19 17:14:22,317 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-19 17:14:22,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:22,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash -357368562, now seen corresponding path program 1 times [2024-11-19 17:14:22,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:22,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343756739] [2024-11-19 17:14:22,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:22,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,553 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-19 17:14:22,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:22,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343756739] [2024-11-19 17:14:22,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343756739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:22,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506099456] [2024-11-19 17:14:22,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:22,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:22,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:22,557 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-19 17:14:22,560 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-19 17:14:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 17:14:22,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:22,832 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-19 17:14:22,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:22,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506099456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:22,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 17:14:22,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 17 [2024-11-19 17:14:22,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706162747] [2024-11-19 17:14:22,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:22,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 17:14:22,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:22,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 17:14:22,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-19 17:14:22,834 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-19 17:14:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:23,056 INFO L93 Difference]: Finished difference Result 359 states and 491 transitions. [2024-11-19 17:14:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 17:14:23,059 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-19 17:14:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:23,061 INFO L225 Difference]: With dead ends: 359 [2024-11-19 17:14:23,061 INFO L226 Difference]: Without dead ends: 284 [2024-11-19 17:14:23,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-19 17:14:23,062 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:23,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1576 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 17:14:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-19 17:14:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 266. [2024-11-19 17:14:23,084 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-19 17:14:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 358 transitions. [2024-11-19 17:14:23,086 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 358 transitions. Word has length 43 [2024-11-19 17:14:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:23,086 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 358 transitions. [2024-11-19 17:14:23,087 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-19 17:14:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 358 transitions. [2024-11-19 17:14:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 17:14:23,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:23,088 INFO L215 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-19 17:14:23,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 17:14:23,291 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-19 17:14:23,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:23,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1300765906, now seen corresponding path program 1 times [2024-11-19 17:14:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790643139] [2024-11-19 17:14:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 17:14:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 17:14:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,404 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-19 17:14:23,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:23,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790643139] [2024-11-19 17:14:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790643139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:23,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:23,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 17:14:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646236677] [2024-11-19 17:14:23,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:23,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 17:14:23,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:23,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 17:14:23,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 17:14:23,410 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-19 17:14:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:23,471 INFO L93 Difference]: Finished difference Result 274 states and 365 transitions. [2024-11-19 17:14:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 17:14:23,472 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-19 17:14:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:23,474 INFO L225 Difference]: With dead ends: 274 [2024-11-19 17:14:23,474 INFO L226 Difference]: Without dead ends: 259 [2024-11-19 17:14:23,475 INFO L431 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-19 17:14:23,476 INFO L432 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-19 17:14:23,476 INFO L433 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-19 17:14:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-19 17:14:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-11-19 17:14:23,493 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-19 17:14:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 347 transitions. [2024-11-19 17:14:23,496 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 347 transitions. Word has length 46 [2024-11-19 17:14:23,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:23,496 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 347 transitions. [2024-11-19 17:14:23,496 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-19 17:14:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 347 transitions. [2024-11-19 17:14:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 17:14:23,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:23,498 INFO L215 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-19 17:14:23,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 17:14:23,498 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:23,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:23,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1312921885, now seen corresponding path program 1 times [2024-11-19 17:14:23,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:23,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95297322] [2024-11-19 17:14:23,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:23,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 17:14:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,543 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-19 17:14:23,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:23,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95297322] [2024-11-19 17:14:23,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95297322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:23,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810342512] [2024-11-19 17:14:23,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:23,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:23,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:23,549 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-19 17:14:23,551 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-19 17:14:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 17:14:23,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:23,615 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-19 17:14:23,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:23,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810342512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:23,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 17:14:23,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-19 17:14:23,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380004078] [2024-11-19 17:14:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:23,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:14:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:23,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:14:23,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 17:14:23,617 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-19 17:14:23,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:23,652 INFO L93 Difference]: Finished difference Result 520 states and 701 transitions. [2024-11-19 17:14:23,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:14:23,653 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-19 17:14:23,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:23,654 INFO L225 Difference]: With dead ends: 520 [2024-11-19 17:14:23,654 INFO L226 Difference]: Without dead ends: 264 [2024-11-19 17:14:23,655 INFO L431 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-19 17:14:23,656 INFO L432 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-19 17:14:23,656 INFO L433 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-19 17:14:23,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-19 17:14:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2024-11-19 17:14:23,671 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-19 17:14:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 351 transitions. [2024-11-19 17:14:23,673 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 351 transitions. Word has length 46 [2024-11-19 17:14:23,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:23,673 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 351 transitions. [2024-11-19 17:14:23,673 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-19 17:14:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 351 transitions. [2024-11-19 17:14:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 17:14:23,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:23,675 INFO L215 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-19 17:14:23,683 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-19 17:14:23,875 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-19 17:14:23,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:23,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash -576237536, now seen corresponding path program 1 times [2024-11-19 17:14:23,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:23,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303298082] [2024-11-19 17:14:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:23,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 17:14:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,026 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-19 17:14:24,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:24,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303298082] [2024-11-19 17:14:24,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303298082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:24,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:24,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 17:14:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82242675] [2024-11-19 17:14:24,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:24,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 17:14:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:24,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 17:14:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 17:14:24,028 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-19 17:14:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:24,093 INFO L93 Difference]: Finished difference Result 281 states and 371 transitions. [2024-11-19 17:14:24,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 17:14:24,093 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-19 17:14:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:24,094 INFO L225 Difference]: With dead ends: 281 [2024-11-19 17:14:24,095 INFO L226 Difference]: Without dead ends: 241 [2024-11-19 17:14:24,095 INFO L431 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-19 17:14:24,096 INFO L432 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-19 17:14:24,097 INFO L433 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-19 17:14:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-19 17:14:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2024-11-19 17:14:24,107 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-19 17:14:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 311 transitions. [2024-11-19 17:14:24,108 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 311 transitions. Word has length 47 [2024-11-19 17:14:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:24,109 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 311 transitions. [2024-11-19 17:14:24,109 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-19 17:14:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 311 transitions. [2024-11-19 17:14:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 17:14:24,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:24,110 INFO L215 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-19 17:14:24,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 17:14:24,111 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:24,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:24,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2068784251, now seen corresponding path program 1 times [2024-11-19 17:14:24,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:24,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355399822] [2024-11-19 17:14:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:24,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 17:14:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 17:14:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,322 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-19 17:14:24,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:24,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355399822] [2024-11-19 17:14:24,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355399822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:24,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675117196] [2024-11-19 17:14:24,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:24,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:24,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:24,325 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-19 17:14:24,327 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-19 17:14:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 17:14:24,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:24,563 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-19 17:14:24,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:24,962 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-19 17:14:24,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675117196] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:24,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:24,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-19 17:14:24,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560842500] [2024-11-19 17:14:24,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:24,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 17:14:24,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:24,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 17:14:24,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-19 17:14:24,967 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-19 17:14:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:26,577 INFO L93 Difference]: Finished difference Result 456 states and 636 transitions. [2024-11-19 17:14:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-19 17:14:26,577 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-19 17:14:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:26,579 INFO L225 Difference]: With dead ends: 456 [2024-11-19 17:14:26,580 INFO L226 Difference]: Without dead ends: 431 [2024-11-19 17:14:26,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2024-11-19 17:14:26,582 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 241 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:26,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 4380 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 17:14:26,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-19 17:14:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 286. [2024-11-19 17:14:26,606 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-19 17:14:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 382 transitions. [2024-11-19 17:14:26,609 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 382 transitions. Word has length 48 [2024-11-19 17:14:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:26,609 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 382 transitions. [2024-11-19 17:14:26,609 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-19 17:14:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 382 transitions. [2024-11-19 17:14:26,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 17:14:26,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:26,610 INFO L215 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-19 17:14:26,620 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-19 17:14:26,810 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-19 17:14:26,811 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:26,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:26,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2092939753, now seen corresponding path program 1 times [2024-11-19 17:14:26,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:26,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277726295] [2024-11-19 17:14:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:26,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:26,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:26,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 17:14:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:26,861 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-19 17:14:26,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:26,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277726295] [2024-11-19 17:14:26,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277726295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:26,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947575702] [2024-11-19 17:14:26,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:26,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:26,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:26,865 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-19 17:14:26,866 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-19 17:14:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:26,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 17:14:26,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:26,926 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-19 17:14:26,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:26,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947575702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:26,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 17:14:26,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-19 17:14:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334451731] [2024-11-19 17:14:26,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:26,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:14:26,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:26,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:14:26,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:14:26,929 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-19 17:14:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:26,969 INFO L93 Difference]: Finished difference Result 575 states and 773 transitions. [2024-11-19 17:14:26,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:14:26,970 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-19 17:14:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:26,971 INFO L225 Difference]: With dead ends: 575 [2024-11-19 17:14:26,972 INFO L226 Difference]: Without dead ends: 292 [2024-11-19 17:14:26,972 INFO L431 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-19 17:14:26,973 INFO L432 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-19 17:14:26,974 INFO L433 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-19 17:14:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-19 17:14:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2024-11-19 17:14:26,990 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-19 17:14:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2024-11-19 17:14:26,992 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 47 [2024-11-19 17:14:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:26,992 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2024-11-19 17:14:26,992 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-19 17:14:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2024-11-19 17:14:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 17:14:26,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:26,994 INFO L215 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-19 17:14:27,002 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-19 17:14:27,194 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-19 17:14:27,195 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:27,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1429610563, now seen corresponding path program 2 times [2024-11-19 17:14:27,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:27,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978668663] [2024-11-19 17:14:27,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:27,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:27,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:27,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:27,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:27,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 17:14:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:27,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 17:14:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:27,399 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-19 17:14:27,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978668663] [2024-11-19 17:14:27,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978668663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701172649] [2024-11-19 17:14:27,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:14:27,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:27,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:27,402 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-19 17:14:27,408 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-19 17:14:27,456 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 17:14:27,456 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:14:27,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 17:14:27,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:27,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-19 17:14:27,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:28,037 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-19 17:14:28,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701172649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:28,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:28,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-19 17:14:28,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001532194] [2024-11-19 17:14:28,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:28,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 17:14:28,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:28,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 17:14:28,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-19 17:14:28,041 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-19 17:14:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:29,420 INFO L93 Difference]: Finished difference Result 472 states and 674 transitions. [2024-11-19 17:14:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-19 17:14:29,421 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-19 17:14:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:29,424 INFO L225 Difference]: With dead ends: 472 [2024-11-19 17:14:29,424 INFO L226 Difference]: Without dead ends: 459 [2024-11-19 17:14:29,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=295, Invalid=3245, Unknown=0, NotChecked=0, Total=3540 [2024-11-19 17:14:29,427 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 278 mSDsluCounter, 3492 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:29,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 3697 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 17:14:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-19 17:14:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 301. [2024-11-19 17:14:29,451 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-19 17:14:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 410 transitions. [2024-11-19 17:14:29,453 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 410 transitions. Word has length 48 [2024-11-19 17:14:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:29,453 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 410 transitions. [2024-11-19 17:14:29,454 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-19 17:14:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 410 transitions. [2024-11-19 17:14:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 17:14:29,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:29,455 INFO L215 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-19 17:14:29,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 17:14:29,658 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-19 17:14:29,659 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:29,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash 548709926, now seen corresponding path program 1 times [2024-11-19 17:14:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:29,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768174087] [2024-11-19 17:14:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:29,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 17:14:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:29,851 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-19 17:14:29,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:29,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768174087] [2024-11-19 17:14:29,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768174087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:29,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:29,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 17:14:29,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018939106] [2024-11-19 17:14:29,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:29,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 17:14:29,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:29,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 17:14:29,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 17:14:29,854 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-19 17:14:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:29,955 INFO L93 Difference]: Finished difference Result 476 states and 650 transitions. [2024-11-19 17:14:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 17:14:29,957 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-19 17:14:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:29,958 INFO L225 Difference]: With dead ends: 476 [2024-11-19 17:14:29,958 INFO L226 Difference]: Without dead ends: 312 [2024-11-19 17:14:29,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 17:14:29,959 INFO L432 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-19 17:14:29,960 INFO L433 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-19 17:14:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-19 17:14:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 301. [2024-11-19 17:14:29,975 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-19 17:14:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 408 transitions. [2024-11-19 17:14:29,977 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 408 transitions. Word has length 48 [2024-11-19 17:14:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:29,977 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 408 transitions. [2024-11-19 17:14:29,977 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-19 17:14:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 408 transitions. [2024-11-19 17:14:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 17:14:29,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:29,979 INFO L215 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-19 17:14:29,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 17:14:29,979 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:29,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash 317586600, now seen corresponding path program 1 times [2024-11-19 17:14:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:29,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653891054] [2024-11-19 17:14:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:29,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,099 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-19 17:14:30,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:30,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653891054] [2024-11-19 17:14:30,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653891054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:30,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121720480] [2024-11-19 17:14:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:30,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:30,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:30,102 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-19 17:14:30,104 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-19 17:14:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 17:14:30,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:30,189 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-19 17:14:30,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:30,366 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-19 17:14:30,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121720480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:30,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:30,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2024-11-19 17:14:30,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589686122] [2024-11-19 17:14:30,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:30,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 17:14:30,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:30,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 17:14:30,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-19 17:14:30,368 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-19 17:14:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:30,563 INFO L93 Difference]: Finished difference Result 439 states and 591 transitions. [2024-11-19 17:14:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 17:14:30,564 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-19 17:14:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:30,566 INFO L225 Difference]: With dead ends: 439 [2024-11-19 17:14:30,566 INFO L226 Difference]: Without dead ends: 365 [2024-11-19 17:14:30,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-19 17:14:30,567 INFO L432 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-19 17:14:30,567 INFO L433 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-19 17:14:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-19 17:14:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 345. [2024-11-19 17:14:30,584 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-19 17:14:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 460 transitions. [2024-11-19 17:14:30,586 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 460 transitions. Word has length 48 [2024-11-19 17:14:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:30,587 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 460 transitions. [2024-11-19 17:14:30,587 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-19 17:14:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 460 transitions. [2024-11-19 17:14:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 17:14:30,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:30,588 INFO L215 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-19 17:14:30,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 17:14:30,788 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-19 17:14:30,789 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:30,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash -75440410, now seen corresponding path program 2 times [2024-11-19 17:14:30,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:30,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381239853] [2024-11-19 17:14:30,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,974 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-19 17:14:30,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:30,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381239853] [2024-11-19 17:14:30,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381239853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:30,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537989996] [2024-11-19 17:14:30,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:14:30,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:30,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:30,977 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-19 17:14:30,978 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-19 17:14:31,032 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 17:14:31,032 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:14:31,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 17:14:31,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:31,979 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-19 17:14:31,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:31,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537989996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:31,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 17:14:31,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 21 [2024-11-19 17:14:31,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317299044] [2024-11-19 17:14:31,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:31,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 17:14:31,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:31,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 17:14:31,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2024-11-19 17:14:31,981 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-19 17:14:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:32,503 INFO L93 Difference]: Finished difference Result 480 states and 649 transitions. [2024-11-19 17:14:32,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 17:14:32,504 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-19 17:14:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:32,506 INFO L225 Difference]: With dead ends: 480 [2024-11-19 17:14:32,506 INFO L226 Difference]: Without dead ends: 478 [2024-11-19 17:14:32,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-11-19 17:14:32,507 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 74 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-19 17:14:32,507 INFO L433 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-19 17:14:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-19 17:14:32,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 440. [2024-11-19 17:14:32,536 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-19 17:14:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 589 transitions. [2024-11-19 17:14:32,538 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 589 transitions. Word has length 48 [2024-11-19 17:14:32,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:32,539 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 589 transitions. [2024-11-19 17:14:32,539 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-19 17:14:32,539 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2024-11-19 17:14:32,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 17:14:32,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:32,541 INFO L215 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-19 17:14:32,550 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-19 17:14:32,745 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-19 17:14:32,746 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:32,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2139626181, now seen corresponding path program 1 times [2024-11-19 17:14:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:32,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052195006] [2024-11-19 17:14:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:32,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 17:14:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 17:14:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,867 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-19 17:14:32,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:32,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052195006] [2024-11-19 17:14:32,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052195006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307893280] [2024-11-19 17:14:32,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:32,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:32,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:32,870 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-19 17:14:32,871 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-19 17:14:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 17:14:32,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:33,018 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-19 17:14:33,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:33,260 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-19 17:14:33,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307893280] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:33,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:33,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 21 [2024-11-19 17:14:33,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339891887] [2024-11-19 17:14:33,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:33,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 17:14:33,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:33,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 17:14:33,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-19 17:14:33,262 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-19 17:14:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:33,713 INFO L93 Difference]: Finished difference Result 570 states and 790 transitions. [2024-11-19 17:14:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 17:14:33,714 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-19 17:14:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:33,717 INFO L225 Difference]: With dead ends: 570 [2024-11-19 17:14:33,717 INFO L226 Difference]: Without dead ends: 532 [2024-11-19 17:14:33,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2024-11-19 17:14:33,718 INFO L432 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-19 17:14:33,719 INFO L433 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-19 17:14:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-19 17:14:33,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 445. [2024-11-19 17:14:33,765 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-19 17:14:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 607 transitions. [2024-11-19 17:14:33,768 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 607 transitions. Word has length 50 [2024-11-19 17:14:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:33,769 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 607 transitions. [2024-11-19 17:14:33,769 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-19 17:14:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 607 transitions. [2024-11-19 17:14:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 17:14:33,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:33,771 INFO L215 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-19 17:14:33,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 17:14:33,975 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-19 17:14:33,976 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:33,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:33,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1494153441, now seen corresponding path program 1 times [2024-11-19 17:14:33,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:33,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640629441] [2024-11-19 17:14:33,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:33,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,164 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-19 17:14:34,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:34,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640629441] [2024-11-19 17:14:34,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640629441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:34,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:34,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 17:14:34,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834741362] [2024-11-19 17:14:34,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:34,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 17:14:34,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:34,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 17:14:34,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 17:14:34,166 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-19 17:14:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:34,250 INFO L93 Difference]: Finished difference Result 451 states and 612 transitions. [2024-11-19 17:14:34,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 17:14:34,250 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-19 17:14:34,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:34,252 INFO L225 Difference]: With dead ends: 451 [2024-11-19 17:14:34,252 INFO L226 Difference]: Without dead ends: 449 [2024-11-19 17:14:34,253 INFO L431 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-19 17:14:34,253 INFO L432 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-19 17:14:34,253 INFO L433 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-19 17:14:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-19 17:14:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2024-11-19 17:14:34,284 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-19 17:14:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 610 transitions. [2024-11-19 17:14:34,286 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 610 transitions. Word has length 49 [2024-11-19 17:14:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:34,287 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 610 transitions. [2024-11-19 17:14:34,287 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-19 17:14:34,287 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 610 transitions. [2024-11-19 17:14:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 17:14:34,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:34,303 INFO L215 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-19 17:14:34,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 17:14:34,304 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:34,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:34,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1700071189, now seen corresponding path program 1 times [2024-11-19 17:14:34,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:34,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416585820] [2024-11-19 17:14:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:34,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 17:14:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 17:14:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,547 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-19 17:14:34,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:34,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416585820] [2024-11-19 17:14:34,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416585820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:34,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388357057] [2024-11-19 17:14:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:34,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:34,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:34,550 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-19 17:14:34,552 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-19 17:14:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 17:14:34,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:34,668 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-19 17:14:34,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:34,963 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-19 17:14:34,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388357057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:34,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:34,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-19 17:14:34,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710830366] [2024-11-19 17:14:34,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:34,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 17:14:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:34,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 17:14:34,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2024-11-19 17:14:34,966 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-19 17:14:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:35,560 INFO L93 Difference]: Finished difference Result 535 states and 743 transitions. [2024-11-19 17:14:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 17:14:35,561 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-19 17:14:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:35,563 INFO L225 Difference]: With dead ends: 535 [2024-11-19 17:14:35,563 INFO L226 Difference]: Without dead ends: 503 [2024-11-19 17:14:35,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 17:14:35,566 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 207 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-19 17:14:35,566 INFO L433 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-19 17:14:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-19 17:14:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 438. [2024-11-19 17:14:35,594 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-19 17:14:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 596 transitions. [2024-11-19 17:14:35,596 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 596 transitions. Word has length 55 [2024-11-19 17:14:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:35,596 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 596 transitions. [2024-11-19 17:14:35,597 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-19 17:14:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 596 transitions. [2024-11-19 17:14:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 17:14:35,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:35,598 INFO L215 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-19 17:14:35,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 17:14:35,798 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-19 17:14:35,799 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:35,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:35,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1025276331, now seen corresponding path program 2 times [2024-11-19 17:14:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:35,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345452956] [2024-11-19 17:14:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:35,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:35,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:35,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:35,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 17:14:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 17:14:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:35,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 17:14:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:36,015 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-19 17:14:36,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:36,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345452956] [2024-11-19 17:14:36,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345452956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:36,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013917375] [2024-11-19 17:14:36,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:14:36,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:36,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:36,019 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-19 17:14:36,020 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-19 17:14:36,088 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 17:14:36,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:14:36,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 17:14:36,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:36,215 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-19 17:14:36,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:36,650 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-19 17:14:36,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013917375] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:36,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:36,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2024-11-19 17:14:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686977987] [2024-11-19 17:14:36,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:36,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 17:14:36,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 17:14:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2024-11-19 17:14:36,653 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-19 17:14:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:37,231 INFO L93 Difference]: Finished difference Result 523 states and 731 transitions. [2024-11-19 17:14:37,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 17:14:37,232 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-19 17:14:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:37,235 INFO L225 Difference]: With dead ends: 523 [2024-11-19 17:14:37,235 INFO L226 Difference]: Without dead ends: 493 [2024-11-19 17:14:37,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 17:14:37,239 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 128 mSDsluCounter, 2559 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:37,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2687 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 17:14:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-19 17:14:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 430. [2024-11-19 17:14:37,271 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-19 17:14:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 587 transitions. [2024-11-19 17:14:37,274 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 587 transitions. Word has length 55 [2024-11-19 17:14:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:37,274 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 587 transitions. [2024-11-19 17:14:37,274 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-19 17:14:37,274 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 587 transitions. [2024-11-19 17:14:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 17:14:37,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:37,276 INFO L215 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-19 17:14:37,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 17:14:37,480 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-19 17:14:37,481 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:37,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:37,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1682588005, now seen corresponding path program 1 times [2024-11-19 17:14:37,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:37,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72644686] [2024-11-19 17:14:37,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:37,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:37,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 17:14:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:37,562 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-19 17:14:37,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:37,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72644686] [2024-11-19 17:14:37,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72644686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:37,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:37,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 17:14:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107074654] [2024-11-19 17:14:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:37,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 17:14:37,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:37,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 17:14:37,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 17:14:37,565 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-19 17:14:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:37,642 INFO L93 Difference]: Finished difference Result 485 states and 670 transitions. [2024-11-19 17:14:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 17:14:37,643 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-19 17:14:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:37,646 INFO L225 Difference]: With dead ends: 485 [2024-11-19 17:14:37,646 INFO L226 Difference]: Without dead ends: 483 [2024-11-19 17:14:37,646 INFO L431 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-19 17:14:37,647 INFO L432 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-19 17:14:37,647 INFO L433 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-19 17:14:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-19 17:14:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 455. [2024-11-19 17:14:37,680 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-19 17:14:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 632 transitions. [2024-11-19 17:14:37,683 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 632 transitions. Word has length 57 [2024-11-19 17:14:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:37,684 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 632 transitions. [2024-11-19 17:14:37,684 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-19 17:14:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 632 transitions. [2024-11-19 17:14:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 17:14:37,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:37,685 INFO L215 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-19 17:14:37,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 17:14:37,686 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:37,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash 712762254, now seen corresponding path program 1 times [2024-11-19 17:14:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:37,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680113479] [2024-11-19 17:14:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:37,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:37,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:37,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:37,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:37,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 17:14:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:37,871 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-19 17:14:37,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:37,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680113479] [2024-11-19 17:14:37,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680113479] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:37,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577524561] [2024-11-19 17:14:37,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:37,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:37,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:37,875 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-19 17:14:37,877 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-19 17:14:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:37,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 17:14:37,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:37,993 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-19 17:14:37,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:37,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577524561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:37,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 17:14:37,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-11-19 17:14:37,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887852341] [2024-11-19 17:14:37,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:37,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 17:14:37,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:37,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 17:14:37,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-19 17:14:37,994 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-19 17:14:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:38,092 INFO L93 Difference]: Finished difference Result 809 states and 1123 transitions. [2024-11-19 17:14:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 17:14:38,092 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-19 17:14:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:38,096 INFO L225 Difference]: With dead ends: 809 [2024-11-19 17:14:38,096 INFO L226 Difference]: Without dead ends: 632 [2024-11-19 17:14:38,098 INFO L431 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-19 17:14:38,098 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:38,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 456 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-19 17:14:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 462. [2024-11-19 17:14:38,134 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-19 17:14:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 639 transitions. [2024-11-19 17:14:38,137 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 639 transitions. Word has length 58 [2024-11-19 17:14:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:38,137 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 639 transitions. [2024-11-19 17:14:38,137 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-19 17:14:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 639 transitions. [2024-11-19 17:14:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 17:14:38,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:38,139 INFO L215 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-19 17:14:38,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-19 17:14:38,339 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-19 17:14:38,340 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:38,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash 377725904, now seen corresponding path program 1 times [2024-11-19 17:14:38,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:38,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656585363] [2024-11-19 17:14:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:38,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:38,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 17:14:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:38,462 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-19 17:14:38,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:38,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656585363] [2024-11-19 17:14:38,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656585363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:38,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:38,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 17:14:38,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427994886] [2024-11-19 17:14:38,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:38,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 17:14:38,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 17:14:38,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 17:14:38,464 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-19 17:14:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:38,556 INFO L93 Difference]: Finished difference Result 510 states and 708 transitions. [2024-11-19 17:14:38,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 17:14:38,557 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-19 17:14:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:38,559 INFO L225 Difference]: With dead ends: 510 [2024-11-19 17:14:38,560 INFO L226 Difference]: Without dead ends: 508 [2024-11-19 17:14:38,560 INFO L431 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-19 17:14:38,561 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:38,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 473 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-19 17:14:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 462. [2024-11-19 17:14:38,594 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-19 17:14:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 639 transitions. [2024-11-19 17:14:38,597 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 639 transitions. Word has length 59 [2024-11-19 17:14:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:38,597 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 639 transitions. [2024-11-19 17:14:38,597 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-19 17:14:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 639 transitions. [2024-11-19 17:14:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 17:14:38,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:38,599 INFO L215 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-19 17:14:38,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 17:14:38,599 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:38,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2040063704, now seen corresponding path program 1 times [2024-11-19 17:14:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:38,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629070227] [2024-11-19 17:14:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:38,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:38,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:38,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:38,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 17:14:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:38,759 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-19 17:14:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:38,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629070227] [2024-11-19 17:14:38,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629070227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:38,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985940397] [2024-11-19 17:14:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:38,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:38,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:38,764 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-19 17:14:38,765 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-19 17:14:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:38,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 17:14:38,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:38,908 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-19 17:14:38,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985940397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 17:14:38,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 14 [2024-11-19 17:14:38,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709533119] [2024-11-19 17:14:38,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:38,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 17:14:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:38,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 17:14:38,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-19 17:14:38,911 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-19 17:14:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:39,064 INFO L93 Difference]: Finished difference Result 580 states and 795 transitions. [2024-11-19 17:14:39,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 17:14:39,065 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-19 17:14:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:39,067 INFO L225 Difference]: With dead ends: 580 [2024-11-19 17:14:39,067 INFO L226 Difference]: Without dead ends: 478 [2024-11-19 17:14:39,068 INFO L431 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-19 17:14:39,069 INFO L432 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-19 17:14:39,070 INFO L433 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-19 17:14:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-19 17:14:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 462. [2024-11-19 17:14:39,100 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-19 17:14:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 637 transitions. [2024-11-19 17:14:39,102 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 637 transitions. Word has length 59 [2024-11-19 17:14:39,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:39,102 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 637 transitions. [2024-11-19 17:14:39,103 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-19 17:14:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 637 transitions. [2024-11-19 17:14:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 17:14:39,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:39,104 INFO L215 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-19 17:14:39,113 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-19 17:14:39,308 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-19 17:14:39,309 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:39,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:39,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1200934901, now seen corresponding path program 1 times [2024-11-19 17:14:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:39,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939414434] [2024-11-19 17:14:39,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:39,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 17:14:39,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 17:14:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 17:14:39,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 17:14:39,379 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 17:14:39,380 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 17:14:39,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 17:14:39,386 INFO L407 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-19 17:14:39,430 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 17:14:39,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:14:39 BoogieIcfgContainer [2024-11-19 17:14:39,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 17:14:39,434 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 17:14:39,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 17:14:39,434 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 17:14:39,434 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:17" (3/4) ... [2024-11-19 17:14:39,437 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 17:14:39,438 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 17:14:39,438 INFO L158 Benchmark]: Toolchain (without parser) took 22730.15ms. Allocated memory was 142.6MB in the beginning and 270.5MB in the end (delta: 127.9MB). Free memory was 75.1MB in the beginning and 174.0MB in the end (delta: -98.9MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-11-19 17:14:39,438 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 142.6MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 17:14:39,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.45ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 59.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 17:14:39,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.27ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 57.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 17:14:39,439 INFO L158 Benchmark]: Boogie Preprocessor took 51.84ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 55.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 17:14:39,440 INFO L158 Benchmark]: RCFGBuilder took 608.84ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 55.8MB in the beginning and 151.1MB in the end (delta: -95.3MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-11-19 17:14:39,441 INFO L158 Benchmark]: TraceAbstraction took 21718.78ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 150.0MB in the beginning and 174.0MB in the end (delta: -24.0MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2024-11-19 17:14:39,441 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 270.5MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 17:14:39,442 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.08ms. Allocated memory is still 142.6MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.45ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 59.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.27ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 57.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.84ms. Allocated memory is still 142.6MB. Free memory was 57.9MB in the beginning and 55.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 608.84ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 55.8MB in the beginning and 151.1MB in the end (delta: -95.3MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21718.78ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 150.0MB in the beginning and 174.0MB in the end (delta: -24.0MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 270.5MB. Free memory is still 174.0MB. 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: 21.6s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1942 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1804 mSDsluCounter, 30031 SdHoareTripleChecker+Invalid, 3.3s 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, 6.0s 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.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 1008 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.5s 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-19 17:14:39,462 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/current/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 /storage/repos/ultimate/releaseScripts/default/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.dd.update-z3-fca748b-m [2024-11-19 17:14:41,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 17:14:41,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 17:14:41,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 17:14:41,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 17:14:41,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 17:14:41,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 17:14:41,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 17:14:41,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 17:14:41,789 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 17:14:41,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 17:14:41,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 17:14:41,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 17:14:41,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 17:14:41,791 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 17:14:41,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 17:14:41,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 17:14:41,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 17:14:41,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 17:14:41,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 17:14:41,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 17:14:41,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 17:14:41,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 17:14:41,799 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 17:14:41,799 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 17:14:41,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 17:14:41,800 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 17:14:41,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 17:14:41,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 17:14:41,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 17:14:41,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 17:14:41,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 17:14:41,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 17:14:41,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 17:14:41,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:14:41,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 17:14:41,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 17:14:41,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 17:14:41,805 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 17:14:41,805 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 17:14:41,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 17:14:41,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 17:14:41,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 17:14:41,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 17:14:41,806 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-19 17:14:42,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 17:14:42,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 17:14:42,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 17:14:42,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 17:14:42,161 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 17:14:42,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-19 17:14:43,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 17:14:43,894 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 17:14:43,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-11-19 17:14:43,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d931a1202/82d2d46edbfc42109e8d798b45aac59f/FLAG2d328bf4e [2024-11-19 17:14:43,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d931a1202/82d2d46edbfc42109e8d798b45aac59f [2024-11-19 17:14:43,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 17:14:43,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 17:14:43,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 17:14:43,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 17:14:43,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 17:14:43,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:14:43" (1/1) ... [2024-11-19 17:14:43,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0b7e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:43, skipping insertion in model container [2024-11-19 17:14:43,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:14:43" (1/1) ... [2024-11-19 17:14:43,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 17:14:44,147 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-19 17:14:44,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:14:44,225 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 17:14:44,247 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-19 17:14:44,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:14:44,305 INFO L204 MainTranslator]: Completed translation [2024-11-19 17:14:44,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44 WrapperNode [2024-11-19 17:14:44,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 17:14:44,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 17:14:44,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 17:14:44,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 17:14:44,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,340 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-19 17:14:44,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 17:14:44,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 17:14:44,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 17:14:44,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 17:14:44,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,378 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-19 17:14:44,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 17:14:44,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 17:14:44,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 17:14:44,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 17:14:44,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:14:44,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:44,438 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-19 17:14:44,444 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-19 17:14:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 17:14:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 17:14:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-19 17:14:44,486 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-19 17:14:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 17:14:44,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 17:14:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-19 17:14:44,487 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-19 17:14:44,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 17:14:44,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 17:14:44,567 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 17:14:44,568 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 17:14:44,828 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-19 17:14:44,828 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 17:14:44,843 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 17:14:44,844 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 17:14:44,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:44 BoogieIcfgContainer [2024-11-19 17:14:44,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 17:14:44,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 17:14:44,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 17:14:44,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 17:14:44,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:14:43" (1/3) ... [2024-11-19 17:14:44,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fab3bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:14:44, skipping insertion in model container [2024-11-19 17:14:44,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (2/3) ... [2024-11-19 17:14:44,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fab3bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:14:44, skipping insertion in model container [2024-11-19 17:14:44,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:44" (3/3) ... [2024-11-19 17:14:44,852 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2024-11-19 17:14:44,869 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 17:14:44,869 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 17:14:44,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 17:14:44,948 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;@3310ca7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 17:14:44,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 17:14:44,953 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-19 17:14:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 17:14:44,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:44,962 INFO L215 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-19 17:14:44,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:44,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:44,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2030319843, now seen corresponding path program 1 times [2024-11-19 17:14:44,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:44,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700231886] [2024-11-19 17:14:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:44,981 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-19 17:14:44,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:44,985 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-19 17:14:44,986 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-19 17:14:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:45,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 17:14:45,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:45,239 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-19 17:14:45,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:45,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:45,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700231886] [2024-11-19 17:14:45,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700231886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:45,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:45,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 17:14:45,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736726777] [2024-11-19 17:14:45,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:45,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 17:14:45,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:45,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 17:14:45,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 17:14:45,275 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-19 17:14:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:45,407 INFO L93 Difference]: Finished difference Result 125 states and 189 transitions. [2024-11-19 17:14:45,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 17:14:45,409 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-19 17:14:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:45,416 INFO L225 Difference]: With dead ends: 125 [2024-11-19 17:14:45,416 INFO L226 Difference]: Without dead ends: 68 [2024-11-19 17:14:45,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 17:14:45,422 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 14 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-19 17:14:45,423 INFO L433 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-19 17:14:45,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-19 17:14:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2024-11-19 17:14:45,456 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-19 17:14:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2024-11-19 17:14:45,459 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 31 [2024-11-19 17:14:45,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:45,460 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2024-11-19 17:14:45,460 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-19 17:14:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-11-19 17:14:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 17:14:45,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:45,463 INFO L215 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-19 17:14:45,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 17:14:45,663 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-19 17:14:45,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:45,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:45,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1468368814, now seen corresponding path program 1 times [2024-11-19 17:14:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:45,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833519883] [2024-11-19 17:14:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:45,666 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-19 17:14:45,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:45,669 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-19 17:14:45,673 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-19 17:14:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:45,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 17:14:45,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:45,843 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-19 17:14:45,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:45,919 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-19 17:14:45,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:45,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833519883] [2024-11-19 17:14:45,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833519883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:45,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 17:14:45,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-19 17:14:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935920058] [2024-11-19 17:14:45,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:45,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 17:14:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:45,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 17:14:45,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 17:14:45,924 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-19 17:14:46,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:46,053 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2024-11-19 17:14:46,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 17:14:46,054 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-19 17:14:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:46,056 INFO L225 Difference]: With dead ends: 115 [2024-11-19 17:14:46,056 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 17:14:46,057 INFO L431 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-19 17:14:46,058 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:46,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 477 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 17:14:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2024-11-19 17:14:46,071 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-19 17:14:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2024-11-19 17:14:46,073 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 35 [2024-11-19 17:14:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:46,074 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2024-11-19 17:14:46,074 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-19 17:14:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2024-11-19 17:14:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 17:14:46,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:46,076 INFO L215 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-19 17:14:46,079 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-19 17:14:46,278 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-19 17:14:46,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:46,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:46,279 INFO L85 PathProgramCache]: Analyzing trace with hash -686479404, now seen corresponding path program 1 times [2024-11-19 17:14:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:46,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407478100] [2024-11-19 17:14:46,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:46,280 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-19 17:14:46,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:46,283 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-19 17:14:46,285 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-19 17:14:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:46,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 17:14:46,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:46,426 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-19 17:14:46,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:46,485 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-19 17:14:46,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:46,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407478100] [2024-11-19 17:14:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407478100] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:46,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 17:14:46,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-19 17:14:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442006023] [2024-11-19 17:14:46,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:46,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 17:14:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:46,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 17:14:46,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 17:14:46,491 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-19 17:14:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:46,563 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2024-11-19 17:14:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 17:14:46,563 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-19 17:14:46,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:46,565 INFO L225 Difference]: With dead ends: 110 [2024-11-19 17:14:46,565 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 17:14:46,565 INFO L431 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-19 17:14:46,566 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:46,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 446 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 17:14:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-19 17:14:46,578 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-19 17:14:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-11-19 17:14:46,583 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 39 [2024-11-19 17:14:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:46,584 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-11-19 17:14:46,584 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-19 17:14:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-11-19 17:14:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 17:14:46,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:46,587 INFO L215 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-19 17:14:46,590 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-19 17:14:46,787 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-19 17:14:46,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:46,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:46,788 INFO L85 PathProgramCache]: Analyzing trace with hash 461161469, now seen corresponding path program 2 times [2024-11-19 17:14:46,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:46,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479446863] [2024-11-19 17:14:46,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:14:46,789 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-19 17:14:46,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:46,792 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-19 17:14:46,793 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-19 17:14:46,848 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 17:14:46,848 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:14:46,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 17:14:46,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:46,974 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-19 17:14:46,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:46,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:46,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479446863] [2024-11-19 17:14:46,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479446863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:46,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:46,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 17:14:46,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619161075] [2024-11-19 17:14:46,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:46,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 17:14:46,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:46,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 17:14:46,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 17:14:46,977 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-19 17:14:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:47,072 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2024-11-19 17:14:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 17:14:47,072 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-19 17:14:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:47,073 INFO L225 Difference]: With dead ends: 91 [2024-11-19 17:14:47,073 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 17:14:47,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 17:14:47,075 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:47,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 309 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 17:14:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-19 17:14:47,090 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-19 17:14:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2024-11-19 17:14:47,091 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 39 [2024-11-19 17:14:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:47,094 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2024-11-19 17:14:47,094 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-19 17:14:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2024-11-19 17:14:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 17:14:47,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:47,100 INFO L215 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-19 17:14:47,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 17:14:47,300 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-19 17:14:47,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:47,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:47,301 INFO L85 PathProgramCache]: Analyzing trace with hash 518419771, now seen corresponding path program 1 times [2024-11-19 17:14:47,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:47,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171612059] [2024-11-19 17:14:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:47,302 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-19 17:14:47,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:47,304 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-19 17:14:47,306 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-19 17:14:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:47,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 17:14:47,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:47,442 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-19 17:14:47,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:47,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:47,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171612059] [2024-11-19 17:14:47,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171612059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:47,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:47,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 17:14:47,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476706985] [2024-11-19 17:14:47,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:47,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 17:14:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:47,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 17:14:47,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 17:14:47,445 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-19 17:14:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:47,527 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2024-11-19 17:14:47,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 17:14:47,528 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-19 17:14:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:47,531 INFO L225 Difference]: With dead ends: 93 [2024-11-19 17:14:47,531 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 17:14:47,532 INFO L431 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-19 17:14:47,533 INFO L432 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-19 17:14:47,533 INFO L433 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-19 17:14:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 17:14:47,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-11-19 17:14:47,545 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-19 17:14:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2024-11-19 17:14:47,546 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 39 [2024-11-19 17:14:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:47,547 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2024-11-19 17:14:47,547 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-19 17:14:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2024-11-19 17:14:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 17:14:47,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:47,549 INFO L215 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-19 17:14:47,553 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-19 17:14:47,751 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-19 17:14:47,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:47,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:47,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1162622522, now seen corresponding path program 1 times [2024-11-19 17:14:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:47,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215318435] [2024-11-19 17:14:47,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:47,753 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-19 17:14:47,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:47,755 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-19 17:14:47,755 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-19 17:14:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:47,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 17:14:47,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:47,913 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-19 17:14:47,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:47,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:47,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215318435] [2024-11-19 17:14:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215318435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:47,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:47,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 17:14:47,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200735421] [2024-11-19 17:14:47,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:47,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 17:14:47,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:47,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 17:14:47,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 17:14:47,917 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-19 17:14:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:48,145 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2024-11-19 17:14:48,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 17:14:48,146 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-19 17:14:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:48,148 INFO L225 Difference]: With dead ends: 124 [2024-11-19 17:14:48,150 INFO L226 Difference]: Without dead ends: 117 [2024-11-19 17:14:48,150 INFO L431 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-19 17:14:48,151 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:48,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 652 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 17:14:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-19 17:14:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2024-11-19 17:14:48,168 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-19 17:14:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2024-11-19 17:14:48,169 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 44 [2024-11-19 17:14:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:48,170 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2024-11-19 17:14:48,170 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-19 17:14:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2024-11-19 17:14:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 17:14:48,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:48,172 INFO L215 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-19 17:14:48,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-19 17:14:48,372 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-19 17:14:48,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:48,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:48,373 INFO L85 PathProgramCache]: Analyzing trace with hash -977013140, now seen corresponding path program 1 times [2024-11-19 17:14:48,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:48,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899359993] [2024-11-19 17:14:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:48,374 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-19 17:14:48,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:48,377 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-19 17:14:48,378 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-19 17:14:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:48,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 17:14:48,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:48,544 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-19 17:14:48,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:48,683 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-19 17:14:48,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899359993] [2024-11-19 17:14:48,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899359993] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:48,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 17:14:48,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2024-11-19 17:14:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969009386] [2024-11-19 17:14:48,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:48,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 17:14:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:48,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 17:14:48,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-19 17:14:48,685 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-19 17:14:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:48,904 INFO L93 Difference]: Finished difference Result 131 states and 169 transitions. [2024-11-19 17:14:48,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 17:14:48,904 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-19 17:14:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:48,906 INFO L225 Difference]: With dead ends: 131 [2024-11-19 17:14:48,906 INFO L226 Difference]: Without dead ends: 123 [2024-11-19 17:14:48,906 INFO L431 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-19 17:14:48,907 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:48,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 665 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 17:14:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-19 17:14:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2024-11-19 17:14:48,928 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-19 17:14:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 142 transitions. [2024-11-19 17:14:48,930 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 142 transitions. Word has length 46 [2024-11-19 17:14:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:48,930 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 142 transitions. [2024-11-19 17:14:48,931 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-19 17:14:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 142 transitions. [2024-11-19 17:14:48,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 17:14:48,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:48,932 INFO L215 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-19 17:14:48,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 17:14:49,133 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-19 17:14:49,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:49,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash -919754838, now seen corresponding path program 1 times [2024-11-19 17:14:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:49,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202290260] [2024-11-19 17:14:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:49,135 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-19 17:14:49,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:49,137 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-19 17:14:49,138 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-19 17:14:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:49,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 17:14:49,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:49,219 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-19 17:14:49,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:49,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:49,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202290260] [2024-11-19 17:14:49,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202290260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:49,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:49,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 17:14:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506231881] [2024-11-19 17:14:49,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:49,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 17:14:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:49,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 17:14:49,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 17:14:49,226 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-19 17:14:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:49,265 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2024-11-19 17:14:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 17:14:49,266 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-19 17:14:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:49,267 INFO L225 Difference]: With dead ends: 119 [2024-11-19 17:14:49,267 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 17:14:49,268 INFO L431 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-19 17:14:49,269 INFO L432 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-19 17:14:49,270 INFO L433 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-19 17:14:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 17:14:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-19 17:14:49,289 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-19 17:14:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2024-11-19 17:14:49,290 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 46 [2024-11-19 17:14:49,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:49,291 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2024-11-19 17:14:49,291 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-19 17:14:49,291 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2024-11-19 17:14:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 17:14:49,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:49,292 INFO L215 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-19 17:14:49,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 17:14:49,492 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-19 17:14:49,493 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:49,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash -168643793, now seen corresponding path program 1 times [2024-11-19 17:14:49,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:49,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515295552] [2024-11-19 17:14:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:49,494 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-19 17:14:49,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:49,496 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-19 17:14:49,497 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-19 17:14:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:49,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 17:14:49,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:49,682 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-19 17:14:49,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:50,077 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-19 17:14:50,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:50,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515295552] [2024-11-19 17:14:50,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515295552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:50,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 17:14:50,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-19 17:14:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174005457] [2024-11-19 17:14:50,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:50,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 17:14:50,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:50,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 17:14:50,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2024-11-19 17:14:50,081 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-19 17:14:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:51,137 INFO L93 Difference]: Finished difference Result 146 states and 202 transitions. [2024-11-19 17:14:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 17:14:51,138 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-19 17:14:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:51,139 INFO L225 Difference]: With dead ends: 146 [2024-11-19 17:14:51,139 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 17:14:51,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=1404, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 17:14:51,141 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 70 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:51,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1102 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 17:14:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 17:14:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 86. [2024-11-19 17:14:51,159 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-19 17:14:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2024-11-19 17:14:51,160 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 48 [2024-11-19 17:14:51,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:51,160 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2024-11-19 17:14:51,160 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-19 17:14:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2024-11-19 17:14:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 17:14:51,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:51,161 INFO L215 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-19 17:14:51,166 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 (10)] Ended with exit code 0 [2024-11-19 17:14:51,361 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-19 17:14:51,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:51,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash 291178745, now seen corresponding path program 2 times [2024-11-19 17:14:51,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:51,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132703031] [2024-11-19 17:14:51,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:14:51,363 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-19 17:14:51,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:51,364 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-19 17:14:51,365 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-19 17:14:51,420 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 17:14:51,421 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:14:51,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 17:14:51,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:51,564 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-19 17:14:51,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:51,908 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-19 17:14:51,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:51,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132703031] [2024-11-19 17:14:51,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132703031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:51,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 17:14:51,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-19 17:14:51,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793236725] [2024-11-19 17:14:51,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:51,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 17:14:51,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:51,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 17:14:51,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2024-11-19 17:14:51,910 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-19 17:14:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:52,756 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2024-11-19 17:14:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 17:14:52,756 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-19 17:14:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:52,758 INFO L225 Difference]: With dead ends: 119 [2024-11-19 17:14:52,758 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 17:14:52,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 17:14:52,759 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 81 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:52,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1207 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 17:14:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 17:14:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2024-11-19 17:14:52,778 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-19 17:14:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2024-11-19 17:14:52,779 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 48 [2024-11-19 17:14:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:52,779 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2024-11-19 17:14:52,780 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-19 17:14:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2024-11-19 17:14:52,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 17:14:52,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:52,781 INFO L215 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-19 17:14:52,785 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 (11)] Ended with exit code 0 [2024-11-19 17:14:52,982 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-19 17:14:52,982 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:52,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash -744862915, now seen corresponding path program 1 times [2024-11-19 17:14:52,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:52,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348043993] [2024-11-19 17:14:52,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:52,983 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-19 17:14:52,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:52,985 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-19 17:14:52,987 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-19 17:14:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:53,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 17:14:53,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:53,210 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-19 17:14:53,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:53,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:53,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348043993] [2024-11-19 17:14:53,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348043993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:53,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:53,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 17:14:53,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489659313] [2024-11-19 17:14:53,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:53,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 17:14:53,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:53,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 17:14:53,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 17:14:53,213 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-19 17:14:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:53,359 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2024-11-19 17:14:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 17:14:53,360 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-19 17:14:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:53,361 INFO L225 Difference]: With dead ends: 102 [2024-11-19 17:14:53,361 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 17:14:53,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 17:14:53,362 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 10 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:53,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 356 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 17:14:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-11-19 17:14:53,377 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-19 17:14:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2024-11-19 17:14:53,378 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 49 [2024-11-19 17:14:53,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:53,378 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2024-11-19 17:14:53,379 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-19 17:14:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2024-11-19 17:14:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 17:14:53,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:53,380 INFO L215 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-19 17:14:53,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 17:14:53,582 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-19 17:14:53,583 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:53,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:53,583 INFO L85 PathProgramCache]: Analyzing trace with hash -325172767, now seen corresponding path program 1 times [2024-11-19 17:14:53,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:53,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927870645] [2024-11-19 17:14:53,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:53,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 17:14:53,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:53,585 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-19 17:14:53,586 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-19 17:14:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:53,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 17:14:53,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:53,715 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-19 17:14:53,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:53,897 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-19 17:14:53,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:53,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927870645] [2024-11-19 17:14:53,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927870645] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:53,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 17:14:53,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-19 17:14:53,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841007222] [2024-11-19 17:14:53,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:53,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 17:14:53,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:53,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 17:14:53,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-19 17:14:53,899 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-19 17:14:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:54,140 INFO L93 Difference]: Finished difference Result 125 states and 172 transitions. [2024-11-19 17:14:54,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 17:14:54,141 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-19 17:14:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:54,142 INFO L225 Difference]: With dead ends: 125 [2024-11-19 17:14:54,142 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 17:14:54,142 INFO L431 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-19 17:14:54,143 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:54,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 714 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 17:14:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 17:14:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2024-11-19 17:14:54,165 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-19 17:14:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2024-11-19 17:14:54,166 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 50 [2024-11-19 17:14:54,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:54,167 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2024-11-19 17:14:54,167 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-19 17:14:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2024-11-19 17:14:54,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 17:14:54,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:54,168 INFO L215 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-19 17:14:54,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-19 17:14:54,368 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-19 17:14:54,369 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:54,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:54,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1583051783, now seen corresponding path program 1 times [2024-11-19 17:14:54,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:54,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122371822] [2024-11-19 17:14:54,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:54,370 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-19 17:14:54,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:54,371 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-19 17:14:54,372 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-19 17:14:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:54,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 17:14:54,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:54,482 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-19 17:14:54,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:54,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:54,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122371822] [2024-11-19 17:14:54,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122371822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:54,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:54,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 17:14:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531181110] [2024-11-19 17:14:54,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:54,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 17:14:54,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:54,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 17:14:54,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 17:14:54,485 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-19 17:14:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:54,572 INFO L93 Difference]: Finished difference Result 156 states and 196 transitions. [2024-11-19 17:14:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 17:14:54,572 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-19 17:14:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:54,574 INFO L225 Difference]: With dead ends: 156 [2024-11-19 17:14:54,574 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 17:14:54,575 INFO L431 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-19 17:14:54,575 INFO L432 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-19 17:14:54,575 INFO L433 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-19 17:14:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 17:14:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-19 17:14:54,588 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-19 17:14:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2024-11-19 17:14:54,589 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 54 [2024-11-19 17:14:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:54,589 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2024-11-19 17:14:54,589 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-19 17:14:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2024-11-19 17:14:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 17:14:54,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:54,590 INFO L215 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-19 17:14:54,594 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-19 17:14:54,793 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-19 17:14:54,794 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:54,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:54,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1846975685, now seen corresponding path program 1 times [2024-11-19 17:14:54,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:54,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265800612] [2024-11-19 17:14:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:54,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-19 17:14:54,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:54,796 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-19 17:14:54,797 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-19 17:14:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:54,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 17:14:54,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:58,675 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-19 17:14:58,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:58,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:58,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265800612] [2024-11-19 17:14:58,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265800612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:58,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:58,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 17:14:58,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295842274] [2024-11-19 17:14:58,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:58,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 17:14:58,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:58,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 17:14:58,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=38, Unknown=2, NotChecked=0, Total=56 [2024-11-19 17:14:58,677 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-19 17:15:00,952 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-19 17:15:02,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 17:15:06,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 17:15:10,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 17:15:14,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 17:15:18,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 17:15:22,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 17:15:26,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 17:15:30,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 17:15:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:31,423 INFO L93 Difference]: Finished difference Result 98 states and 133 transitions. [2024-11-19 17:15:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 17:15:31,423 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-19 17:15:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:31,424 INFO L225 Difference]: With dead ends: 98 [2024-11-19 17:15:31,425 INFO L226 Difference]: Without dead ends: 94 [2024-11-19 17:15:31,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=20, Invalid=50, Unknown=2, NotChecked=0, Total=72 [2024-11-19 17:15:31,425 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 8 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:31,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 304 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 9 Unknown, 0 Unchecked, 32.7s Time] [2024-11-19 17:15:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-19 17:15:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2024-11-19 17:15:31,434 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-19 17:15:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-11-19 17:15:31,435 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 50 [2024-11-19 17:15:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:31,436 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-11-19 17:15:31,436 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-19 17:15:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-11-19 17:15:31,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 17:15:31,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:31,438 INFO L215 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-19 17:15:31,443 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-19 17:15:31,641 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-19 17:15:31,642 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:31,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:31,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1592416888, now seen corresponding path program 1 times [2024-11-19 17:15:31,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:15:31,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199099169] [2024-11-19 17:15:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:31,643 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-19 17:15:31,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:15:31,644 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-19 17:15:31,645 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-19 17:15:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:31,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 17:15:31,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:15:31,887 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-19 17:15:31,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:15:32,290 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-19 17:15:32,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:15:32,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199099169] [2024-11-19 17:15:32,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199099169] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:15:32,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 17:15:32,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-19 17:15:32,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878303153] [2024-11-19 17:15:32,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 17:15:32,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 17:15:32,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:15:32,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 17:15:32,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 17:15:32,293 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-19 17:15:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:32,793 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2024-11-19 17:15:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 17:15:32,793 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-19 17:15:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:32,794 INFO L225 Difference]: With dead ends: 111 [2024-11-19 17:15:32,794 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 17:15:32,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-19 17:15:32,795 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:32,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 433 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 17:15:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 17:15:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-11-19 17:15:32,807 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-19 17:15:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2024-11-19 17:15:32,808 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 54 [2024-11-19 17:15:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:32,809 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2024-11-19 17:15:32,810 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-19 17:15:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2024-11-19 17:15:32,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 17:15:32,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:32,817 INFO L215 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-19 17:15:32,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-19 17:15:33,019 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-19 17:15:33,019 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:33,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:33,020 INFO L85 PathProgramCache]: Analyzing trace with hash -177633806, now seen corresponding path program 1 times [2024-11-19 17:15:33,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:15:33,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636338733] [2024-11-19 17:15:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:33,020 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-19 17:15:33,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:15:33,021 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-19 17:15:33,022 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-19 17:15:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:33,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 17:15:33,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:15:33,254 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-19 17:15:33,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:15:33,545 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-19 17:15:33,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:15:33,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636338733] [2024-11-19 17:15:33,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636338733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:15:33,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 17:15:33,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-19 17:15:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025569988] [2024-11-19 17:15:33,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 17:15:33,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 17:15:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:15:33,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 17:15:33,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 17:15:33,547 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-19 17:15:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:33,971 INFO L93 Difference]: Finished difference Result 111 states and 161 transitions. [2024-11-19 17:15:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 17:15:33,972 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-19 17:15:33,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:33,973 INFO L225 Difference]: With dead ends: 111 [2024-11-19 17:15:33,973 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 17:15:33,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-19 17:15:33,974 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 21 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:33,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 540 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 17:15:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 17:15:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-11-19 17:15:33,983 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-19 17:15:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2024-11-19 17:15:33,983 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 63 [2024-11-19 17:15:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:33,984 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2024-11-19 17:15:33,984 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-19 17:15:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2024-11-19 17:15:33,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 17:15:33,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:33,985 INFO L215 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-19 17:15:33,990 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-19 17:15:34,189 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-19 17:15:34,189 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:34,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash -378794195, now seen corresponding path program 1 times [2024-11-19 17:15:34,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:15:34,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702085692] [2024-11-19 17:15:34,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:34,190 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-19 17:15:34,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:15:34,191 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-19 17:15:34,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 (18)] Waiting until timeout for monitored process [2024-11-19 17:15:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:34,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 17:15:34,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:15:34,444 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-19 17:15:34,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:15:34,665 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-19 17:15:34,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:15:34,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702085692] [2024-11-19 17:15:34,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702085692] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:15:34,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 17:15:34,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-19 17:15:34,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774838558] [2024-11-19 17:15:34,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 17:15:34,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 17:15:34,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:15:34,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 17:15:34,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 17:15:34,667 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-19 17:15:35,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:35,099 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2024-11-19 17:15:35,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 17:15:35,100 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-19 17:15:35,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:35,101 INFO L225 Difference]: With dead ends: 109 [2024-11-19 17:15:35,101 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 17:15:35,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-19 17:15:35,103 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 57 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:35,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 411 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 17:15:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 17:15:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2024-11-19 17:15:35,112 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-19 17:15:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2024-11-19 17:15:35,113 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 115 transitions. Word has length 63 [2024-11-19 17:15:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:35,113 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 115 transitions. [2024-11-19 17:15:35,113 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-19 17:15:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2024-11-19 17:15:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 17:15:35,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:35,114 INFO L215 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-19 17:15:35,119 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-19 17:15:35,315 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-19 17:15:35,315 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:35,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:35,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2130957302, now seen corresponding path program 1 times [2024-11-19 17:15:35,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:15:35,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812614894] [2024-11-19 17:15:35,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:35,316 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-19 17:15:35,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:15:35,320 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-19 17:15:35,321 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-19 17:15:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:35,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 17:15:35,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:15:35,652 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-19 17:15:35,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:15:36,098 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-19 17:15:36,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:15:36,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812614894] [2024-11-19 17:15:36,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812614894] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:15:36,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 17:15:36,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-11-19 17:15:36,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030289128] [2024-11-19 17:15:36,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 17:15:36,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 17:15:36,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:15:36,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 17:15:36,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 17:15:36,100 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-19 17:15:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:36,378 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2024-11-19 17:15:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 17:15:36,379 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-19 17:15:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:36,380 INFO L225 Difference]: With dead ends: 106 [2024-11-19 17:15:36,380 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 17:15:36,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-19 17:15:36,381 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 38 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:36,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 507 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 17:15:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 17:15:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2024-11-19 17:15:36,390 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-19 17:15:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2024-11-19 17:15:36,393 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 65 [2024-11-19 17:15:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:36,393 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2024-11-19 17:15:36,393 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-19 17:15:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2024-11-19 17:15:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 17:15:36,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:36,395 INFO L215 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-19 17:15:36,400 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 (19)] Forceful destruction successful, exit code 0 [2024-11-19 17:15:36,598 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-19 17:15:36,599 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:36,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:36,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1951422266, now seen corresponding path program 1 times [2024-11-19 17:15:36,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:15:36,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25369361] [2024-11-19 17:15:36,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:36,600 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-19 17:15:36,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:15:36,601 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-19 17:15:36,602 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-19 17:15:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:36,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 17:15:36,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:15:37,386 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-19 17:15:37,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:15:37,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:15:37,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25369361] [2024-11-19 17:15:37,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25369361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:15:37,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:15:37,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 17:15:37,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156613284] [2024-11-19 17:15:37,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:15:37,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 17:15:37,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:15:37,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 17:15:37,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 17:15:37,389 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-19 17:15:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:15:37,872 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2024-11-19 17:15:37,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 17:15:37,874 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-19 17:15:37,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:15:37,875 INFO L225 Difference]: With dead ends: 96 [2024-11-19 17:15:37,875 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 17:15:37,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 17:15:37,876 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 6 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-19 17:15:37,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 521 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 17:15:37,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 17:15:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-11-19 17:15:37,883 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-19 17:15:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2024-11-19 17:15:37,884 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 72 [2024-11-19 17:15:37,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:15:37,885 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2024-11-19 17:15:37,885 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-19 17:15:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2024-11-19 17:15:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 17:15:37,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:15:37,886 INFO L215 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-19 17:15:37,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-19 17:15:38,087 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-19 17:15:38,087 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:15:38,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:15:38,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1060490927, now seen corresponding path program 1 times [2024-11-19 17:15:38,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:15:38,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733419922] [2024-11-19 17:15:38,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:15:38,088 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-19 17:15:38,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:15:38,089 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-19 17:15:38,090 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-19 17:15:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:15:38,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 17:15:38,144 INFO L278 TraceCheckSpWp]: Computing forward predicates...