./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:32:15,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:32:15,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:32:15,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:32:15,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:32:15,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:32:15,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:32:15,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:32:15,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:32:15,281 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:32:15,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:32:15,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:32:15,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:32:15,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:32:15,289 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:32:15,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:32:15,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:32:15,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:32:15,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:32:15,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:32:15,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:32:15,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:32:15,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:32:15,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:32:15,292 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:32:15,292 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:32:15,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:32:15,293 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:32:15,293 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:32:15,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:32:15,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:32:15,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:32:15,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:32:15,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:32:15,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:32:15,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:32:15,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:32:15,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:32:15,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:32:15,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:32:15,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:32:15,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:32:15,297 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2024-11-09 18:32:15,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:32:15,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:32:15,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:32:15,576 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:32:15,576 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:32:15,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-09 18:32:17,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:32:17,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:32:17,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-09 18:32:17,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24204dc4/4e192cd9c7c24f0fa01f27c80c1da590/FLAG2d95d47d9 [2024-11-09 18:32:17,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24204dc4/4e192cd9c7c24f0fa01f27c80c1da590 [2024-11-09 18:32:17,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:32:17,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:32:17,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:32:17,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:32:17,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:32:17,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73587275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17, skipping insertion in model container [2024-11-09 18:32:17,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:32:17,503 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_1-2a.c.cil.c[755,768] [2024-11-09 18:32:17,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:32:17,571 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:32:17,581 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_1-2a.c.cil.c[755,768] [2024-11-09 18:32:17,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:32:17,631 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:32:17,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17 WrapperNode [2024-11-09 18:32:17,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:32:17,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:32:17,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:32:17,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:32:17,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,670 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 190 [2024-11-09 18:32:17,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:32:17,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:32:17,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:32:17,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:32:17,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,718 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-09 18:32:17,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,731 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:32:17,742 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:32:17,742 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:32:17,742 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:32:17,743 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (1/1) ... [2024-11-09 18:32:17,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:32:17,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:17,788 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-09 18:32:17,796 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-09 18:32:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:32:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:32:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-09 18:32:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-09 18:32:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:32:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:32:17,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 18:32:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 18:32:17,927 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:32:17,932 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:32:18,417 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-09 18:32:18,417 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:32:18,455 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:32:18,456 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 18:32:18,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:18 BoogieIcfgContainer [2024-11-09 18:32:18,457 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:32:18,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:32:18,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:32:18,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:32:18,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:32:17" (1/3) ... [2024-11-09 18:32:18,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170ed337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:32:18, skipping insertion in model container [2024-11-09 18:32:18,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:17" (2/3) ... [2024-11-09 18:32:18,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170ed337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:32:18, skipping insertion in model container [2024-11-09 18:32:18,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:18" (3/3) ... [2024-11-09 18:32:18,467 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-11-09 18:32:18,484 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:32:18,484 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:32:18,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:32:18,553 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;@61434719, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:32:18,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:32:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 94 states have internal predecessors, (140), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 18:32:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 18:32:18,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:18,567 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, 1, 1] [2024-11-09 18:32:18,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:18,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:18,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1543037036, now seen corresponding path program 1 times [2024-11-09 18:32:18,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:18,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764120390] [2024-11-09 18:32:18,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:19,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:19,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:19,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:19,253 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-09 18:32:19,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:19,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764120390] [2024-11-09 18:32:19,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764120390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:19,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994700985] [2024-11-09 18:32:19,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:19,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:19,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:19,258 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-09 18:32:19,260 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-09 18:32:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:19,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 18:32:19,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:19,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994700985] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:19,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2024-11-09 18:32:19,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240652322] [2024-11-09 18:32:19,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:19,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 18:32:19,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:19,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 18:32:19,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:32:19,648 INFO L87 Difference]: Start difference. First operand has 103 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 94 states have internal predecessors, (140), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 18:32:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:20,083 INFO L93 Difference]: Finished difference Result 285 states and 460 transitions. [2024-11-09 18:32:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:32:20,086 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 37 [2024-11-09 18:32:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:20,095 INFO L225 Difference]: With dead ends: 285 [2024-11-09 18:32:20,095 INFO L226 Difference]: Without dead ends: 179 [2024-11-09 18:32:20,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-11-09 18:32:20,102 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 129 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:20,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1339 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:32:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-09 18:32:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 170. [2024-11-09 18:32:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 150 states have (on average 1.4133333333333333) internal successors, (212), 151 states have internal predecessors, (212), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 18 states have call predecessors, (22), 15 states have call successors, (22) [2024-11-09 18:32:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2024-11-09 18:32:20,161 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 37 [2024-11-09 18:32:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:20,162 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2024-11-09 18:32:20,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 18:32:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2024-11-09 18:32:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 18:32:20,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:20,167 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, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:20,183 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-09 18:32:20,367 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-09 18:32:20,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:20,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash 704395030, now seen corresponding path program 1 times [2024-11-09 18:32:20,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:20,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018918358] [2024-11-09 18:32:20,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:20,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:20,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:20,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:20,610 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-09 18:32:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:20,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018918358] [2024-11-09 18:32:20,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018918358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:20,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:20,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 18:32:20,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051271488] [2024-11-09 18:32:20,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:20,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:32:20,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:20,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:32:20,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:20,615 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:20,756 INFO L93 Difference]: Finished difference Result 344 states and 508 transitions. [2024-11-09 18:32:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:32:20,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-09 18:32:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:20,760 INFO L225 Difference]: With dead ends: 344 [2024-11-09 18:32:20,763 INFO L226 Difference]: Without dead ends: 236 [2024-11-09 18:32:20,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:20,765 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 34 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:20,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 714 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-09 18:32:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2024-11-09 18:32:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 210 states have (on average 1.3904761904761904) internal successors, (292), 209 states have internal predecessors, (292), 20 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (26), 26 states have call predecessors, (26), 19 states have call successors, (26) [2024-11-09 18:32:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 338 transitions. [2024-11-09 18:32:20,793 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 338 transitions. Word has length 41 [2024-11-09 18:32:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:20,794 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 338 transitions. [2024-11-09 18:32:20,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 338 transitions. [2024-11-09 18:32:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 18:32:20,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:20,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:20,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:32:20,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:20,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1784680799, now seen corresponding path program 1 times [2024-11-09 18:32:20,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:20,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307206487] [2024-11-09 18:32:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:20,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:20,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307206487] [2024-11-09 18:32:20,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307206487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:20,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:20,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080625535] [2024-11-09 18:32:20,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:20,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:20,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:20,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:20,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:20,870 INFO L87 Difference]: Start difference. First operand 234 states and 338 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:20,942 INFO L93 Difference]: Finished difference Result 402 states and 582 transitions. [2024-11-09 18:32:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:20,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-09 18:32:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:20,945 INFO L225 Difference]: With dead ends: 402 [2024-11-09 18:32:20,945 INFO L226 Difference]: Without dead ends: 331 [2024-11-09 18:32:20,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:20,947 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 39 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:20,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 471 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-09 18:32:20,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2024-11-09 18:32:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 303 states have (on average 1.363036303630363) internal successors, (413), 302 states have internal predecessors, (413), 24 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (30), 30 states have call predecessors, (30), 23 states have call successors, (30) [2024-11-09 18:32:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 467 transitions. [2024-11-09 18:32:20,969 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 467 transitions. Word has length 44 [2024-11-09 18:32:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:20,970 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 467 transitions. [2024-11-09 18:32:20,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 467 transitions. [2024-11-09 18:32:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 18:32:20,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:20,972 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, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:20,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:32:20,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:20,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:20,973 INFO L85 PathProgramCache]: Analyzing trace with hash 526686647, now seen corresponding path program 1 times [2024-11-09 18:32:20,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:20,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049266459] [2024-11-09 18:32:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:20,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 18:32:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:32:21,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:21,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049266459] [2024-11-09 18:32:21,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049266459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:21,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709538472] [2024-11-09 18:32:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:21,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:21,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:21,147 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-09 18:32:21,159 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-09 18:32:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:32:21,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:21,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:21,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709538472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:21,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:21,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 18:32:21,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696406576] [2024-11-09 18:32:21,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:21,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:32:21,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:21,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:32:21,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:21,260 INFO L87 Difference]: Start difference. First operand 331 states and 467 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:21,302 INFO L93 Difference]: Finished difference Result 430 states and 612 transitions. [2024-11-09 18:32:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:32:21,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-09 18:32:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:21,306 INFO L225 Difference]: With dead ends: 430 [2024-11-09 18:32:21,306 INFO L226 Difference]: Without dead ends: 359 [2024-11-09 18:32:21,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:21,308 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 41 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:21,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 268 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-09 18:32:21,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-11-09 18:32:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 333 states have (on average 1.3423423423423424) internal successors, (447), 330 states have internal predecessors, (447), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-09 18:32:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 497 transitions. [2024-11-09 18:32:21,335 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 497 transitions. Word has length 45 [2024-11-09 18:32:21,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:21,336 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 497 transitions. [2024-11-09 18:32:21,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 497 transitions. [2024-11-09 18:32:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 18:32:21,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:21,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:21,356 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-09 18:32:21,543 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-09 18:32:21,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:21,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash -945089497, now seen corresponding path program 1 times [2024-11-09 18:32:21,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:21,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678507846] [2024-11-09 18:32:21,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:21,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:21,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:21,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678507846] [2024-11-09 18:32:21,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678507846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:21,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:21,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:21,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060375613] [2024-11-09 18:32:21,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:21,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:21,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:21,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:21,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:21,631 INFO L87 Difference]: Start difference. First operand 359 states and 497 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:21,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:21,673 INFO L93 Difference]: Finished difference Result 371 states and 510 transitions. [2024-11-09 18:32:21,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:21,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 18:32:21,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:21,676 INFO L225 Difference]: With dead ends: 371 [2024-11-09 18:32:21,676 INFO L226 Difference]: Without dead ends: 363 [2024-11-09 18:32:21,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:21,677 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:21,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-09 18:32:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2024-11-09 18:32:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 337 states have (on average 1.3382789317507418) internal successors, (451), 334 states have internal predecessors, (451), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-09 18:32:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 501 transitions. [2024-11-09 18:32:21,691 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 501 transitions. Word has length 46 [2024-11-09 18:32:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:21,691 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 501 transitions. [2024-11-09 18:32:21,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 501 transitions. [2024-11-09 18:32:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 18:32:21,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:21,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:21,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 18:32:21,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:21,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:21,694 INFO L85 PathProgramCache]: Analyzing trace with hash 797720838, now seen corresponding path program 1 times [2024-11-09 18:32:21,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:21,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448605346] [2024-11-09 18:32:21,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:21,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:21,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:21,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448605346] [2024-11-09 18:32:21,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448605346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:21,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:21,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:32:21,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907985186] [2024-11-09 18:32:21,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:21,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:32:21,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:21,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:32:21,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:32:21,756 INFO L87 Difference]: Start difference. First operand 363 states and 501 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:21,805 INFO L93 Difference]: Finished difference Result 371 states and 508 transitions. [2024-11-09 18:32:21,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:32:21,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 18:32:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:21,808 INFO L225 Difference]: With dead ends: 371 [2024-11-09 18:32:21,809 INFO L226 Difference]: Without dead ends: 363 [2024-11-09 18:32:21,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-09 18:32:21,810 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 3 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:21,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 523 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-09 18:32:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2024-11-09 18:32:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 333 states have (on average 1.3333333333333333) internal successors, (444), 330 states have internal predecessors, (444), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-09 18:32:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 494 transitions. [2024-11-09 18:32:21,821 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 494 transitions. Word has length 46 [2024-11-09 18:32:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:21,822 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 494 transitions. [2024-11-09 18:32:21,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 494 transitions. [2024-11-09 18:32:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 18:32:21,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:21,823 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:21,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:32:21,824 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:21,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1982519262, now seen corresponding path program 1 times [2024-11-09 18:32:21,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:21,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828474879] [2024-11-09 18:32:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:21,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:22,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:22,037 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-09 18:32:22,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:22,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828474879] [2024-11-09 18:32:22,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828474879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:22,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367072497] [2024-11-09 18:32:22,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:22,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:22,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:22,041 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-09 18:32:22,042 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-09 18:32:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:22,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 18:32:22,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:22,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:22,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367072497] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:22,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:22,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 11] total 16 [2024-11-09 18:32:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674316711] [2024-11-09 18:32:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:22,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:32:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:22,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:32:22,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-09 18:32:22,372 INFO L87 Difference]: Start difference. First operand 359 states and 494 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:22,531 INFO L93 Difference]: Finished difference Result 595 states and 817 transitions. [2024-11-09 18:32:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:32:22,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 18:32:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:22,534 INFO L225 Difference]: With dead ends: 595 [2024-11-09 18:32:22,534 INFO L226 Difference]: Without dead ends: 450 [2024-11-09 18:32:22,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:32:22,535 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 46 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:22,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 544 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-09 18:32:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 371. [2024-11-09 18:32:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 345 states have (on average 1.3217391304347825) internal successors, (456), 342 states have internal predecessors, (456), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-09 18:32:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 506 transitions. [2024-11-09 18:32:22,554 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 506 transitions. Word has length 46 [2024-11-09 18:32:22,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:22,554 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 506 transitions. [2024-11-09 18:32:22,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 506 transitions. [2024-11-09 18:32:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 18:32:22,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:22,556 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:22,572 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-09 18:32:22,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:22,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:22,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1806889409, now seen corresponding path program 1 times [2024-11-09 18:32:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:22,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414089693] [2024-11-09 18:32:22,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:22,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:22,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:22,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:23,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414089693] [2024-11-09 18:32:23,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414089693] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850757346] [2024-11-09 18:32:23,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:23,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:23,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:23,007 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-09 18:32:23,009 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-09 18:32:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:23,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 18:32:23,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:23,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:23,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850757346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:23,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:23,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2024-11-09 18:32:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740584624] [2024-11-09 18:32:23,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:23,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 18:32:23,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:23,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 18:32:23,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-09 18:32:23,319 INFO L87 Difference]: Start difference. First operand 371 states and 506 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 18:32:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:23,583 INFO L93 Difference]: Finished difference Result 533 states and 735 transitions. [2024-11-09 18:32:23,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 18:32:23,583 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2024-11-09 18:32:23,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:23,586 INFO L225 Difference]: With dead ends: 533 [2024-11-09 18:32:23,586 INFO L226 Difference]: Without dead ends: 401 [2024-11-09 18:32:23,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-09 18:32:23,588 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 10 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:23,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1974 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-09 18:32:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 389. [2024-11-09 18:32:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 362 states have (on average 1.3093922651933703) internal successors, (474), 358 states have internal predecessors, (474), 22 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (35), 30 states have call predecessors, (35), 21 states have call successors, (35) [2024-11-09 18:32:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 531 transitions. [2024-11-09 18:32:23,604 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 531 transitions. Word has length 46 [2024-11-09 18:32:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:23,606 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 531 transitions. [2024-11-09 18:32:23,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 18:32:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 531 transitions. [2024-11-09 18:32:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 18:32:23,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:23,608 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:23,625 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-09 18:32:23,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:23,809 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:23,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:23,809 INFO L85 PathProgramCache]: Analyzing trace with hash 494285917, now seen corresponding path program 1 times [2024-11-09 18:32:23,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:23,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306666789] [2024-11-09 18:32:23,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:23,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:23,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:23,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:23,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306666789] [2024-11-09 18:32:23,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306666789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:23,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:23,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:23,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7681394] [2024-11-09 18:32:23,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:23,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:23,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:23,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:23,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:23,864 INFO L87 Difference]: Start difference. First operand 389 states and 531 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:23,906 INFO L93 Difference]: Finished difference Result 625 states and 853 transitions. [2024-11-09 18:32:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:23,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-09 18:32:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:23,909 INFO L225 Difference]: With dead ends: 625 [2024-11-09 18:32:23,909 INFO L226 Difference]: Without dead ends: 582 [2024-11-09 18:32:23,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:23,910 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 53 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:23,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 491 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-09 18:32:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 430. [2024-11-09 18:32:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 401 states have (on average 1.314214463840399) internal successors, (527), 397 states have internal predecessors, (527), 24 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (37), 32 states have call predecessors, (37), 23 states have call successors, (37) [2024-11-09 18:32:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 588 transitions. [2024-11-09 18:32:23,925 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 588 transitions. Word has length 47 [2024-11-09 18:32:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:23,926 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 588 transitions. [2024-11-09 18:32:23,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 588 transitions. [2024-11-09 18:32:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 18:32:23,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:23,929 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] [2024-11-09 18:32:23,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:32:23,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:23,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash -634205863, now seen corresponding path program 1 times [2024-11-09 18:32:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:23,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981992362] [2024-11-09 18:32:23,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:23,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:23,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 18:32:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:32:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981992362] [2024-11-09 18:32:24,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981992362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:24,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603937394] [2024-11-09 18:32:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:24,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:24,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:24,031 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-09 18:32:24,032 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-09 18:32:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:32:24,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 18:32:24,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:24,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603937394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:24,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:24,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-09 18:32:24,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223979327] [2024-11-09 18:32:24,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:24,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:24,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:24,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:24,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:24,123 INFO L87 Difference]: Start difference. First operand 430 states and 588 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:24,215 INFO L93 Difference]: Finished difference Result 836 states and 1155 transitions. [2024-11-09 18:32:24,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:24,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-11-09 18:32:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:24,219 INFO L225 Difference]: With dead ends: 836 [2024-11-09 18:32:24,219 INFO L226 Difference]: Without dead ends: 448 [2024-11-09 18:32:24,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:24,221 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 19 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:24,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 354 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-09 18:32:24,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 437. [2024-11-09 18:32:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 407 states have (on average 1.3144963144963144) internal successors, (535), 404 states have internal predecessors, (535), 24 states have call successors, (24), 2 states have call predecessors, (24), 5 states have return successors, (43), 32 states have call predecessors, (43), 23 states have call successors, (43) [2024-11-09 18:32:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 602 transitions. [2024-11-09 18:32:24,241 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 602 transitions. Word has length 47 [2024-11-09 18:32:24,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:24,241 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 602 transitions. [2024-11-09 18:32:24,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 602 transitions. [2024-11-09 18:32:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 18:32:24,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:24,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:24,260 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-09 18:32:24,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 18:32:24,448 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:24,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash -290395261, now seen corresponding path program 1 times [2024-11-09 18:32:24,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:24,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615844938] [2024-11-09 18:32:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,681 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-09 18:32:24,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:24,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615844938] [2024-11-09 18:32:24,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615844938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:24,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680706507] [2024-11-09 18:32:24,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:24,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:24,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:24,684 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-09 18:32:24,686 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-09 18:32:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:24,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 18:32:24,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:24,818 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-09 18:32:24,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:24,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680706507] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:24,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:24,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 11] total 15 [2024-11-09 18:32:24,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112532214] [2024-11-09 18:32:24,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:24,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:24,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:24,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:24,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 18:32:24,914 INFO L87 Difference]: Start difference. First operand 437 states and 602 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:25,080 INFO L93 Difference]: Finished difference Result 636 states and 879 transitions. [2024-11-09 18:32:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:25,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 18:32:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:25,083 INFO L225 Difference]: With dead ends: 636 [2024-11-09 18:32:25,084 INFO L226 Difference]: Without dead ends: 597 [2024-11-09 18:32:25,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 18:32:25,085 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 49 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:25,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 533 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-09 18:32:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 541. [2024-11-09 18:32:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 505 states have (on average 1.304950495049505) internal successors, (659), 503 states have internal predecessors, (659), 30 states have call successors, (30), 2 states have call predecessors, (30), 5 states have return successors, (49), 38 states have call predecessors, (49), 29 states have call successors, (49) [2024-11-09 18:32:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 738 transitions. [2024-11-09 18:32:25,103 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 738 transitions. Word has length 50 [2024-11-09 18:32:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:25,104 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 738 transitions. [2024-11-09 18:32:25,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 738 transitions. [2024-11-09 18:32:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 18:32:25,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:25,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:25,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 18:32:25,306 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-09 18:32:25,306 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:25,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:25,307 INFO L85 PathProgramCache]: Analyzing trace with hash -161312542, now seen corresponding path program 1 times [2024-11-09 18:32:25,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:25,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560385951] [2024-11-09 18:32:25,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:25,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:25,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:25,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560385951] [2024-11-09 18:32:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560385951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:25,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:25,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:25,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160963079] [2024-11-09 18:32:25,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:25,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:25,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:25,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:25,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:25,354 INFO L87 Difference]: Start difference. First operand 541 states and 738 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:25,389 INFO L93 Difference]: Finished difference Result 557 states and 755 transitions. [2024-11-09 18:32:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:25,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 18:32:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:25,392 INFO L225 Difference]: With dead ends: 557 [2024-11-09 18:32:25,395 INFO L226 Difference]: Without dead ends: 498 [2024-11-09 18:32:25,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:25,396 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:25,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 390 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-09 18:32:25,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2024-11-09 18:32:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 462 states have (on average 1.3138528138528138) internal successors, (607), 462 states have internal predecessors, (607), 30 states have call successors, (30), 2 states have call predecessors, (30), 5 states have return successors, (47), 36 states have call predecessors, (47), 29 states have call successors, (47) [2024-11-09 18:32:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 684 transitions. [2024-11-09 18:32:25,415 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 684 transitions. Word has length 50 [2024-11-09 18:32:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:25,415 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 684 transitions. [2024-11-09 18:32:25,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 684 transitions. [2024-11-09 18:32:25,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 18:32:25,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:25,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:25,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 18:32:25,417 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:25,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:25,418 INFO L85 PathProgramCache]: Analyzing trace with hash -752857861, now seen corresponding path program 1 times [2024-11-09 18:32:25,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:25,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181132068] [2024-11-09 18:32:25,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:25,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,458 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-09 18:32:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181132068] [2024-11-09 18:32:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181132068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:25,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:25,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:32:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875220686] [2024-11-09 18:32:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:25,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:32:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:25,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:32:25,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:32:25,461 INFO L87 Difference]: Start difference. First operand 498 states and 684 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:25,508 INFO L93 Difference]: Finished difference Result 991 states and 1366 transitions. [2024-11-09 18:32:25,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:32:25,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 18:32:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:25,535 INFO L225 Difference]: With dead ends: 991 [2024-11-09 18:32:25,536 INFO L226 Difference]: Without dead ends: 506 [2024-11-09 18:32:25,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:32:25,539 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:25,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 238 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:25,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-09 18:32:25,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 500. [2024-11-09 18:32:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 464 states have (on average 1.3125) internal successors, (609), 464 states have internal predecessors, (609), 30 states have call successors, (30), 2 states have call predecessors, (30), 5 states have return successors, (47), 36 states have call predecessors, (47), 29 states have call successors, (47) [2024-11-09 18:32:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 686 transitions. [2024-11-09 18:32:25,556 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 686 transitions. Word has length 50 [2024-11-09 18:32:25,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:25,556 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 686 transitions. [2024-11-09 18:32:25,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 686 transitions. [2024-11-09 18:32:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 18:32:25,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:25,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:25,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 18:32:25,558 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:25,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:25,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1028969820, now seen corresponding path program 1 times [2024-11-09 18:32:25,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:25,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022061107] [2024-11-09 18:32:25,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:25,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,609 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-09 18:32:25,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022061107] [2024-11-09 18:32:25,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022061107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:25,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:25,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:32:25,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029734290] [2024-11-09 18:32:25,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:25,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:32:25,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:25,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:32:25,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:32:25,611 INFO L87 Difference]: Start difference. First operand 500 states and 686 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:25,658 INFO L93 Difference]: Finished difference Result 993 states and 1367 transitions. [2024-11-09 18:32:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:32:25,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-11-09 18:32:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:25,661 INFO L225 Difference]: With dead ends: 993 [2024-11-09 18:32:25,662 INFO L226 Difference]: Without dead ends: 506 [2024-11-09 18:32:25,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:32:25,663 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:25,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 245 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-09 18:32:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 502. [2024-11-09 18:32:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 466 states have (on average 1.3111587982832618) internal successors, (611), 466 states have internal predecessors, (611), 30 states have call successors, (30), 2 states have call predecessors, (30), 5 states have return successors, (47), 36 states have call predecessors, (47), 29 states have call successors, (47) [2024-11-09 18:32:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 688 transitions. [2024-11-09 18:32:25,680 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 688 transitions. Word has length 51 [2024-11-09 18:32:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:25,680 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 688 transitions. [2024-11-09 18:32:25,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 688 transitions. [2024-11-09 18:32:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 18:32:25,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:25,682 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] [2024-11-09 18:32:25,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 18:32:25,682 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:25,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash 793044090, now seen corresponding path program 1 times [2024-11-09 18:32:25,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:25,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928038759] [2024-11-09 18:32:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:25,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:25,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:25,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928038759] [2024-11-09 18:32:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928038759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:25,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413042032] [2024-11-09 18:32:25,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:25,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:25,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:25,818 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-09 18:32:25,819 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-09 18:32:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:25,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 18:32:25,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:25,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:25,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413042032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:25,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:25,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2024-11-09 18:32:25,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392214764] [2024-11-09 18:32:25,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:25,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 18:32:25,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:25,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 18:32:25,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 18:32:25,968 INFO L87 Difference]: Start difference. First operand 502 states and 688 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:26,247 INFO L93 Difference]: Finished difference Result 1165 states and 1617 transitions. [2024-11-09 18:32:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 18:32:26,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-09 18:32:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:26,251 INFO L225 Difference]: With dead ends: 1165 [2024-11-09 18:32:26,252 INFO L226 Difference]: Without dead ends: 903 [2024-11-09 18:32:26,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:32:26,255 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 133 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:26,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1304 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2024-11-09 18:32:26,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 680. [2024-11-09 18:32:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 633 states have (on average 1.320695102685624) internal successors, (836), 628 states have internal predecessors, (836), 41 states have call successors, (41), 2 states have call predecessors, (41), 5 states have return successors, (64), 52 states have call predecessors, (64), 40 states have call successors, (64) [2024-11-09 18:32:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 941 transitions. [2024-11-09 18:32:26,280 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 941 transitions. Word has length 51 [2024-11-09 18:32:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:26,280 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 941 transitions. [2024-11-09 18:32:26,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 941 transitions. [2024-11-09 18:32:26,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 18:32:26,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:26,281 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] [2024-11-09 18:32:26,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:26,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:26,486 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:26,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1003907269, now seen corresponding path program 1 times [2024-11-09 18:32:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:26,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278070398] [2024-11-09 18:32:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:26,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:26,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:26,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:26,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278070398] [2024-11-09 18:32:26,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278070398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219356612] [2024-11-09 18:32:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:26,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:26,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:26,699 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-09 18:32:26,700 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-09 18:32:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:26,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 18:32:26,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:26,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219356612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:26,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:26,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 15 [2024-11-09 18:32:26,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308430454] [2024-11-09 18:32:26,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:26,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 18:32:26,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:26,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 18:32:26,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 18:32:26,937 INFO L87 Difference]: Start difference. First operand 680 states and 941 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:27,380 INFO L93 Difference]: Finished difference Result 826 states and 1134 transitions. [2024-11-09 18:32:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:32:27,380 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-09 18:32:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:27,384 INFO L225 Difference]: With dead ends: 826 [2024-11-09 18:32:27,384 INFO L226 Difference]: Without dead ends: 823 [2024-11-09 18:32:27,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-09 18:32:27,385 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 139 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:27,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 2141 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:32:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-11-09 18:32:27,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 702. [2024-11-09 18:32:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 652 states have (on average 1.3174846625766872) internal successors, (859), 649 states have internal predecessors, (859), 43 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (66), 52 states have call predecessors, (66), 42 states have call successors, (66) [2024-11-09 18:32:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 968 transitions. [2024-11-09 18:32:27,413 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 968 transitions. Word has length 51 [2024-11-09 18:32:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:27,413 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 968 transitions. [2024-11-09 18:32:27,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 968 transitions. [2024-11-09 18:32:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 18:32:27,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:27,415 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-09 18:32:27,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 18:32:27,616 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,SelfDestructingSolverStorable15 [2024-11-09 18:32:27,616 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:27,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash 565043772, now seen corresponding path program 1 times [2024-11-09 18:32:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:27,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611307051] [2024-11-09 18:32:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 18:32:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 18:32:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:32:27,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:27,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611307051] [2024-11-09 18:32:27,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611307051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:27,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820130092] [2024-11-09 18:32:27,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:27,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:27,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:27,726 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-09 18:32:27,728 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-09 18:32:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:27,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 18:32:27,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 18:32:27,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 18:32:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820130092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:27,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:27,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-09 18:32:27,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74374064] [2024-11-09 18:32:27,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:27,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:32:27,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:27,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:32:27,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:32:27,929 INFO L87 Difference]: Start difference. First operand 702 states and 968 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 18:32:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:28,187 INFO L93 Difference]: Finished difference Result 1263 states and 1743 transitions. [2024-11-09 18:32:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 18:32:28,188 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2024-11-09 18:32:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:28,191 INFO L225 Difference]: With dead ends: 1263 [2024-11-09 18:32:28,191 INFO L226 Difference]: Without dead ends: 564 [2024-11-09 18:32:28,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:32:28,194 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 163 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:28,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 750 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-09 18:32:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 508. [2024-11-09 18:32:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 471 states have (on average 1.3227176220806793) internal successors, (623), 471 states have internal predecessors, (623), 30 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (39), 35 states have call predecessors, (39), 29 states have call successors, (39) [2024-11-09 18:32:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 692 transitions. [2024-11-09 18:32:28,217 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 692 transitions. Word has length 51 [2024-11-09 18:32:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:28,217 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 692 transitions. [2024-11-09 18:32:28,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 18:32:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 692 transitions. [2024-11-09 18:32:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 18:32:28,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:28,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:28,236 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-09 18:32:28,420 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,SelfDestructingSolverStorable16 [2024-11-09 18:32:28,420 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:28,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash 621106555, now seen corresponding path program 1 times [2024-11-09 18:32:28,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:28,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725727840] [2024-11-09 18:32:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,515 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-09 18:32:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:28,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725727840] [2024-11-09 18:32:28,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725727840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:28,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:28,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:28,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573394347] [2024-11-09 18:32:28,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:28,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:28,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:28,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:28,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:28,516 INFO L87 Difference]: Start difference. First operand 508 states and 692 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:28,581 INFO L93 Difference]: Finished difference Result 958 states and 1306 transitions. [2024-11-09 18:32:28,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:32:28,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-09 18:32:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:28,585 INFO L225 Difference]: With dead ends: 958 [2024-11-09 18:32:28,585 INFO L226 Difference]: Without dead ends: 515 [2024-11-09 18:32:28,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:32:28,587 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 10 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:28,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 365 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-09 18:32:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 506. [2024-11-09 18:32:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 469 states have (on average 1.3219616204690832) internal successors, (620), 469 states have internal predecessors, (620), 30 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (39), 35 states have call predecessors, (39), 29 states have call successors, (39) [2024-11-09 18:32:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 689 transitions. [2024-11-09 18:32:28,605 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 689 transitions. Word has length 52 [2024-11-09 18:32:28,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:28,605 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 689 transitions. [2024-11-09 18:32:28,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 689 transitions. [2024-11-09 18:32:28,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 18:32:28,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:28,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:28,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 18:32:28,607 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:28,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:28,607 INFO L85 PathProgramCache]: Analyzing trace with hash -17458145, now seen corresponding path program 1 times [2024-11-09 18:32:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:28,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420461758] [2024-11-09 18:32:28,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:28,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,748 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-09 18:32:28,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:28,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420461758] [2024-11-09 18:32:28,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420461758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:28,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612046649] [2024-11-09 18:32:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:28,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:28,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:28,751 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-09 18:32:28,752 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-09 18:32:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:28,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 18:32:28,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:29,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:29,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:29,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612046649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:29,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:29,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 26 [2024-11-09 18:32:29,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491392827] [2024-11-09 18:32:29,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:29,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 18:32:29,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:29,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 18:32:29,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2024-11-09 18:32:29,814 INFO L87 Difference]: Start difference. First operand 506 states and 689 transitions. Second operand has 26 states, 25 states have (on average 2.92) internal successors, (73), 22 states have internal predecessors, (73), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 18:32:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:30,552 INFO L93 Difference]: Finished difference Result 553 states and 742 transitions. [2024-11-09 18:32:30,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 18:32:30,553 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.92) internal successors, (73), 22 states have internal predecessors, (73), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 52 [2024-11-09 18:32:30,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:30,555 INFO L225 Difference]: With dead ends: 553 [2024-11-09 18:32:30,555 INFO L226 Difference]: Without dead ends: 504 [2024-11-09 18:32:30,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=955, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 18:32:30,557 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 49 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:30,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1806 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:32:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-09 18:32:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 476. [2024-11-09 18:32:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 441 states have (on average 1.3197278911564625) internal successors, (582), 441 states have internal predecessors, (582), 28 states have call successors, (28), 3 states have call predecessors, (28), 6 states have return successors, (37), 33 states have call predecessors, (37), 27 states have call successors, (37) [2024-11-09 18:32:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 647 transitions. [2024-11-09 18:32:30,573 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 647 transitions. Word has length 52 [2024-11-09 18:32:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:30,573 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 647 transitions. [2024-11-09 18:32:30,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.92) internal successors, (73), 22 states have internal predecessors, (73), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 18:32:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 647 transitions. [2024-11-09 18:32:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:32:30,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:30,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:30,592 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-09 18:32:30,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:30,780 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:30,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash -683237548, now seen corresponding path program 1 times [2024-11-09 18:32:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:30,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968500262] [2024-11-09 18:32:30,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:30,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:30,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:30,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:30,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:30,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968500262] [2024-11-09 18:32:30,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968500262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:30,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:30,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 18:32:30,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995151651] [2024-11-09 18:32:30,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:30,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 18:32:30,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:30,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 18:32:30,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:30,969 INFO L87 Difference]: Start difference. First operand 476 states and 647 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:31,265 INFO L93 Difference]: Finished difference Result 693 states and 959 transitions. [2024-11-09 18:32:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:32:31,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-09 18:32:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:31,269 INFO L225 Difference]: With dead ends: 693 [2024-11-09 18:32:31,269 INFO L226 Difference]: Without dead ends: 668 [2024-11-09 18:32:31,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:31,270 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 65 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:31,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 972 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:32:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-09 18:32:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 534. [2024-11-09 18:32:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 494 states have (on average 1.3238866396761133) internal successors, (654), 495 states have internal predecessors, (654), 33 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (42), 38 states have call predecessors, (42), 32 states have call successors, (42) [2024-11-09 18:32:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 729 transitions. [2024-11-09 18:32:31,290 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 729 transitions. Word has length 53 [2024-11-09 18:32:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:31,291 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 729 transitions. [2024-11-09 18:32:31,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 729 transitions. [2024-11-09 18:32:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:32:31,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:31,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:31,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 18:32:31,292 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:31,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash 169973371, now seen corresponding path program 1 times [2024-11-09 18:32:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806280501] [2024-11-09 18:32:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:31,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:31,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806280501] [2024-11-09 18:32:31,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806280501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:31,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:31,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:31,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250075011] [2024-11-09 18:32:31,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:31,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:31,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:31,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:31,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:31,341 INFO L87 Difference]: Start difference. First operand 534 states and 729 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:31,386 INFO L93 Difference]: Finished difference Result 571 states and 774 transitions. [2024-11-09 18:32:31,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:31,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-09 18:32:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:31,389 INFO L225 Difference]: With dead ends: 571 [2024-11-09 18:32:31,390 INFO L226 Difference]: Without dead ends: 534 [2024-11-09 18:32:31,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:31,391 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 50 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:31,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 375 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:31,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-09 18:32:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2024-11-09 18:32:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 494 states have (on average 1.2955465587044535) internal successors, (640), 495 states have internal predecessors, (640), 33 states have call successors, (33), 3 states have call predecessors, (33), 6 states have return successors, (42), 38 states have call predecessors, (42), 32 states have call successors, (42) [2024-11-09 18:32:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 715 transitions. [2024-11-09 18:32:31,412 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 715 transitions. Word has length 53 [2024-11-09 18:32:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:31,412 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 715 transitions. [2024-11-09 18:32:31,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 715 transitions. [2024-11-09 18:32:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:32:31,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:31,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:31,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 18:32:31,414 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:31,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash 102966618, now seen corresponding path program 1 times [2024-11-09 18:32:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:31,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876591093] [2024-11-09 18:32:31,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:31,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:31,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:31,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876591093] [2024-11-09 18:32:31,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876591093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:31,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:31,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:32:31,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262468716] [2024-11-09 18:32:31,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:31,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:32:31,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:31,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:32:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:32:31,498 INFO L87 Difference]: Start difference. First operand 534 states and 715 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:31,639 INFO L93 Difference]: Finished difference Result 571 states and 758 transitions. [2024-11-09 18:32:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:32:31,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-09 18:32:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:31,643 INFO L225 Difference]: With dead ends: 571 [2024-11-09 18:32:31,643 INFO L226 Difference]: Without dead ends: 545 [2024-11-09 18:32:31,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:31,644 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 46 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:31,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 564 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-09 18:32:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 541. [2024-11-09 18:32:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 499 states have (on average 1.2965931863727456) internal successors, (647), 500 states have internal predecessors, (647), 35 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (44), 40 states have call predecessors, (44), 34 states have call successors, (44) [2024-11-09 18:32:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 726 transitions. [2024-11-09 18:32:31,679 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 726 transitions. Word has length 53 [2024-11-09 18:32:31,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:31,680 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 726 transitions. [2024-11-09 18:32:31,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 726 transitions. [2024-11-09 18:32:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 18:32:31,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:31,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:31,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 18:32:31,682 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:31,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1190459479, now seen corresponding path program 1 times [2024-11-09 18:32:31,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:31,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90905184] [2024-11-09 18:32:31,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:31,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:31,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:31,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90905184] [2024-11-09 18:32:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90905184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324128303] [2024-11-09 18:32:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:31,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:31,910 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-09 18:32:31,911 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-09 18:32:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:31,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 18:32:31,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:32,119 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-09 18:32:32,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:32,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324128303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:32,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:32,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 20 [2024-11-09 18:32:32,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022798240] [2024-11-09 18:32:32,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:32,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:32:32,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:32,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:32:32,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-09 18:32:32,122 INFO L87 Difference]: Start difference. First operand 541 states and 726 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:32,455 INFO L93 Difference]: Finished difference Result 856 states and 1149 transitions. [2024-11-09 18:32:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:32:32,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-09 18:32:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:32,459 INFO L225 Difference]: With dead ends: 856 [2024-11-09 18:32:32,459 INFO L226 Difference]: Without dead ends: 778 [2024-11-09 18:32:32,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-09 18:32:32,461 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 115 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:32,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1321 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:32:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-11-09 18:32:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 690. [2024-11-09 18:32:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 636 states have (on average 1.2893081761006289) internal successors, (820), 641 states have internal predecessors, (820), 47 states have call successors, (47), 3 states have call predecessors, (47), 6 states have return successors, (55), 51 states have call predecessors, (55), 45 states have call successors, (55) [2024-11-09 18:32:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 922 transitions. [2024-11-09 18:32:32,491 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 922 transitions. Word has length 55 [2024-11-09 18:32:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:32,491 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 922 transitions. [2024-11-09 18:32:32,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 922 transitions. [2024-11-09 18:32:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 18:32:32,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:32,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:32,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:32,697 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,SelfDestructingSolverStorable22 [2024-11-09 18:32:32,698 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:32,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:32,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1361697482, now seen corresponding path program 1 times [2024-11-09 18:32:32,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:32,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726087888] [2024-11-09 18:32:32,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:32,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:32,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726087888] [2024-11-09 18:32:32,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726087888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:32,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:32,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:32,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63182794] [2024-11-09 18:32:32,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:32,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:32,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:32,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:32,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:32,738 INFO L87 Difference]: Start difference. First operand 690 states and 922 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:32,775 INFO L93 Difference]: Finished difference Result 700 states and 931 transitions. [2024-11-09 18:32:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:32,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-09 18:32:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:32,779 INFO L225 Difference]: With dead ends: 700 [2024-11-09 18:32:32,779 INFO L226 Difference]: Without dead ends: 667 [2024-11-09 18:32:32,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:32,780 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:32,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 378 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-09 18:32:32,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 645. [2024-11-09 18:32:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 595 states have (on average 1.2957983193277312) internal successors, (771), 600 states have internal predecessors, (771), 43 states have call successors, (43), 3 states have call predecessors, (43), 6 states have return successors, (50), 46 states have call predecessors, (50), 41 states have call successors, (50) [2024-11-09 18:32:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 864 transitions. [2024-11-09 18:32:32,802 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 864 transitions. Word has length 55 [2024-11-09 18:32:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:32,802 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 864 transitions. [2024-11-09 18:32:32,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 864 transitions. [2024-11-09 18:32:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 18:32:32,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:32,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:32,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 18:32:32,805 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:32,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:32,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1347196232, now seen corresponding path program 1 times [2024-11-09 18:32:32,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:32,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815722549] [2024-11-09 18:32:32,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:32,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:32,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:32,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815722549] [2024-11-09 18:32:32,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815722549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:32,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:32,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 18:32:32,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039600828] [2024-11-09 18:32:32,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:32,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:32:32,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:32,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:32:32,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:32,969 INFO L87 Difference]: Start difference. First operand 645 states and 864 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:33,201 INFO L93 Difference]: Finished difference Result 870 states and 1173 transitions. [2024-11-09 18:32:33,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:32:33,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-09 18:32:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:33,205 INFO L225 Difference]: With dead ends: 870 [2024-11-09 18:32:33,205 INFO L226 Difference]: Without dead ends: 821 [2024-11-09 18:32:33,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:33,206 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 54 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:33,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 651 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:33,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-09 18:32:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 668. [2024-11-09 18:32:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 615 states have (on average 1.3040650406504064) internal successors, (802), 620 states have internal predecessors, (802), 46 states have call successors, (46), 3 states have call predecessors, (46), 6 states have return successors, (49), 48 states have call predecessors, (49), 44 states have call successors, (49) [2024-11-09 18:32:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 897 transitions. [2024-11-09 18:32:33,238 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 897 transitions. Word has length 55 [2024-11-09 18:32:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:33,238 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 897 transitions. [2024-11-09 18:32:33,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 897 transitions. [2024-11-09 18:32:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 18:32:33,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:33,241 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-09 18:32:33,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 18:32:33,241 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:33,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:33,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1422142632, now seen corresponding path program 1 times [2024-11-09 18:32:33,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:33,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174772331] [2024-11-09 18:32:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:33,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:33,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:33,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:33,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:33,373 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-09 18:32:33,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:33,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174772331] [2024-11-09 18:32:33,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174772331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:33,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708118329] [2024-11-09 18:32:33,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:33,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:33,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:33,376 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-09 18:32:33,377 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-09 18:32:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:33,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 18:32:33,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:33,469 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-09 18:32:33,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:33,608 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-09 18:32:33,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708118329] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:33,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:33,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 13 [2024-11-09 18:32:33,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054273464] [2024-11-09 18:32:33,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:33,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 18:32:33,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:33,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 18:32:33,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 18:32:33,611 INFO L87 Difference]: Start difference. First operand 668 states and 897 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 18:32:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:33,795 INFO L93 Difference]: Finished difference Result 828 states and 1110 transitions. [2024-11-09 18:32:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 18:32:33,796 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2024-11-09 18:32:33,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:33,799 INFO L225 Difference]: With dead ends: 828 [2024-11-09 18:32:33,799 INFO L226 Difference]: Without dead ends: 682 [2024-11-09 18:32:33,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:32:33,801 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 200 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:33,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 855 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-11-09 18:32:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 627. [2024-11-09 18:32:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 576 states have (on average 1.296875) internal successors, (747), 581 states have internal predecessors, (747), 44 states have call successors, (44), 3 states have call predecessors, (44), 6 states have return successors, (47), 46 states have call predecessors, (47), 42 states have call successors, (47) [2024-11-09 18:32:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 838 transitions. [2024-11-09 18:32:33,828 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 838 transitions. Word has length 57 [2024-11-09 18:32:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:33,828 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 838 transitions. [2024-11-09 18:32:33,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 18:32:33,829 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 838 transitions. [2024-11-09 18:32:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 18:32:33,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:33,831 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-09 18:32:33,850 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-09 18:32:34,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 18:32:34,032 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:34,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1075873305, now seen corresponding path program 1 times [2024-11-09 18:32:34,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:34,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23830639] [2024-11-09 18:32:34,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:34,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:34,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:34,247 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-09 18:32:34,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23830639] [2024-11-09 18:32:34,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23830639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567527257] [2024-11-09 18:32:34,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:34,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:34,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:34,251 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-09 18:32:34,252 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-09 18:32:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:34,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 18:32:34,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:34,371 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-09 18:32:34,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:34,479 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-09 18:32:34,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567527257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:34,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:32:34,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-09 18:32:34,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240900304] [2024-11-09 18:32:34,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:34,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 18:32:34,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:34,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 18:32:34,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:32:34,483 INFO L87 Difference]: Start difference. First operand 627 states and 838 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 18:32:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:34,737 INFO L93 Difference]: Finished difference Result 917 states and 1233 transitions. [2024-11-09 18:32:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 18:32:34,738 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2024-11-09 18:32:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:34,741 INFO L225 Difference]: With dead ends: 917 [2024-11-09 18:32:34,741 INFO L226 Difference]: Without dead ends: 733 [2024-11-09 18:32:34,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:32:34,743 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 195 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:34,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1256 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-09 18:32:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 627. [2024-11-09 18:32:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 576 states have (on average 1.2899305555555556) internal successors, (743), 581 states have internal predecessors, (743), 44 states have call successors, (44), 3 states have call predecessors, (44), 6 states have return successors, (47), 46 states have call predecessors, (47), 42 states have call successors, (47) [2024-11-09 18:32:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 834 transitions. [2024-11-09 18:32:34,764 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 834 transitions. Word has length 57 [2024-11-09 18:32:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:34,765 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 834 transitions. [2024-11-09 18:32:34,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 18:32:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 834 transitions. [2024-11-09 18:32:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 18:32:34,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:34,766 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-09 18:32:34,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 18:32:34,969 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,SelfDestructingSolverStorable26 [2024-11-09 18:32:34,970 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:34,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:34,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1151601512, now seen corresponding path program 2 times [2024-11-09 18:32:34,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:34,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817937896] [2024-11-09 18:32:34,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:34,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 18:32:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,315 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-09 18:32:35,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:35,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817937896] [2024-11-09 18:32:35,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817937896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:35,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:35,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 18:32:35,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572274301] [2024-11-09 18:32:35,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:35,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 18:32:35,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:35,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 18:32:35,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 18:32:35,317 INFO L87 Difference]: Start difference. First operand 627 states and 834 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:35,614 INFO L93 Difference]: Finished difference Result 666 states and 883 transitions. [2024-11-09 18:32:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 18:32:35,615 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2024-11-09 18:32:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:35,618 INFO L225 Difference]: With dead ends: 666 [2024-11-09 18:32:35,618 INFO L226 Difference]: Without dead ends: 663 [2024-11-09 18:32:35,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:32:35,619 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 120 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:35,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1592 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-09 18:32:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 631. [2024-11-09 18:32:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 579 states have (on average 1.2884283246977548) internal successors, (746), 584 states have internal predecessors, (746), 44 states have call successors, (44), 4 states have call predecessors, (44), 7 states have return successors, (47), 46 states have call predecessors, (47), 42 states have call successors, (47) [2024-11-09 18:32:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 837 transitions. [2024-11-09 18:32:35,642 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 837 transitions. Word has length 57 [2024-11-09 18:32:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:35,643 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 837 transitions. [2024-11-09 18:32:35,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 837 transitions. [2024-11-09 18:32:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 18:32:35,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:35,644 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-09 18:32:35,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 18:32:35,645 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:35,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1346414425, now seen corresponding path program 2 times [2024-11-09 18:32:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:35,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201095574] [2024-11-09 18:32:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 18:32:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:35,805 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-09 18:32:35,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201095574] [2024-11-09 18:32:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201095574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:35,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:35,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 18:32:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470259786] [2024-11-09 18:32:35,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:35,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 18:32:35,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:35,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 18:32:35,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:35,808 INFO L87 Difference]: Start difference. First operand 631 states and 837 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:35,962 INFO L93 Difference]: Finished difference Result 760 states and 1005 transitions. [2024-11-09 18:32:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:32:35,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2024-11-09 18:32:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:35,965 INFO L225 Difference]: With dead ends: 760 [2024-11-09 18:32:35,965 INFO L226 Difference]: Without dead ends: 648 [2024-11-09 18:32:35,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 18:32:35,966 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 77 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:35,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 859 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-09 18:32:35,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 631. [2024-11-09 18:32:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 579 states have (on average 1.2849740932642486) internal successors, (744), 584 states have internal predecessors, (744), 44 states have call successors, (44), 4 states have call predecessors, (44), 7 states have return successors, (47), 46 states have call predecessors, (47), 42 states have call successors, (47) [2024-11-09 18:32:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 835 transitions. [2024-11-09 18:32:35,990 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 835 transitions. Word has length 57 [2024-11-09 18:32:35,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:35,990 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 835 transitions. [2024-11-09 18:32:35,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 835 transitions. [2024-11-09 18:32:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 18:32:35,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:35,992 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2024-11-09 18:32:35,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 18:32:35,992 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:35,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:35,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1685934974, now seen corresponding path program 1 times [2024-11-09 18:32:35,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:35,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284873443] [2024-11-09 18:32:35,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:35,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:36,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:36,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:36,212 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-09 18:32:36,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:36,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284873443] [2024-11-09 18:32:36,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284873443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:36,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827963034] [2024-11-09 18:32:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:36,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:36,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:36,215 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-09 18:32:36,218 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-09 18:32:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:36,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 18:32:36,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:36,376 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 18:32:36,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:36,475 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-09 18:32:36,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827963034] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:36,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:36,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 10] total 19 [2024-11-09 18:32:36,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718548141] [2024-11-09 18:32:36,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:36,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:36,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:36,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:36,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-09 18:32:36,477 INFO L87 Difference]: Start difference. First operand 631 states and 835 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:36,687 INFO L93 Difference]: Finished difference Result 720 states and 943 transitions. [2024-11-09 18:32:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:32:36,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2024-11-09 18:32:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:36,690 INFO L225 Difference]: With dead ends: 720 [2024-11-09 18:32:36,691 INFO L226 Difference]: Without dead ends: 661 [2024-11-09 18:32:36,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-09 18:32:36,692 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 52 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:36,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 484 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-11-09 18:32:36,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 627. [2024-11-09 18:32:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 576 states have (on average 1.2569444444444444) internal successors, (724), 581 states have internal predecessors, (724), 43 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (46), 45 states have call predecessors, (46), 41 states have call successors, (46) [2024-11-09 18:32:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 813 transitions. [2024-11-09 18:32:36,716 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 813 transitions. Word has length 58 [2024-11-09 18:32:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:36,717 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 813 transitions. [2024-11-09 18:32:36,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 813 transitions. [2024-11-09 18:32:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 18:32:36,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:36,718 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2024-11-09 18:32:36,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 18:32:36,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:36,923 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:36,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:36,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1404179896, now seen corresponding path program 1 times [2024-11-09 18:32:36,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:36,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101761469] [2024-11-09 18:32:36,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:36,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,094 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-09 18:32:37,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:37,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101761469] [2024-11-09 18:32:37,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101761469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:37,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:37,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 18:32:37,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716181] [2024-11-09 18:32:37,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:37,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:32:37,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:37,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:32:37,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:37,096 INFO L87 Difference]: Start difference. First operand 627 states and 813 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:37,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:37,201 INFO L93 Difference]: Finished difference Result 634 states and 819 transitions. [2024-11-09 18:32:37,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:32:37,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 59 [2024-11-09 18:32:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:37,205 INFO L225 Difference]: With dead ends: 634 [2024-11-09 18:32:37,205 INFO L226 Difference]: Without dead ends: 631 [2024-11-09 18:32:37,205 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-09 18:32:37,206 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 12 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:37,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 688 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-09 18:32:37,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2024-11-09 18:32:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 579 states have (on average 1.2556131260794474) internal successors, (727), 584 states have internal predecessors, (727), 43 states have call successors, (43), 5 states have call predecessors, (43), 8 states have return successors, (46), 45 states have call predecessors, (46), 41 states have call successors, (46) [2024-11-09 18:32:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 816 transitions. [2024-11-09 18:32:37,229 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 816 transitions. Word has length 59 [2024-11-09 18:32:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:37,229 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 816 transitions. [2024-11-09 18:32:37,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 816 transitions. [2024-11-09 18:32:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 18:32:37,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:37,231 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2024-11-09 18:32:37,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 18:32:37,232 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:37,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:37,232 INFO L85 PathProgramCache]: Analyzing trace with hash -102556484, now seen corresponding path program 1 times [2024-11-09 18:32:37,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:37,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217996637] [2024-11-09 18:32:37,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:37,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,303 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-09 18:32:37,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:37,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217996637] [2024-11-09 18:32:37,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217996637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:37,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:37,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 18:32:37,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429031547] [2024-11-09 18:32:37,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:37,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:37,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:37,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:37,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:37,306 INFO L87 Difference]: Start difference. First operand 631 states and 816 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:37,371 INFO L93 Difference]: Finished difference Result 644 states and 829 transitions. [2024-11-09 18:32:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:37,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2024-11-09 18:32:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:37,374 INFO L225 Difference]: With dead ends: 644 [2024-11-09 18:32:37,374 INFO L226 Difference]: Without dead ends: 641 [2024-11-09 18:32:37,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-09 18:32:37,375 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 8 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:37,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 621 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:37,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-09 18:32:37,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 637. [2024-11-09 18:32:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 583 states have (on average 1.2538593481989708) internal successors, (731), 589 states have internal predecessors, (731), 44 states have call successors, (44), 6 states have call predecessors, (44), 9 states have return successors, (47), 45 states have call predecessors, (47), 42 states have call successors, (47) [2024-11-09 18:32:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 822 transitions. [2024-11-09 18:32:37,401 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 822 transitions. Word has length 60 [2024-11-09 18:32:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:37,402 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 822 transitions. [2024-11-09 18:32:37,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 822 transitions. [2024-11-09 18:32:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 18:32:37,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:37,403 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2024-11-09 18:32:37,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 18:32:37,403 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:37,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1847357084, now seen corresponding path program 1 times [2024-11-09 18:32:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342523504] [2024-11-09 18:32:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 18:32:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,489 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-09 18:32:37,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:37,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342523504] [2024-11-09 18:32:37,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342523504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:37,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:37,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 18:32:37,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453062578] [2024-11-09 18:32:37,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:37,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:37,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:37,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:37,493 INFO L87 Difference]: Start difference. First operand 637 states and 822 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:37,559 INFO L93 Difference]: Finished difference Result 672 states and 857 transitions. [2024-11-09 18:32:37,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:37,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2024-11-09 18:32:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:37,562 INFO L225 Difference]: With dead ends: 672 [2024-11-09 18:32:37,562 INFO L226 Difference]: Without dead ends: 669 [2024-11-09 18:32:37,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-09 18:32:37,564 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 20 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:37,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 712 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-09 18:32:37,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 641. [2024-11-09 18:32:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 586 states have (on average 1.2525597269624573) internal successors, (734), 592 states have internal predecessors, (734), 44 states have call successors, (44), 7 states have call predecessors, (44), 10 states have return successors, (47), 45 states have call predecessors, (47), 42 states have call successors, (47) [2024-11-09 18:32:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 825 transitions. [2024-11-09 18:32:37,591 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 825 transitions. Word has length 60 [2024-11-09 18:32:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:37,591 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 825 transitions. [2024-11-09 18:32:37,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 825 transitions. [2024-11-09 18:32:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 18:32:37,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:37,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:37,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 18:32:37,593 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:37,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:37,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1240918087, now seen corresponding path program 1 times [2024-11-09 18:32:37,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:37,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067414478] [2024-11-09 18:32:37,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:37,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:37,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:37,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067414478] [2024-11-09 18:32:37,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067414478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:37,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:37,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 18:32:37,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233524291] [2024-11-09 18:32:37,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:37,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 18:32:37,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:37,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 18:32:37,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:37,733 INFO L87 Difference]: Start difference. First operand 641 states and 825 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:37,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:37,969 INFO L93 Difference]: Finished difference Result 798 states and 1018 transitions. [2024-11-09 18:32:37,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:32:37,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 61 [2024-11-09 18:32:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:37,972 INFO L225 Difference]: With dead ends: 798 [2024-11-09 18:32:37,972 INFO L226 Difference]: Without dead ends: 744 [2024-11-09 18:32:37,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 18:32:37,973 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 128 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:37,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 757 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2024-11-09 18:32:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 626. [2024-11-09 18:32:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 574 states have (on average 1.2473867595818815) internal successors, (716), 579 states have internal predecessors, (716), 41 states have call successors, (41), 7 states have call predecessors, (41), 10 states have return successors, (44), 42 states have call predecessors, (44), 39 states have call successors, (44) [2024-11-09 18:32:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 801 transitions. [2024-11-09 18:32:37,997 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 801 transitions. Word has length 61 [2024-11-09 18:32:37,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:37,998 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 801 transitions. [2024-11-09 18:32:37,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 801 transitions. [2024-11-09 18:32:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 18:32:37,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:37,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:37,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 18:32:38,000 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:38,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:38,000 INFO L85 PathProgramCache]: Analyzing trace with hash 3846394, now seen corresponding path program 1 times [2024-11-09 18:32:38,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:38,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194453332] [2024-11-09 18:32:38,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:38,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:38,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:38,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:38,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 18:32:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:38,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194453332] [2024-11-09 18:32:38,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194453332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:38,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444664712] [2024-11-09 18:32:38,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:38,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:38,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:38,430 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-09 18:32:38,432 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-09 18:32:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:38,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 18:32:38,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:38,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444664712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:38,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 25 [2024-11-09 18:32:38,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666309972] [2024-11-09 18:32:38,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:38,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:32:38,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:38,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:32:38,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2024-11-09 18:32:38,745 INFO L87 Difference]: Start difference. First operand 626 states and 801 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:39,091 INFO L93 Difference]: Finished difference Result 780 states and 1000 transitions. [2024-11-09 18:32:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:32:39,092 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 61 [2024-11-09 18:32:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:39,094 INFO L225 Difference]: With dead ends: 780 [2024-11-09 18:32:39,094 INFO L226 Difference]: Without dead ends: 695 [2024-11-09 18:32:39,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2024-11-09 18:32:39,095 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 101 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:39,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1138 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:32:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-09 18:32:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 591. [2024-11-09 18:32:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 542 states have (on average 1.2490774907749078) internal successors, (677), 547 states have internal predecessors, (677), 39 states have call successors, (39), 7 states have call predecessors, (39), 9 states have return successors, (40), 39 states have call predecessors, (40), 37 states have call successors, (40) [2024-11-09 18:32:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 756 transitions. [2024-11-09 18:32:39,120 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 756 transitions. Word has length 61 [2024-11-09 18:32:39,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:39,120 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 756 transitions. [2024-11-09 18:32:39,120 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 756 transitions. [2024-11-09 18:32:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 18:32:39,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:39,122 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:39,139 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-09 18:32:39,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:32:39,327 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:39,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash 134057127, now seen corresponding path program 1 times [2024-11-09 18:32:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:39,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73209086] [2024-11-09 18:32:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 18:32:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 18:32:39,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:39,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73209086] [2024-11-09 18:32:39,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73209086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:39,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:39,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:32:39,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716360198] [2024-11-09 18:32:39,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:39,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:32:39,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:39,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:32:39,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:32:39,425 INFO L87 Difference]: Start difference. First operand 591 states and 756 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 18:32:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:39,507 INFO L93 Difference]: Finished difference Result 646 states and 834 transitions. [2024-11-09 18:32:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:32:39,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 67 [2024-11-09 18:32:39,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:39,511 INFO L225 Difference]: With dead ends: 646 [2024-11-09 18:32:39,511 INFO L226 Difference]: Without dead ends: 643 [2024-11-09 18:32:39,512 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-09 18:32:39,512 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 10 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:39,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 466 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-09 18:32:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 622. [2024-11-09 18:32:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 563 states have (on average 1.266429840142096) internal successors, (713), 577 states have internal predecessors, (713), 48 states have call successors, (48), 8 states have call predecessors, (48), 10 states have return successors, (49), 39 states have call predecessors, (49), 46 states have call successors, (49) [2024-11-09 18:32:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 810 transitions. [2024-11-09 18:32:39,546 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 810 transitions. Word has length 67 [2024-11-09 18:32:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:39,546 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 810 transitions. [2024-11-09 18:32:39,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 18:32:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 810 transitions. [2024-11-09 18:32:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 18:32:39,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:39,549 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:39,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 18:32:39,549 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:39,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:39,550 INFO L85 PathProgramCache]: Analyzing trace with hash -408438474, now seen corresponding path program 1 times [2024-11-09 18:32:39,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:39,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20907419] [2024-11-09 18:32:39,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:39,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 18:32:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 18:32:39,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:39,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20907419] [2024-11-09 18:32:39,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20907419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:39,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:39,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:32:39,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854639528] [2024-11-09 18:32:39,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:39,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:32:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:39,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:32:39,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:32:39,675 INFO L87 Difference]: Start difference. First operand 622 states and 810 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 18:32:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:39,747 INFO L93 Difference]: Finished difference Result 814 states and 1068 transitions. [2024-11-09 18:32:39,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:32:39,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2024-11-09 18:32:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:39,751 INFO L225 Difference]: With dead ends: 814 [2024-11-09 18:32:39,751 INFO L226 Difference]: Without dead ends: 631 [2024-11-09 18:32:39,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:32:39,752 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:39,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-09 18:32:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2024-11-09 18:32:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 572 states have (on average 1.2622377622377623) internal successors, (722), 586 states have internal predecessors, (722), 48 states have call successors, (48), 8 states have call predecessors, (48), 10 states have return successors, (49), 39 states have call predecessors, (49), 46 states have call successors, (49) [2024-11-09 18:32:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 819 transitions. [2024-11-09 18:32:39,792 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 819 transitions. Word has length 68 [2024-11-09 18:32:39,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:39,793 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 819 transitions. [2024-11-09 18:32:39,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 18:32:39,793 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 819 transitions. [2024-11-09 18:32:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 18:32:39,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:39,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:39,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-09 18:32:39,795 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:39,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:39,796 INFO L85 PathProgramCache]: Analyzing trace with hash 237064328, now seen corresponding path program 1 times [2024-11-09 18:32:39,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:39,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095253830] [2024-11-09 18:32:39,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 18:32:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 18:32:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:39,874 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-09 18:32:39,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:39,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095253830] [2024-11-09 18:32:39,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095253830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:39,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:39,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 18:32:39,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090340077] [2024-11-09 18:32:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:39,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:39,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:39,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:39,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:39,876 INFO L87 Difference]: Start difference. First operand 631 states and 819 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 18:32:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:39,946 INFO L93 Difference]: Finished difference Result 674 states and 866 transitions. [2024-11-09 18:32:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:39,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2024-11-09 18:32:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:39,949 INFO L225 Difference]: With dead ends: 674 [2024-11-09 18:32:39,949 INFO L226 Difference]: Without dead ends: 651 [2024-11-09 18:32:39,950 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-09 18:32:39,950 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 16 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:39,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 680 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-09 18:32:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 623. [2024-11-09 18:32:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 561 states have (on average 1.2477718360071302) internal successors, (700), 578 states have internal predecessors, (700), 50 states have call successors, (50), 9 states have call predecessors, (50), 11 states have return successors, (51), 38 states have call predecessors, (51), 48 states have call successors, (51) [2024-11-09 18:32:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 801 transitions. [2024-11-09 18:32:39,977 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 801 transitions. Word has length 68 [2024-11-09 18:32:39,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:39,977 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 801 transitions. [2024-11-09 18:32:39,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 18:32:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 801 transitions. [2024-11-09 18:32:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 18:32:39,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:39,979 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:39,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 18:32:39,979 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:39,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1405147947, now seen corresponding path program 1 times [2024-11-09 18:32:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:39,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709120500] [2024-11-09 18:32:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:40,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 18:32:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:40,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 18:32:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 18:32:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 18:32:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 18:32:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:32:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709120500] [2024-11-09 18:32:40,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709120500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:40,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:40,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 18:32:40,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608208614] [2024-11-09 18:32:40,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:40,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:40,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:32:40,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:40,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:40,088 INFO L87 Difference]: Start difference. First operand 623 states and 801 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 18:32:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:40,190 INFO L93 Difference]: Finished difference Result 665 states and 855 transitions. [2024-11-09 18:32:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:40,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 69 [2024-11-09 18:32:40,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:40,193 INFO L225 Difference]: With dead ends: 665 [2024-11-09 18:32:40,194 INFO L226 Difference]: Without dead ends: 662 [2024-11-09 18:32:40,194 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-09 18:32:40,194 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 9 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:40,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 600 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-09 18:32:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 623. [2024-11-09 18:32:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 561 states have (on average 1.2477718360071302) internal successors, (700), 578 states have internal predecessors, (700), 50 states have call successors, (50), 9 states have call predecessors, (50), 11 states have return successors, (51), 38 states have call predecessors, (51), 48 states have call successors, (51) [2024-11-09 18:32:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 801 transitions. [2024-11-09 18:32:40,224 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 801 transitions. Word has length 69 [2024-11-09 18:32:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:40,225 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 801 transitions. [2024-11-09 18:32:40,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 18:32:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 801 transitions. [2024-11-09 18:32:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 18:32:40,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:40,226 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:40,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 18:32:40,227 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:40,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:40,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1554326305, now seen corresponding path program 1 times [2024-11-09 18:32:40,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:32:40,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693883087] [2024-11-09 18:32:40,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:40,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:32:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:32:40,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 18:32:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 18:32:40,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 18:32:40,312 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 18:32:40,313 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:32:40,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 18:32:40,318 INFO L407 BasicCegarLoop]: Path program histogram: [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-09 18:32:40,370 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:32:40,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:32:40 BoogieIcfgContainer [2024-11-09 18:32:40,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:32:40,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:32:40,375 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:32:40,376 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:32:40,376 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:18" (3/4) ... [2024-11-09 18:32:40,378 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-09 18:32:40,379 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:32:40,383 INFO L158 Benchmark]: Toolchain (without parser) took 23086.30ms. Allocated memory was 155.2MB in the beginning and 453.0MB in the end (delta: 297.8MB). Free memory was 98.7MB in the beginning and 158.0MB in the end (delta: -59.3MB). Peak memory consumption was 241.3MB. Max. memory is 16.1GB. [2024-11-09 18:32:40,383 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:32:40,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.37ms. Allocated memory is still 155.2MB. Free memory was 98.4MB in the beginning and 82.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 18:32:40,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.39ms. Allocated memory is still 155.2MB. Free memory was 82.2MB in the beginning and 80.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:32:40,384 INFO L158 Benchmark]: Boogie Preprocessor took 69.57ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 18:32:40,384 INFO L158 Benchmark]: IcfgBuilder took 715.24ms. Allocated memory is still 155.2MB. Free memory was 78.1MB in the beginning and 110.2MB in the end (delta: -32.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 18:32:40,384 INFO L158 Benchmark]: TraceAbstraction took 21915.77ms. Allocated memory was 155.2MB in the beginning and 453.0MB in the end (delta: 297.8MB). Free memory was 110.2MB in the beginning and 158.0MB in the end (delta: -47.8MB). Peak memory consumption was 249.7MB. Max. memory is 16.1GB. [2024-11-09 18:32:40,384 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 453.0MB. Free memory is still 158.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:32:40,385 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.18ms. Allocated memory is still 155.2MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.37ms. Allocated memory is still 155.2MB. Free memory was 98.4MB in the beginning and 82.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.39ms. Allocated memory is still 155.2MB. Free memory was 82.2MB in the beginning and 80.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.57ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 715.24ms. Allocated memory is still 155.2MB. Free memory was 78.1MB in the beginning and 110.2MB in the end (delta: -32.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21915.77ms. Allocated memory was 155.2MB in the beginning and 453.0MB in the end (delta: 297.8MB). Free memory was 110.2MB in the beginning and 158.0MB in the end (delta: -47.8MB). Peak memory consumption was 249.7MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 453.0MB. Free memory is still 158.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_add ; [L234] unsigned int zero ; [L235] int sa ; [L236] int sb ; [L237] int tmp ; [L238] int tmp___0 ; [L239] int tmp___1 ; [L240] int tmp___2 ; [L241] int tmp___3 ; [L242] int tmp___4 ; [L243] int tmp___5 ; [L244] int tmp___6 ; [L245] int tmp___7 ; [L246] int tmp___8 ; [L247] int tmp___9 ; [L248] int __retres23 ; VAL [ea=127, eb=127] [L252] 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] [L252] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=127] [L252] zero = base2flt(0, 0) [L253] 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] [L253] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=127, ma=4328521728, zero=0] [L253] a = base2flt(ma, ea) [L254] 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] [L254] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, zero=0] [L254] b = base2flt(mb, eb) [L256] COND FALSE !(a < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, zero=0] [L259] COND TRUE a > zero [L260] tmp = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, tmp=1, zero=0] [L264] sa = tmp VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, zero=0] [L266] COND FALSE !(b < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, zero=0] [L269] COND TRUE b > zero [L270] tmp___0 = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, tmp___0=1] [L274] sb = tmp___0 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, sb=1] [L277] CALL addflt(a, b) [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 [a=4294967295, b=4294967295] [L95] COND FALSE !(a < b) VAL [a=4294967295, b=4294967295] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 VAL [a=4294967295, b=4294967295, ea=127, ma=16777215] [L111] EXPR ma | (1U << 24U) VAL [a=4294967295, b=4294967295, ea=127] [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 VAL [a=4294967295, ea=127, eb=127, ma=-4278190079, mb=16777215] [L114] EXPR mb | (1U << 24U) VAL [a=4294967295, ea=127, eb=127, ma=-4278190079] [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 [a=4294967295, ea=127, eb=127, ma=-4278190079, mb=-4278190080] [L116] delta = ea - eb VAL [a=4294967295, delta=0, ea=127, ma=-4278190079, mb=-4278190080] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [a=4294967295, delta=0, ea=127, ma=-4278190079, mb=-4278190080] [L118] EXPR mb >> delta VAL [a=4294967295, ea=127, ma=-4278190079] [L118] mb = mb >> delta [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [a=4294967295, ea=127, ma=-8556380159] [L127] ma & (1U << 25U) VAL [a=4294967295, ea=127, ma=-8556380159] [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 3 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.8s, OverallIterations: 40, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2307 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2213 mSDsluCounter, 30048 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24567 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7038 IncrementalHoareTripleChecker+Invalid, 7173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 5481 mSDtfsCounter, 7038 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1783 GetRequests, 1441 SyntacticMatches, 1 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=702occurred in iteration=16, InterpolantAutomatonStates: 291, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 1759 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 2919 NumberOfCodeBlocks, 2919 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 3241 ConstructedInterpolants, 0 QuantifiedInterpolants, 7734 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2237 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 63 InterpolantComputations, 33 PerfectInterpolantSequences, 934/1097 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-09 18:32:40,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:32:42,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:32:42,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 18:32:42,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:32:42,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:32:42,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:32:42,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:32:42,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:32:42,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:32:42,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:32:42,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:32:42,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:32:42,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:32:42,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:32:42,785 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:32:42,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:32:42,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:32:42,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:32:42,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:32:42,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:32:42,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:32:42,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:32:42,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:32:42,789 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 18:32:42,789 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 18:32:42,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:32:42,789 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 18:32:42,790 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:32:42,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:32:42,791 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:32:42,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:32:42,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:32:42,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:32:42,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:32:42,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:32:42,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:32:42,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:32:42,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:32:42,793 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 18:32:42,793 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 18:32:42,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:32:42,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:32:42,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:32:42,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:32:42,794 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2024-11-09 18:32:43,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:32:43,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:32:43,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:32:43,158 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:32:43,159 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:32:43,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-09 18:32:44,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:32:44,966 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:32:44,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-09 18:32:44,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2bc628e9/44c8717f92bc4ab8835a5fc4cc412fe7/FLAG776058adb [2024-11-09 18:32:44,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2bc628e9/44c8717f92bc4ab8835a5fc4cc412fe7 [2024-11-09 18:32:44,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:32:45,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:32:45,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:32:45,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:32:45,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:32:45,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:32:44" (1/1) ... [2024-11-09 18:32:45,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccc788c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45, skipping insertion in model container [2024-11-09 18:32:45,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:32:44" (1/1) ... [2024-11-09 18:32:45,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:32:45,228 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_1-2a.c.cil.c[755,768] [2024-11-09 18:32:45,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:32:45,316 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:32:45,328 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_1-2a.c.cil.c[755,768] [2024-11-09 18:32:45,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:32:45,391 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:32:45,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45 WrapperNode [2024-11-09 18:32:45,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:32:45,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:32:45,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:32:45,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:32:45,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (1/1) ... [2024-11-09 18:32:45,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (1/1) ... [2024-11-09 18:32:45,439 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2024-11-09 18:32:45,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:32:45,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:32:45,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:32:45,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:32:45,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (1/1) ... [2024-11-09 18:32:45,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (1/1) ... [2024-11-09 18:32:45,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (1/1) ... [2024-11-09 18:32:45,480 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-09 18:32:45,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (1/1) ... [2024-11-09 18:32:45,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (1/1) ... [2024-11-09 18:32:45,494 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (1/1) ... [2024-11-09 18:32:45,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (1/1) ... [2024-11-09 18:32:45,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (1/1) ... [2024-11-09 18:32:45,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (1/1) ... [2024-11-09 18:32:45,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:32:45,501 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:32:45,501 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:32:45,501 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:32:45,505 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (1/1) ... [2024-11-09 18:32:45,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:32:45,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:32:45,534 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-09 18:32:45,536 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-09 18:32:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:32:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 18:32:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-09 18:32:45,582 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-09 18:32:45,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:32:45,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:32:45,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 18:32:45,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 18:32:45,655 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:32:45,658 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:32:46,065 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-09 18:32:46,065 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:32:46,081 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:32:46,082 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:32:46,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:46 BoogieIcfgContainer [2024-11-09 18:32:46,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:32:46,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:32:46,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:32:46,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:32:46,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:32:44" (1/3) ... [2024-11-09 18:32:46,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32239594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:32:46, skipping insertion in model container [2024-11-09 18:32:46,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:32:45" (2/3) ... [2024-11-09 18:32:46,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32239594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:32:46, skipping insertion in model container [2024-11-09 18:32:46,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:32:46" (3/3) ... [2024-11-09 18:32:46,093 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-11-09 18:32:46,110 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:32:46,110 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:32:46,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:32:46,183 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;@1b37f65b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:32:46,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:32:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 67 states have (on average 1.537313432835821) internal successors, (103), 70 states have internal predecessors, (103), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 18:32:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 18:32:46,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:46,197 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] [2024-11-09 18:32:46,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:46,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:46,204 INFO L85 PathProgramCache]: Analyzing trace with hash -498234503, now seen corresponding path program 1 times [2024-11-09 18:32:46,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:46,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738362311] [2024-11-09 18:32:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:46,217 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-09 18:32:46,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:46,221 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-09 18:32:46,222 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-09 18:32:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:46,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 18:32:46,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:46,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:46,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:46,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738362311] [2024-11-09 18:32:46,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738362311] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:46,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:46,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-09 18:32:46,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432675888] [2024-11-09 18:32:46,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:46,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:46,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:46,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:46,556 INFO L87 Difference]: Start difference. First operand has 79 states, 67 states have (on average 1.537313432835821) internal successors, (103), 70 states have internal predecessors, (103), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:46,662 INFO L93 Difference]: Finished difference Result 167 states and 266 transitions. [2024-11-09 18:32:46,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:46,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-09 18:32:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:46,673 INFO L225 Difference]: With dead ends: 167 [2024-11-09 18:32:46,673 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 18:32:46,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:46,679 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 5 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:46,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 558 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 18:32:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-09 18:32:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 74 states have internal predecessors, (102), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2024-11-09 18:32:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-11-09 18:32:46,722 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 33 [2024-11-09 18:32:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:46,723 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-11-09 18:32:46,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-11-09 18:32:46,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 18:32:46,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:46,728 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, 1, 1] [2024-11-09 18:32:46,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:46,928 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-09 18:32:46,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:46,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash -609035048, now seen corresponding path program 1 times [2024-11-09 18:32:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:46,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621244088] [2024-11-09 18:32:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:46,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:46,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:46,934 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-09 18:32:46,936 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-09 18:32:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:47,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 18:32:47,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:47,085 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-09 18:32:47,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:47,138 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-09 18:32:47,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:47,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621244088] [2024-11-09 18:32:47,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621244088] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:47,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:47,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-09 18:32:47,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006622057] [2024-11-09 18:32:47,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:47,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:47,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:47,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:47,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:47,146 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:47,260 INFO L93 Difference]: Finished difference Result 180 states and 270 transitions. [2024-11-09 18:32:47,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:47,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-09 18:32:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:47,263 INFO L225 Difference]: With dead ends: 180 [2024-11-09 18:32:47,263 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 18:32:47,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:32:47,265 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 43 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:47,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 465 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 18:32:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-09 18:32:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 110 states have (on average 1.4) internal successors, (154), 111 states have internal predecessors, (154), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 18 states have call predecessors, (22), 15 states have call successors, (22) [2024-11-09 18:32:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 192 transitions. [2024-11-09 18:32:47,288 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 192 transitions. Word has length 37 [2024-11-09 18:32:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:47,289 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 192 transitions. [2024-11-09 18:32:47,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:47,289 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 192 transitions. [2024-11-09 18:32:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 18:32:47,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:47,294 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, 1, 1] [2024-11-09 18:32:47,299 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-09 18:32:47,495 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-09 18:32:47,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:47,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash -902438055, now seen corresponding path program 1 times [2024-11-09 18:32:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:47,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253498402] [2024-11-09 18:32:47,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:47,497 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-09 18:32:47,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:47,502 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-09 18:32:47,503 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-09 18:32:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:47,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 18:32:47,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:47,637 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-09 18:32:47,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:47,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:47,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253498402] [2024-11-09 18:32:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253498402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:47,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:47,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 18:32:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13009733] [2024-11-09 18:32:47,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:47,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:32:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:32:47,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:47,640 INFO L87 Difference]: Start difference. First operand 130 states and 192 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:47,784 INFO L93 Difference]: Finished difference Result 271 states and 403 transitions. [2024-11-09 18:32:47,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:32:47,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-09 18:32:47,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:47,787 INFO L225 Difference]: With dead ends: 271 [2024-11-09 18:32:47,787 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 18:32:47,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:47,789 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 34 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:47,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 547 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 18:32:47,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2024-11-09 18:32:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 172 states have (on average 1.372093023255814) internal successors, (236), 171 states have internal predecessors, (236), 20 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (26), 26 states have call predecessors, (26), 19 states have call successors, (26) [2024-11-09 18:32:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 282 transitions. [2024-11-09 18:32:47,807 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 282 transitions. Word has length 37 [2024-11-09 18:32:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:47,808 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 282 transitions. [2024-11-09 18:32:47,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 282 transitions. [2024-11-09 18:32:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 18:32:47,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:47,811 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, 1, 1, 1] [2024-11-09 18:32:47,816 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-09 18:32:48,011 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-09 18:32:48,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:48,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1361724464, now seen corresponding path program 1 times [2024-11-09 18:32:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:48,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649752521] [2024-11-09 18:32:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:48,014 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-09 18:32:48,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:48,017 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-09 18:32:48,018 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-09 18:32:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:48,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 18:32:48,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:48,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 18:32:48,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:48,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649752521] [2024-11-09 18:32:48,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649752521] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:48,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-09 18:32:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894565666] [2024-11-09 18:32:48,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:48,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 18:32:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:48,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 18:32:48,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 18:32:48,407 INFO L87 Difference]: Start difference. First operand 196 states and 282 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 18:32:48,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:48,616 INFO L93 Difference]: Finished difference Result 294 states and 430 transitions. [2024-11-09 18:32:48,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 18:32:48,617 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2024-11-09 18:32:48,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:48,619 INFO L225 Difference]: With dead ends: 294 [2024-11-09 18:32:48,619 INFO L226 Difference]: Without dead ends: 221 [2024-11-09 18:32:48,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 18:32:48,622 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 9 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:48,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1221 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-09 18:32:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 211. [2024-11-09 18:32:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 186 states have (on average 1.3494623655913978) internal successors, (251), 184 states have internal predecessors, (251), 20 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (33), 28 states have call predecessors, (33), 19 states have call successors, (33) [2024-11-09 18:32:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 304 transitions. [2024-11-09 18:32:48,641 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 304 transitions. Word has length 42 [2024-11-09 18:32:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:48,642 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 304 transitions. [2024-11-09 18:32:48,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 18:32:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 304 transitions. [2024-11-09 18:32:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 18:32:48,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:48,644 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, 1, 1, 1] [2024-11-09 18:32:48,652 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-09 18:32:48,847 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-09 18:32:48,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:48,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:48,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1558237969, now seen corresponding path program 1 times [2024-11-09 18:32:48,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:48,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980860724] [2024-11-09 18:32:48,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:48,849 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-09 18:32:48,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:48,851 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-09 18:32:48,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 18:32:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:48,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 18:32:48,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:48,974 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-09 18:32:48,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:49,025 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-09 18:32:49,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:49,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980860724] [2024-11-09 18:32:49,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980860724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:49,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:49,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-09 18:32:49,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371336572] [2024-11-09 18:32:49,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:49,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 18:32:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:49,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 18:32:49,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:49,030 INFO L87 Difference]: Start difference. First operand 211 states and 304 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:49,161 INFO L93 Difference]: Finished difference Result 245 states and 353 transitions. [2024-11-09 18:32:49,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 18:32:49,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-09 18:32:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:49,163 INFO L225 Difference]: With dead ends: 245 [2024-11-09 18:32:49,163 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 18:32:49,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:32:49,166 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 29 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:49,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 632 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 18:32:49,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2024-11-09 18:32:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 177 states have internal predecessors, (240), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (31), 26 states have call predecessors, (31), 17 states have call successors, (31) [2024-11-09 18:32:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 289 transitions. [2024-11-09 18:32:49,188 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 289 transitions. Word has length 42 [2024-11-09 18:32:49,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:49,189 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 289 transitions. [2024-11-09 18:32:49,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 289 transitions. [2024-11-09 18:32:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 18:32:49,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:49,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:49,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 18:32:49,396 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-09 18:32:49,396 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:49,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash -384428755, now seen corresponding path program 1 times [2024-11-09 18:32:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:49,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178928839] [2024-11-09 18:32:49,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:49,398 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-09 18:32:49,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:49,399 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-09 18:32:49,400 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-09 18:32:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:49,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:32:49,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:49,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:49,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:49,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178928839] [2024-11-09 18:32:49,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178928839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:49,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:49,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:49,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365319891] [2024-11-09 18:32:49,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:49,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:49,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:49,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:49,495 INFO L87 Difference]: Start difference. First operand 202 states and 289 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:49,519 INFO L93 Difference]: Finished difference Result 331 states and 476 transitions. [2024-11-09 18:32:49,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:49,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-09 18:32:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:49,521 INFO L225 Difference]: With dead ends: 331 [2024-11-09 18:32:49,521 INFO L226 Difference]: Without dead ends: 260 [2024-11-09 18:32:49,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:49,522 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 15 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:49,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 363 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-09 18:32:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-11-09 18:32:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 233 states have internal predecessors, (308), 20 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (33), 28 states have call predecessors, (33), 19 states have call successors, (33) [2024-11-09 18:32:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 361 transitions. [2024-11-09 18:32:49,536 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 361 transitions. Word has length 44 [2024-11-09 18:32:49,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:49,536 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 361 transitions. [2024-11-09 18:32:49,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 361 transitions. [2024-11-09 18:32:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 18:32:49,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:49,538 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, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:49,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 18:32:49,745 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-09 18:32:49,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:49,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:49,746 INFO L85 PathProgramCache]: Analyzing trace with hash 806937818, now seen corresponding path program 1 times [2024-11-09 18:32:49,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:49,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794986331] [2024-11-09 18:32:49,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:49,747 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-09 18:32:49,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:49,750 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-09 18:32:49,751 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-09 18:32:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:49,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:32:49,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 18:32:49,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:49,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:49,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794986331] [2024-11-09 18:32:49,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794986331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:49,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:49,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:49,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222742519] [2024-11-09 18:32:49,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:49,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:49,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:49,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:49,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:49,822 INFO L87 Difference]: Start difference. First operand 260 states and 361 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:49,876 INFO L93 Difference]: Finished difference Result 465 states and 636 transitions. [2024-11-09 18:32:49,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:32:49,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2024-11-09 18:32:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:49,880 INFO L225 Difference]: With dead ends: 465 [2024-11-09 18:32:49,881 INFO L226 Difference]: Without dead ends: 208 [2024-11-09 18:32:49,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:32:49,883 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 34 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:49,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 272 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-09 18:32:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 193. [2024-11-09 18:32:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 174 states have (on average 1.264367816091954) internal successors, (220), 175 states have internal predecessors, (220), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (21), 17 states have call predecessors, (21), 12 states have call successors, (21) [2024-11-09 18:32:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 254 transitions. [2024-11-09 18:32:49,906 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 254 transitions. Word has length 45 [2024-11-09 18:32:49,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:49,906 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 254 transitions. [2024-11-09 18:32:49,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 254 transitions. [2024-11-09 18:32:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 18:32:49,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:49,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:49,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 18:32:50,111 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-09 18:32:50,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:50,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:50,112 INFO L85 PathProgramCache]: Analyzing trace with hash 230080277, now seen corresponding path program 1 times [2024-11-09 18:32:50,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:50,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919687038] [2024-11-09 18:32:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:50,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:50,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:50,116 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-09 18:32:50,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 18:32:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:50,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 18:32:50,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:50,302 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-09 18:32:50,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:50,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:50,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919687038] [2024-11-09 18:32:50,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919687038] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:50,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:50,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-09 18:32:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852855509] [2024-11-09 18:32:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:50,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:50,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:32:50,393 INFO L87 Difference]: Start difference. First operand 193 states and 254 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:50,558 INFO L93 Difference]: Finished difference Result 284 states and 385 transitions. [2024-11-09 18:32:50,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:50,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 18:32:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:50,562 INFO L225 Difference]: With dead ends: 284 [2024-11-09 18:32:50,562 INFO L226 Difference]: Without dead ends: 245 [2024-11-09 18:32:50,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:32:50,563 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 25 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:50,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 402 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-09 18:32:50,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 233. [2024-11-09 18:32:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 210 states have (on average 1.2619047619047619) internal successors, (265), 212 states have internal predecessors, (265), 17 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (25), 21 states have call predecessors, (25), 16 states have call successors, (25) [2024-11-09 18:32:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 307 transitions. [2024-11-09 18:32:50,584 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 307 transitions. Word has length 46 [2024-11-09 18:32:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:50,584 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 307 transitions. [2024-11-09 18:32:50,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 307 transitions. [2024-11-09 18:32:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 18:32:50,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:50,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:50,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 18:32:50,786 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-09 18:32:50,787 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:50,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:50,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1972890612, now seen corresponding path program 1 times [2024-11-09 18:32:50,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:50,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478713632] [2024-11-09 18:32:50,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:50,787 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-09 18:32:50,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:50,790 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-09 18:32:50,791 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-09 18:32:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:50,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 18:32:50,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:50,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:50,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:50,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478713632] [2024-11-09 18:32:50,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478713632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:50,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:50,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:32:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599362068] [2024-11-09 18:32:50,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:50,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:32:50,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:50,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:32:50,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:32:50,854 INFO L87 Difference]: Start difference. First operand 233 states and 307 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:50,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:50,881 INFO L93 Difference]: Finished difference Result 241 states and 314 transitions. [2024-11-09 18:32:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:32:50,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-09 18:32:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:50,882 INFO L225 Difference]: With dead ends: 241 [2024-11-09 18:32:50,882 INFO L226 Difference]: Without dead ends: 233 [2024-11-09 18:32:50,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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-09 18:32:50,883 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 3 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:50,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 403 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-09 18:32:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-09 18:32:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 210 states have (on average 1.2476190476190476) internal successors, (262), 212 states have internal predecessors, (262), 17 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (25), 21 states have call predecessors, (25), 16 states have call successors, (25) [2024-11-09 18:32:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 304 transitions. [2024-11-09 18:32:50,894 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 304 transitions. Word has length 46 [2024-11-09 18:32:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:50,895 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 304 transitions. [2024-11-09 18:32:50,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 304 transitions. [2024-11-09 18:32:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 18:32:50,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:50,897 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:50,900 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-09 18:32:51,097 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-09 18:32:51,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:51,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:51,098 INFO L85 PathProgramCache]: Analyzing trace with hash 154428356, now seen corresponding path program 1 times [2024-11-09 18:32:51,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:51,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114203883] [2024-11-09 18:32:51,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:51,099 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-09 18:32:51,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:51,101 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-09 18:32:51,102 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-09 18:32:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:51,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:32:51,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:51,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:51,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:51,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114203883] [2024-11-09 18:32:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114203883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:51,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771323203] [2024-11-09 18:32:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:51,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:51,166 INFO L87 Difference]: Start difference. First operand 233 states and 304 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:51,186 INFO L93 Difference]: Finished difference Result 375 states and 498 transitions. [2024-11-09 18:32:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:51,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-09 18:32:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:51,188 INFO L225 Difference]: With dead ends: 375 [2024-11-09 18:32:51,188 INFO L226 Difference]: Without dead ends: 319 [2024-11-09 18:32:51,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:51,189 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 29 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:51,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 333 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-09 18:32:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 252. [2024-11-09 18:32:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 228 states have (on average 1.2543859649122806) internal successors, (286), 229 states have internal predecessors, (286), 18 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (26), 22 states have call predecessors, (26), 17 states have call successors, (26) [2024-11-09 18:32:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 330 transitions. [2024-11-09 18:32:51,205 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 330 transitions. Word has length 47 [2024-11-09 18:32:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:51,205 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 330 transitions. [2024-11-09 18:32:51,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 330 transitions. [2024-11-09 18:32:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 18:32:51,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:51,207 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] [2024-11-09 18:32:51,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:51,407 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-09 18:32:51,407 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:51,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1448071523, now seen corresponding path program 1 times [2024-11-09 18:32:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:51,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219605294] [2024-11-09 18:32:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:51,408 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-09 18:32:51,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:51,410 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-09 18:32:51,410 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-09 18:32:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:51,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 18:32:51,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:51,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:51,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:51,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219605294] [2024-11-09 18:32:51,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219605294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:51,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:51,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 18:32:51,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176026823] [2024-11-09 18:32:51,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:51,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 18:32:51,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:51,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 18:32:51,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 18:32:51,575 INFO L87 Difference]: Start difference. First operand 252 states and 330 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:51,844 INFO L93 Difference]: Finished difference Result 541 states and 742 transitions. [2024-11-09 18:32:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 18:32:51,845 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-11-09 18:32:51,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:51,847 INFO L225 Difference]: With dead ends: 541 [2024-11-09 18:32:51,847 INFO L226 Difference]: Without dead ends: 465 [2024-11-09 18:32:51,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 18:32:51,848 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 78 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:51,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 999 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:51,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-09 18:32:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 338. [2024-11-09 18:32:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 304 states have (on average 1.2763157894736843) internal successors, (388), 303 states have internal predecessors, (388), 28 states have call successors, (28), 2 states have call predecessors, (28), 5 states have return successors, (39), 34 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-09 18:32:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 455 transitions. [2024-11-09 18:32:51,863 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 455 transitions. Word has length 47 [2024-11-09 18:32:51,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:51,864 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 455 transitions. [2024-11-09 18:32:51,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 455 transitions. [2024-11-09 18:32:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 18:32:51,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:51,865 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] [2024-11-09 18:32:51,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 18:32:52,068 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-09 18:32:52,068 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:52,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1959392092, now seen corresponding path program 1 times [2024-11-09 18:32:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853337745] [2024-11-09 18:32:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:52,069 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-09 18:32:52,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:52,070 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-09 18:32:52,071 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-09 18:32:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:52,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 18:32:52,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:32:52,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:52,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:52,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853337745] [2024-11-09 18:32:52,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853337745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:52,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:52,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 18:32:52,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847153145] [2024-11-09 18:32:52,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:52,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 18:32:52,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:52,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 18:32:52,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 18:32:52,293 INFO L87 Difference]: Start difference. First operand 338 states and 455 transitions. Second operand has 12 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:52,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:52,655 INFO L93 Difference]: Finished difference Result 420 states and 558 transitions. [2024-11-09 18:32:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 18:32:52,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-11-09 18:32:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:52,658 INFO L225 Difference]: With dead ends: 420 [2024-11-09 18:32:52,658 INFO L226 Difference]: Without dead ends: 417 [2024-11-09 18:32:52,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-09 18:32:52,659 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 80 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:52,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1246 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:32:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-09 18:32:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 343. [2024-11-09 18:32:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 307 states have (on average 1.273615635179153) internal successors, (391), 307 states have internal predecessors, (391), 29 states have call successors, (29), 3 states have call predecessors, (29), 6 states have return successors, (40), 34 states have call predecessors, (40), 28 states have call successors, (40) [2024-11-09 18:32:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 460 transitions. [2024-11-09 18:32:52,675 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 460 transitions. Word has length 47 [2024-11-09 18:32:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:52,675 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 460 transitions. [2024-11-09 18:32:52,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 460 transitions. [2024-11-09 18:32:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 18:32:52,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:52,677 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:52,681 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-09 18:32:52,877 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-09 18:32:52,878 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:52,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:52,879 INFO L85 PathProgramCache]: Analyzing trace with hash -703775249, now seen corresponding path program 1 times [2024-11-09 18:32:52,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:52,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803718508] [2024-11-09 18:32:52,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:52,879 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-09 18:32:52,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:52,882 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-09 18:32:52,883 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-09 18:32:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:52,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 18:32:52,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 18:32:53,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:53,202 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-09 18:32:53,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:53,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803718508] [2024-11-09 18:32:53,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803718508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:53,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:53,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2024-11-09 18:32:53,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262718124] [2024-11-09 18:32:53,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:53,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 18:32:53,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:53,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 18:32:53,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 18:32:53,205 INFO L87 Difference]: Start difference. First operand 343 states and 460 transitions. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 13 states have internal predecessors, (47), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 18:32:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:53,723 INFO L93 Difference]: Finished difference Result 541 states and 720 transitions. [2024-11-09 18:32:53,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 18:32:53,724 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 13 states have internal predecessors, (47), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2024-11-09 18:32:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:53,726 INFO L225 Difference]: With dead ends: 541 [2024-11-09 18:32:53,726 INFO L226 Difference]: Without dead ends: 397 [2024-11-09 18:32:53,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-09 18:32:53,728 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 127 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:53,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1033 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:32:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-09 18:32:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 313. [2024-11-09 18:32:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 283 states have (on average 1.2367491166077738) internal successors, (350), 281 states have internal predecessors, (350), 23 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (34), 30 states have call predecessors, (34), 22 states have call successors, (34) [2024-11-09 18:32:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 407 transitions. [2024-11-09 18:32:53,743 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 407 transitions. Word has length 48 [2024-11-09 18:32:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:53,744 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 407 transitions. [2024-11-09 18:32:53,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 13 states have internal predecessors, (47), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 18:32:53,744 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 407 transitions. [2024-11-09 18:32:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 18:32:53,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:53,745 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:53,749 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-09 18:32:53,945 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-09 18:32:53,946 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:53,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash 380241937, now seen corresponding path program 1 times [2024-11-09 18:32:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:53,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061179440] [2024-11-09 18:32:53,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:53,947 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-09 18:32:53,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:53,948 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-09 18:32:53,949 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-09 18:32:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:53,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 18:32:53,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:54,123 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-09 18:32:54,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:54,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:54,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061179440] [2024-11-09 18:32:54,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061179440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:54,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [158470336] [2024-11-09 18:32:54,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:54,320 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 18:32:54,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 18:32:54,324 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 18:32:54,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-09 18:32:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:54,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 18:32:54,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:54,500 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-09 18:32:54,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [158470336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:54,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:54,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-09 18:32:54,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927789996] [2024-11-09 18:32:54,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:54,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 18:32:54,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:54,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 18:32:54,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-09 18:32:54,553 INFO L87 Difference]: Start difference. First operand 313 states and 407 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:54,780 INFO L93 Difference]: Finished difference Result 361 states and 467 transitions. [2024-11-09 18:32:54,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 18:32:54,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2024-11-09 18:32:54,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:54,783 INFO L225 Difference]: With dead ends: 361 [2024-11-09 18:32:54,783 INFO L226 Difference]: Without dead ends: 358 [2024-11-09 18:32:54,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-09 18:32:54,784 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 49 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:54,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 981 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-09 18:32:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 317. [2024-11-09 18:32:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 286 states have (on average 1.2342657342657342) internal successors, (353), 284 states have internal predecessors, (353), 23 states have call successors, (23), 4 states have call predecessors, (23), 7 states have return successors, (34), 30 states have call predecessors, (34), 22 states have call successors, (34) [2024-11-09 18:32:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 410 transitions. [2024-11-09 18:32:54,798 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 410 transitions. Word has length 48 [2024-11-09 18:32:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:54,798 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 410 transitions. [2024-11-09 18:32:54,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 410 transitions. [2024-11-09 18:32:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 18:32:54,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:54,800 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:54,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:55,005 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 (15)] Ended with exit code 0 [2024-11-09 18:32:55,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-09 18:32:55,202 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:55,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:55,203 INFO L85 PathProgramCache]: Analyzing trace with hash 149817242, now seen corresponding path program 1 times [2024-11-09 18:32:55,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:55,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023285858] [2024-11-09 18:32:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:55,204 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-09 18:32:55,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:55,205 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-09 18:32:55,206 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-09 18:32:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:55,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 18:32:55,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:55,372 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-09 18:32:55,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:55,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023285858] [2024-11-09 18:32:55,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023285858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:55,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:55,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 18:32:55,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158869251] [2024-11-09 18:32:55,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:55,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:32:55,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:55,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:32:55,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:32:55,375 INFO L87 Difference]: Start difference. First operand 317 states and 410 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:55,642 INFO L93 Difference]: Finished difference Result 470 states and 620 transitions. [2024-11-09 18:32:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 18:32:55,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-09 18:32:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:55,645 INFO L225 Difference]: With dead ends: 470 [2024-11-09 18:32:55,645 INFO L226 Difference]: Without dead ends: 421 [2024-11-09 18:32:55,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-09 18:32:55,647 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 59 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:55,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1117 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:55,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-09 18:32:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 405. [2024-11-09 18:32:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 364 states have (on average 1.2472527472527473) internal successors, (454), 364 states have internal predecessors, (454), 32 states have call successors, (32), 5 states have call predecessors, (32), 8 states have return successors, (43), 39 states have call predecessors, (43), 31 states have call successors, (43) [2024-11-09 18:32:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 529 transitions. [2024-11-09 18:32:55,669 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 529 transitions. Word has length 48 [2024-11-09 18:32:55,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:55,669 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 529 transitions. [2024-11-09 18:32:55,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 529 transitions. [2024-11-09 18:32:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 18:32:55,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:55,671 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-09 18:32:55,675 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-09 18:32:55,872 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-09 18:32:55,873 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:55,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:55,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1407448615, now seen corresponding path program 1 times [2024-11-09 18:32:55,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:55,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491778684] [2024-11-09 18:32:55,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:55,874 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-09 18:32:55,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:55,875 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-09 18:32:55,877 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-09 18:32:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:55,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 18:32:55,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:56,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:56,174 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-09 18:32:56,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:56,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491778684] [2024-11-09 18:32:56,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491778684] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 18:32:56,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:32:56,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-09 18:32:56,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766086759] [2024-11-09 18:32:56,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:56,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:32:56,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:56,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:32:56,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-09 18:32:56,176 INFO L87 Difference]: Start difference. First operand 405 states and 529 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:56,251 INFO L93 Difference]: Finished difference Result 412 states and 535 transitions. [2024-11-09 18:32:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:56,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-09 18:32:56,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:56,253 INFO L225 Difference]: With dead ends: 412 [2024-11-09 18:32:56,254 INFO L226 Difference]: Without dead ends: 409 [2024-11-09 18:32:56,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-09 18:32:56,255 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:56,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 480 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-09 18:32:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2024-11-09 18:32:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 367 states have (on average 1.2452316076294279) internal successors, (457), 367 states have internal predecessors, (457), 32 states have call successors, (32), 6 states have call predecessors, (32), 9 states have return successors, (43), 39 states have call predecessors, (43), 31 states have call successors, (43) [2024-11-09 18:32:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 532 transitions. [2024-11-09 18:32:56,273 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 532 transitions. Word has length 49 [2024-11-09 18:32:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:56,273 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 532 transitions. [2024-11-09 18:32:56,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 532 transitions. [2024-11-09 18:32:56,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 18:32:56,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:56,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:56,279 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-09 18:32:56,477 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-09 18:32:56,478 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:56,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash -857492976, now seen corresponding path program 1 times [2024-11-09 18:32:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:56,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8201268] [2024-11-09 18:32:56,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:56,479 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-09 18:32:56,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:56,482 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-09 18:32:56,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 18:32:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:56,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:32:56,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:56,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:56,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:56,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8201268] [2024-11-09 18:32:56,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8201268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:56,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:56,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067668088] [2024-11-09 18:32:56,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:56,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:56,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:56,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:56,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:56,538 INFO L87 Difference]: Start difference. First operand 409 states and 532 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:56,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:56,556 INFO L93 Difference]: Finished difference Result 429 states and 554 transitions. [2024-11-09 18:32:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:56,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 18:32:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:56,560 INFO L225 Difference]: With dead ends: 429 [2024-11-09 18:32:56,560 INFO L226 Difference]: Without dead ends: 379 [2024-11-09 18:32:56,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:56,561 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:56,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-09 18:32:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-09 18:32:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 337 states have (on average 1.2462908011869436) internal successors, (420), 338 states have internal predecessors, (420), 32 states have call successors, (32), 6 states have call predecessors, (32), 9 states have return successors, (41), 38 states have call predecessors, (41), 31 states have call successors, (41) [2024-11-09 18:32:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 493 transitions. [2024-11-09 18:32:56,584 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 493 transitions. Word has length 50 [2024-11-09 18:32:56,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:56,584 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 493 transitions. [2024-11-09 18:32:56,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:56,584 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 493 transitions. [2024-11-09 18:32:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:32:56,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:56,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:56,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-09 18:32:56,786 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-09 18:32:56,787 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:56,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:56,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1537745591, now seen corresponding path program 1 times [2024-11-09 18:32:56,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:56,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549606689] [2024-11-09 18:32:56,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:56,788 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-09 18:32:56,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:56,789 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-09 18:32:56,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 18:32:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:56,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 18:32:56,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:56,978 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-09 18:32:56,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:56,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:56,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549606689] [2024-11-09 18:32:56,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549606689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:56,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:56,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 18:32:56,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407289068] [2024-11-09 18:32:56,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:56,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:32:56,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:56,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:32:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:32:56,981 INFO L87 Difference]: Start difference. First operand 379 states and 493 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:57,223 INFO L93 Difference]: Finished difference Result 450 states and 588 transitions. [2024-11-09 18:32:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 18:32:57,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-09 18:32:57,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:57,226 INFO L225 Difference]: With dead ends: 450 [2024-11-09 18:32:57,226 INFO L226 Difference]: Without dead ends: 413 [2024-11-09 18:32:57,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:32:57,227 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 75 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:57,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 683 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-09 18:32:57,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 401. [2024-11-09 18:32:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 355 states have (on average 1.2422535211267605) internal successors, (441), 358 states have internal predecessors, (441), 36 states have call successors, (36), 6 states have call predecessors, (36), 9 states have return successors, (44), 41 states have call predecessors, (44), 34 states have call successors, (44) [2024-11-09 18:32:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 521 transitions. [2024-11-09 18:32:57,245 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 521 transitions. Word has length 53 [2024-11-09 18:32:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:57,245 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 521 transitions. [2024-11-09 18:32:57,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 521 transitions. [2024-11-09 18:32:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:32:57,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:57,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:57,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:57,449 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-09 18:32:57,450 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:57,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1321726846, now seen corresponding path program 1 times [2024-11-09 18:32:57,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:57,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774180156] [2024-11-09 18:32:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:57,451 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-09 18:32:57,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:57,453 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-09 18:32:57,456 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-09 18:32:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:57,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:32:57,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:57,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:57,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:57,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774180156] [2024-11-09 18:32:57,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774180156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:57,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:57,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:57,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600819985] [2024-11-09 18:32:57,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:57,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:57,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:57,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:57,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:57,528 INFO L87 Difference]: Start difference. First operand 401 states and 521 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:57,553 INFO L93 Difference]: Finished difference Result 451 states and 581 transitions. [2024-11-09 18:32:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:57,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-09 18:32:57,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:57,555 INFO L225 Difference]: With dead ends: 451 [2024-11-09 18:32:57,555 INFO L226 Difference]: Without dead ends: 401 [2024-11-09 18:32:57,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:57,556 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 26 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:57,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 294 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:57,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-09 18:32:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2024-11-09 18:32:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 355 states have (on average 1.2028169014084507) internal successors, (427), 358 states have internal predecessors, (427), 36 states have call successors, (36), 6 states have call predecessors, (36), 9 states have return successors, (44), 41 states have call predecessors, (44), 34 states have call successors, (44) [2024-11-09 18:32:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 507 transitions. [2024-11-09 18:32:57,573 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 507 transitions. Word has length 53 [2024-11-09 18:32:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:57,574 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 507 transitions. [2024-11-09 18:32:57,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 507 transitions. [2024-11-09 18:32:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 18:32:57,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:57,575 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-09 18:32:57,579 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 (21)] Ended with exit code 0 [2024-11-09 18:32:57,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:57,778 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:57,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:57,778 INFO L85 PathProgramCache]: Analyzing trace with hash -492787207, now seen corresponding path program 1 times [2024-11-09 18:32:57,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:57,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043494879] [2024-11-09 18:32:57,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:57,779 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-09 18:32:57,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:57,780 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:32:57,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 18:32:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:57,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 18:32:57,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:57,844 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-09 18:32:57,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:57,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:57,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043494879] [2024-11-09 18:32:57,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043494879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:57,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:57,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:57,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272612818] [2024-11-09 18:32:57,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:57,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:57,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:57,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:57,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:57,846 INFO L87 Difference]: Start difference. First operand 401 states and 507 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:57,911 INFO L93 Difference]: Finished difference Result 465 states and 587 transitions. [2024-11-09 18:32:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:57,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-09 18:32:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:57,914 INFO L225 Difference]: With dead ends: 465 [2024-11-09 18:32:57,914 INFO L226 Difference]: Without dead ends: 432 [2024-11-09 18:32:57,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:32:57,916 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 42 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:57,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 269 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-09 18:32:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 402. [2024-11-09 18:32:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 356 states have (on average 1.196629213483146) internal successors, (426), 359 states have internal predecessors, (426), 36 states have call successors, (36), 6 states have call predecessors, (36), 9 states have return successors, (44), 41 states have call predecessors, (44), 34 states have call successors, (44) [2024-11-09 18:32:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 506 transitions. [2024-11-09 18:32:57,936 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 506 transitions. Word has length 53 [2024-11-09 18:32:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:57,936 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 506 transitions. [2024-11-09 18:32:57,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:57,937 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 506 transitions. [2024-11-09 18:32:57,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 18:32:57,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:57,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:57,942 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 (22)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:58,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:58,139 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:58,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:58,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1444865500, now seen corresponding path program 1 times [2024-11-09 18:32:58,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:58,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168846381] [2024-11-09 18:32:58,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:58,140 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-09 18:32:58,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:58,143 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:32:58,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-09 18:32:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:58,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 18:32:58,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:58,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:58,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168846381] [2024-11-09 18:32:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168846381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:58,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:58,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 18:32:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139579127] [2024-11-09 18:32:58,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:58,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:32:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:58,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:32:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:58,248 INFO L87 Difference]: Start difference. First operand 402 states and 506 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:58,417 INFO L93 Difference]: Finished difference Result 523 states and 662 transitions. [2024-11-09 18:32:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 18:32:58,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-09 18:32:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:58,419 INFO L225 Difference]: With dead ends: 523 [2024-11-09 18:32:58,419 INFO L226 Difference]: Without dead ends: 496 [2024-11-09 18:32:58,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:58,421 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 27 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:58,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 588 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:32:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-09 18:32:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 416. [2024-11-09 18:32:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 366 states have (on average 1.2021857923497268) internal successors, (440), 371 states have internal predecessors, (440), 40 states have call successors, (40), 6 states have call predecessors, (40), 9 states have return successors, (48), 44 states have call predecessors, (48), 38 states have call successors, (48) [2024-11-09 18:32:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 528 transitions. [2024-11-09 18:32:58,443 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 528 transitions. Word has length 54 [2024-11-09 18:32:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:58,444 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 528 transitions. [2024-11-09 18:32:58,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 528 transitions. [2024-11-09 18:32:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 18:32:58,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:58,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:58,449 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 (23)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:58,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:58,647 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:58,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:58,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1598950488, now seen corresponding path program 1 times [2024-11-09 18:32:58,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:58,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819745298] [2024-11-09 18:32:58,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:58,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:58,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:58,649 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:32:58,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-09 18:32:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:58,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 18:32:58,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:58,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:32:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:32:58,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:58,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819745298] [2024-11-09 18:32:58,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819745298] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:32:58,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:32:58,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-11-09 18:32:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634736189] [2024-11-09 18:32:58,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:32:58,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 18:32:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:58,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 18:32:58,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:58,805 INFO L87 Difference]: Start difference. First operand 416 states and 528 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:58,886 INFO L93 Difference]: Finished difference Result 451 states and 568 transitions. [2024-11-09 18:32:58,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:32:58,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2024-11-09 18:32:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:58,888 INFO L225 Difference]: With dead ends: 451 [2024-11-09 18:32:58,889 INFO L226 Difference]: Without dead ends: 412 [2024-11-09 18:32:58,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:32:58,889 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 20 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:58,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 611 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-09 18:32:58,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 397. [2024-11-09 18:32:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 347 states have (on average 1.2046109510086456) internal successors, (418), 353 states have internal predecessors, (418), 40 states have call successors, (40), 6 states have call predecessors, (40), 9 states have return successors, (48), 43 states have call predecessors, (48), 38 states have call successors, (48) [2024-11-09 18:32:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 506 transitions. [2024-11-09 18:32:58,907 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 506 transitions. Word has length 54 [2024-11-09 18:32:58,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:58,908 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 506 transitions. [2024-11-09 18:32:58,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 18:32:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 506 transitions. [2024-11-09 18:32:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 18:32:58,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:58,909 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:58,912 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 (24)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:59,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:59,109 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:59,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:59,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1929153135, now seen corresponding path program 1 times [2024-11-09 18:32:59,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:59,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630509748] [2024-11-09 18:32:59,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:59,110 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-09 18:32:59,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:59,113 INFO L229 MonitoredProcess]: Starting monitored process 25 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-09 18:32:59,114 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 (25)] Waiting until timeout for monitored process [2024-11-09 18:32:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:59,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 18:32:59,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:59,186 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-09 18:32:59,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:59,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:59,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630509748] [2024-11-09 18:32:59,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630509748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:59,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:59,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 18:32:59,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559254388] [2024-11-09 18:32:59,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:59,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:32:59,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:59,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:32:59,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:32:59,188 INFO L87 Difference]: Start difference. First operand 397 states and 506 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:59,286 INFO L93 Difference]: Finished difference Result 485 states and 612 transitions. [2024-11-09 18:32:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 18:32:59,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-09 18:32:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:59,288 INFO L225 Difference]: With dead ends: 485 [2024-11-09 18:32:59,289 INFO L226 Difference]: Without dead ends: 422 [2024-11-09 18:32:59,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:32:59,290 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 58 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:59,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 381 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:32:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-09 18:32:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 397. [2024-11-09 18:32:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 347 states have (on average 1.1988472622478386) internal successors, (416), 353 states have internal predecessors, (416), 40 states have call successors, (40), 6 states have call predecessors, (40), 9 states have return successors, (48), 43 states have call predecessors, (48), 38 states have call successors, (48) [2024-11-09 18:32:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 504 transitions. [2024-11-09 18:32:59,311 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 504 transitions. Word has length 54 [2024-11-09 18:32:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:59,311 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 504 transitions. [2024-11-09 18:32:59,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 504 transitions. [2024-11-09 18:32:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 18:32:59,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:59,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:59,316 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 (25)] Forceful destruction successful, exit code 0 [2024-11-09 18:32:59,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 18:32:59,513 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:59,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:59,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1034665593, now seen corresponding path program 1 times [2024-11-09 18:32:59,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:59,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527182178] [2024-11-09 18:32:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:59,514 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-09 18:32:59,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:59,515 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:32:59,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-09 18:32:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:59,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:32:59,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:59,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:32:59,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:32:59,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:32:59,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527182178] [2024-11-09 18:32:59,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527182178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:32:59,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:32:59,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:32:59,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109765040] [2024-11-09 18:32:59,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:32:59,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:32:59,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:32:59,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:32:59,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:59,565 INFO L87 Difference]: Start difference. First operand 397 states and 504 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:32:59,586 INFO L93 Difference]: Finished difference Result 407 states and 513 transitions. [2024-11-09 18:32:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:32:59,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-09 18:32:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:32:59,588 INFO L225 Difference]: With dead ends: 407 [2024-11-09 18:32:59,588 INFO L226 Difference]: Without dead ends: 364 [2024-11-09 18:32:59,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:32:59,589 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:32:59,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:32:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-09 18:32:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 333. [2024-11-09 18:32:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 292 states have (on average 1.1986301369863013) internal successors, (350), 297 states have internal predecessors, (350), 31 states have call successors, (31), 6 states have call predecessors, (31), 9 states have return successors, (36), 33 states have call predecessors, (36), 29 states have call successors, (36) [2024-11-09 18:32:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 417 transitions. [2024-11-09 18:32:59,605 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 417 transitions. Word has length 55 [2024-11-09 18:32:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:32:59,606 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 417 transitions. [2024-11-09 18:32:59,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:32:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 417 transitions. [2024-11-09 18:32:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 18:32:59,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:32:59,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:32:59,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-09 18:32:59,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:32:59,808 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:32:59,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:32:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash 677709871, now seen corresponding path program 1 times [2024-11-09 18:32:59,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:32:59,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145197036] [2024-11-09 18:32:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:32:59,809 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-09 18:32:59,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:32:59,810 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:32:59,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-09 18:32:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:32:59,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 18:32:59,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:32:59,974 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-09 18:32:59,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 18:33:00,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145197036] [2024-11-09 18:33:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145197036] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 18:33:00,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:33:00,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-09 18:33:00,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886389686] [2024-11-09 18:33:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:00,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 18:33:00,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:00,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 18:33:00,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:33:00,068 INFO L87 Difference]: Start difference. First operand 333 states and 417 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:00,225 INFO L93 Difference]: Finished difference Result 415 states and 517 transitions. [2024-11-09 18:33:00,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:33:00,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-09 18:33:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:00,227 INFO L225 Difference]: With dead ends: 415 [2024-11-09 18:33:00,227 INFO L226 Difference]: Without dead ends: 347 [2024-11-09 18:33:00,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 18:33:00,228 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 25 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:00,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 389 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:33:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-09 18:33:00,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 320. [2024-11-09 18:33:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 278 states have (on average 1.2050359712230216) internal successors, (335), 282 states have internal predecessors, (335), 33 states have call successors, (33), 6 states have call predecessors, (33), 8 states have return successors, (34), 34 states have call predecessors, (34), 31 states have call successors, (34) [2024-11-09 18:33:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 402 transitions. [2024-11-09 18:33:00,243 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 402 transitions. Word has length 55 [2024-11-09 18:33:00,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:00,244 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 402 transitions. [2024-11-09 18:33:00,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 18:33:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 402 transitions. [2024-11-09 18:33:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 18:33:00,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:00,245 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-09 18:33:00,251 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 (27)] Ended with exit code 0 [2024-11-09 18:33:00,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:00,446 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:00,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash -748171745, now seen corresponding path program 1 times [2024-11-09 18:33:00,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:00,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719891572] [2024-11-09 18:33:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:00,446 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-09 18:33:00,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:00,448 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:00,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-09 18:33:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:00,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 18:33:00,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:33:00,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:00,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:00,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719891572] [2024-11-09 18:33:00,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719891572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:00,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:00,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 18:33:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801047940] [2024-11-09 18:33:00,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:00,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 18:33:00,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:00,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 18:33:00,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 18:33:00,721 INFO L87 Difference]: Start difference. First operand 320 states and 402 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 18:33:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:00,986 INFO L93 Difference]: Finished difference Result 404 states and 507 transitions. [2024-11-09 18:33:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:33:00,987 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 57 [2024-11-09 18:33:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:00,988 INFO L225 Difference]: With dead ends: 404 [2024-11-09 18:33:00,988 INFO L226 Difference]: Without dead ends: 363 [2024-11-09 18:33:00,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-09 18:33:00,989 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 98 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:00,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 854 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:33:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-09 18:33:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 320. [2024-11-09 18:33:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 278 states have (on average 1.1978417266187051) internal successors, (333), 282 states have internal predecessors, (333), 33 states have call successors, (33), 6 states have call predecessors, (33), 8 states have return successors, (34), 34 states have call predecessors, (34), 31 states have call successors, (34) [2024-11-09 18:33:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 400 transitions. [2024-11-09 18:33:01,009 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 400 transitions. Word has length 57 [2024-11-09 18:33:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:01,010 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 400 transitions. [2024-11-09 18:33:01,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 18:33:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 400 transitions. [2024-11-09 18:33:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 18:33:01,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:01,011 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-09 18:33:01,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-09 18:33:01,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:01,212 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:01,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash 150450718, now seen corresponding path program 1 times [2024-11-09 18:33:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:01,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919791053] [2024-11-09 18:33:01,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:01,213 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-09 18:33:01,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:01,214 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:01,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-09 18:33:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:01,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 18:33:01,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:33:01,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 18:33:01,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:01,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919791053] [2024-11-09 18:33:01,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919791053] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:33:01,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:33:01,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-09 18:33:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31473555] [2024-11-09 18:33:01,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:33:01,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 18:33:01,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 18:33:01,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-09 18:33:01,400 INFO L87 Difference]: Start difference. First operand 320 states and 400 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 18:33:01,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:01,534 INFO L93 Difference]: Finished difference Result 402 states and 505 transitions. [2024-11-09 18:33:01,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 18:33:01,535 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2024-11-09 18:33:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:01,537 INFO L225 Difference]: With dead ends: 402 [2024-11-09 18:33:01,537 INFO L226 Difference]: Without dead ends: 345 [2024-11-09 18:33:01,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-09 18:33:01,538 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 54 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:01,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 836 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:33:01,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-09 18:33:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 312. [2024-11-09 18:33:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 271 states have (on average 1.188191881918819) internal successors, (322), 274 states have internal predecessors, (322), 32 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (33), 33 states have call predecessors, (33), 30 states have call successors, (33) [2024-11-09 18:33:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 387 transitions. [2024-11-09 18:33:01,552 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 387 transitions. Word has length 58 [2024-11-09 18:33:01,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:01,552 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 387 transitions. [2024-11-09 18:33:01,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 18:33:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 387 transitions. [2024-11-09 18:33:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 18:33:01,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:01,553 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, 1, 1, 1] [2024-11-09 18:33:01,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-09 18:33:01,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 18:33:01,754 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:01,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1950472884, now seen corresponding path program 1 times [2024-11-09 18:33:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:01,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034877145] [2024-11-09 18:33:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:01,755 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-09 18:33:01,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:01,757 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:01,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-09 18:33:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:01,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 18:33:01,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:01,928 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-09 18:33:01,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:02,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:02,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034877145] [2024-11-09 18:33:02,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034877145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:33:02,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [572953412] [2024-11-09 18:33:02,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:02,058 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 18:33:02,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 18:33:02,062 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 18:33:02,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-09 18:33:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:02,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 18:33:02,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:02,277 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-09 18:33:02,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:33:02,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [572953412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:33:02,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:33:02,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-09 18:33:02,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546802732] [2024-11-09 18:33:02,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:33:02,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 18:33:02,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:02,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 18:33:02,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 18:33:02,326 INFO L87 Difference]: Start difference. First operand 312 states and 387 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 18:33:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:02,563 INFO L93 Difference]: Finished difference Result 365 states and 451 transitions. [2024-11-09 18:33:02,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 18:33:02,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 58 [2024-11-09 18:33:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:02,565 INFO L225 Difference]: With dead ends: 365 [2024-11-09 18:33:02,565 INFO L226 Difference]: Without dead ends: 329 [2024-11-09 18:33:02,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:33:02,566 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 35 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:02,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 771 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:33:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-09 18:33:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 305. [2024-11-09 18:33:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 265 states have (on average 1.181132075471698) internal successors, (313), 267 states have internal predecessors, (313), 31 states have call successors, (31), 6 states have call predecessors, (31), 8 states have return successors, (32), 32 states have call predecessors, (32), 29 states have call successors, (32) [2024-11-09 18:33:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 376 transitions. [2024-11-09 18:33:02,581 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 376 transitions. Word has length 58 [2024-11-09 18:33:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:02,581 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 376 transitions. [2024-11-09 18:33:02,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 18:33:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 376 transitions. [2024-11-09 18:33:02,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 18:33:02,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:02,582 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, 1, 1, 1] [2024-11-09 18:33:02,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-09 18:33:02,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2024-11-09 18:33:02,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 18:33:02,983 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:02,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1119030677, now seen corresponding path program 1 times [2024-11-09 18:33:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:02,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182221032] [2024-11-09 18:33:02,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:02,984 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-09 18:33:02,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:02,985 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 18:33:02,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 (32)] Waiting until timeout for monitored process [2024-11-09 18:33:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:03,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 18:33:03,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 18:33:03,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:03,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:03,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182221032] [2024-11-09 18:33:03,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182221032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:03,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:03,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 18:33:03,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117996586] [2024-11-09 18:33:03,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:03,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 18:33:03,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:03,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 18:33:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 18:33:03,138 INFO L87 Difference]: Start difference. First operand 305 states and 376 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 18:33:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:03,372 INFO L93 Difference]: Finished difference Result 374 states and 460 transitions. [2024-11-09 18:33:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 18:33:03,373 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2024-11-09 18:33:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:03,374 INFO L225 Difference]: With dead ends: 374 [2024-11-09 18:33:03,374 INFO L226 Difference]: Without dead ends: 322 [2024-11-09 18:33:03,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-09 18:33:03,375 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 57 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:03,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 953 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:33:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-09 18:33:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 305. [2024-11-09 18:33:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 265 states have (on average 1.1735849056603773) internal successors, (311), 267 states have internal predecessors, (311), 31 states have call successors, (31), 6 states have call predecessors, (31), 8 states have return successors, (32), 32 states have call predecessors, (32), 29 states have call successors, (32) [2024-11-09 18:33:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 374 transitions. [2024-11-09 18:33:03,389 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 374 transitions. Word has length 58 [2024-11-09 18:33:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:03,390 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 374 transitions. [2024-11-09 18:33:03,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 18:33:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 374 transitions. [2024-11-09 18:33:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 18:33:03,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:03,391 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, 1, 1, 1, 1] [2024-11-09 18:33:03,394 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 (32)] Ended with exit code 0 [2024-11-09 18:33:03,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 18:33:03,594 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:03,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2095816344, now seen corresponding path program 1 times [2024-11-09 18:33:03,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:03,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963879146] [2024-11-09 18:33:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:03,595 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-09 18:33:03,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:03,596 INFO L229 MonitoredProcess]: Starting monitored process 33 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-09 18:33:03,597 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 (33)] Waiting until timeout for monitored process [2024-11-09 18:33:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:03,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 18:33:03,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 18:33:03,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:03,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:03,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963879146] [2024-11-09 18:33:03,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963879146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:03,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:03,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 18:33:03,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183270615] [2024-11-09 18:33:03,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:03,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 18:33:03,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:03,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 18:33:03,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 18:33:03,696 INFO L87 Difference]: Start difference. First operand 305 states and 374 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 18:33:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:03,803 INFO L93 Difference]: Finished difference Result 334 states and 404 transitions. [2024-11-09 18:33:03,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 18:33:03,803 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2024-11-09 18:33:03,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:03,804 INFO L225 Difference]: With dead ends: 334 [2024-11-09 18:33:03,805 INFO L226 Difference]: Without dead ends: 267 [2024-11-09 18:33:03,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:33:03,805 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:03,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 708 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:33:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-09 18:33:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 251. [2024-11-09 18:33:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 219 states have (on average 1.1643835616438356) internal successors, (255), 221 states have internal predecessors, (255), 23 states have call successors, (23), 6 states have call predecessors, (23), 8 states have return successors, (24), 24 states have call predecessors, (24), 21 states have call successors, (24) [2024-11-09 18:33:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 302 transitions. [2024-11-09 18:33:03,821 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 302 transitions. Word has length 59 [2024-11-09 18:33:03,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:03,821 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 302 transitions. [2024-11-09 18:33:03,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 18:33:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 302 transitions. [2024-11-09 18:33:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 18:33:03,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:03,822 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-09 18:33:03,826 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 (33)] Ended with exit code 0 [2024-11-09 18:33:04,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 18:33:04,025 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:04,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:04,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1307669228, now seen corresponding path program 1 times [2024-11-09 18:33:04,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:04,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516312442] [2024-11-09 18:33:04,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:04,026 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-09 18:33:04,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:04,028 INFO L229 MonitoredProcess]: Starting monitored process 34 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-09 18:33:04,029 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 (34)] Waiting until timeout for monitored process [2024-11-09 18:33:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:04,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 18:33:04,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:04,203 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 18:33:04,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:04,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:04,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516312442] [2024-11-09 18:33:04,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516312442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:04,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:04,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 18:33:04,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793399592] [2024-11-09 18:33:04,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:04,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 18:33:04,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:04,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 18:33:04,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 18:33:04,205 INFO L87 Difference]: Start difference. First operand 251 states and 302 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 18:33:04,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:33:04,313 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2024-11-09 18:33:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 18:33:04,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2024-11-09 18:33:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:33:04,315 INFO L225 Difference]: With dead ends: 272 [2024-11-09 18:33:04,315 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 18:33:04,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 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-09 18:33:04,316 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 9 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:33:04,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 447 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:33:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 18:33:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2024-11-09 18:33:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 222 states have (on average 1.162162162162162) internal successors, (258), 227 states have internal predecessors, (258), 26 states have call successors, (26), 7 states have call predecessors, (26), 9 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2024-11-09 18:33:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 311 transitions. [2024-11-09 18:33:04,328 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 311 transitions. Word has length 59 [2024-11-09 18:33:04,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:33:04,328 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 311 transitions. [2024-11-09 18:33:04,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 18:33:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 311 transitions. [2024-11-09 18:33:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 18:33:04,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:33:04,330 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-09 18:33:04,333 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 (34)] Ended with exit code 0 [2024-11-09 18:33:04,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-09 18:33:04,531 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:33:04,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:33:04,531 INFO L85 PathProgramCache]: Analyzing trace with hash -14102071, now seen corresponding path program 1 times [2024-11-09 18:33:04,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 18:33:04,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444375544] [2024-11-09 18:33:04,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:33:04,531 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-09 18:33:04,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 18:33:04,532 INFO L229 MonitoredProcess]: Starting monitored process 35 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-09 18:33:04,533 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 (35)] Waiting until timeout for monitored process [2024-11-09 18:33:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:33:04,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 18:33:04,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:33:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 18:33:12,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:33:12,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 18:33:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444375544] [2024-11-09 18:33:12,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444375544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:33:12,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:33:12,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 18:33:12,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902002718] [2024-11-09 18:33:12,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:33:12,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 18:33:12,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 18:33:12,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 18:33:12,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=37, Unknown=3, NotChecked=0, Total=56 [2024-11-09 18:33:12,849 INFO L87 Difference]: Start difference. First operand 258 states and 311 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 18:33:16,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 18:33:19,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 18:33:23,673 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-09 18:33:26,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 18:33:30,805 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-09 18:33:34,813 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-09 18:33:38,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]