./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.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 17ba764d4851428799f2c4794a4662e2753aae472d291b23839dac79bbfbab6d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:36:26,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:36:26,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:36:26,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:36:26,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:36:26,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:36:26,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:36:26,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:36:26,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:36:26,286 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:36:26,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:36:26,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:36:26,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:36:26,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:36:26,290 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:36:26,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:36:26,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:36:26,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:36:26,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:36:26,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:36:26,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:36:26,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:36:26,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:36:26,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:36:26,297 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:36:26,297 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:36:26,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:36:26,298 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:36:26,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:36:26,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:36:26,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:36:26,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:36:26,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:36:26,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:36:26,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:36:26,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:36:26,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:36:26,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:36:26,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:36:26,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:36:26,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:36:26,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:36:26,302 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 -> 17ba764d4851428799f2c4794a4662e2753aae472d291b23839dac79bbfbab6d [2024-11-08 15:36:26,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:36:26,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:36:26,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:36:26,575 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:36:26,576 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:36:26,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2024-11-08 15:36:28,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:36:28,253 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:36:28,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2024-11-08 15:36:28,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33dbf88cc/c8ae2e8a041a4465965e40150f184961/FLAGf02db2571 [2024-11-08 15:36:28,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33dbf88cc/c8ae2e8a041a4465965e40150f184961 [2024-11-08 15:36:28,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:36:28,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:36:28,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:36:28,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:36:28,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:36:28,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:28,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df08b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28, skipping insertion in model container [2024-11-08 15:36:28,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:28,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:36:28,897 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/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c[9392,9405] [2024-11-08 15:36:28,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:36:28,912 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:36:28,953 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/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c[9392,9405] [2024-11-08 15:36:28,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:36:28,974 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:36:28,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28 WrapperNode [2024-11-08 15:36:28,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:36:28,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:36:28,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:36:28,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:36:28,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:28,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:29,026 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 315 [2024-11-08 15:36:29,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:36:29,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:36:29,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:36:29,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:36:29,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:29,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:29,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:29,087 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-08 15:36:29,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:29,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:29,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:29,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:29,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:29,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:29,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:36:29,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:36:29,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:36:29,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:36:29,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (1/1) ... [2024-11-08 15:36:29,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:36:29,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:36:29,159 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-08 15:36:29,184 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-08 15:36:29,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:36:29,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:36:29,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:36:29,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:36:29,368 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:36:29,370 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:36:29,814 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-08 15:36:29,815 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:36:29,828 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:36:29,829 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 15:36:29,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:36:29 BoogieIcfgContainer [2024-11-08 15:36:29,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:36:29,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:36:29,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:36:29,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:36:29,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:36:28" (1/3) ... [2024-11-08 15:36:29,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253e1d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:36:29, skipping insertion in model container [2024-11-08 15:36:29,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:36:28" (2/3) ... [2024-11-08 15:36:29,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253e1d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:36:29, skipping insertion in model container [2024-11-08 15:36:29,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:36:29" (3/3) ... [2024-11-08 15:36:29,838 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2024-11-08 15:36:29,853 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:36:29,854 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:36:29,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:36:29,913 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;@7635be75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:36:29,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:36:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 82 states have (on average 1.7317073170731707) internal successors, (142), 83 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 15:36:29,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:29,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-08 15:36:29,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:29,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1469414718, now seen corresponding path program 1 times [2024-11-08 15:36:29,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:29,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659329980] [2024-11-08 15:36:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:29,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:30,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659329980] [2024-11-08 15:36:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659329980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:30,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:30,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:36:30,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843121805] [2024-11-08 15:36:30,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:30,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:36:30,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:30,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:36:30,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:36:30,254 INFO L87 Difference]: Start difference. First operand has 84 states, 82 states have (on average 1.7317073170731707) internal successors, (142), 83 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:30,278 INFO L93 Difference]: Finished difference Result 139 states and 230 transitions. [2024-11-08 15:36:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:36:30,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-08 15:36:30,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:30,289 INFO L225 Difference]: With dead ends: 139 [2024-11-08 15:36:30,289 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 15:36:30,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:36:30,295 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:30,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:36:30,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 15:36:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-08 15:36:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 79 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 135 transitions. [2024-11-08 15:36:30,327 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 135 transitions. Word has length 29 [2024-11-08 15:36:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:30,327 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 135 transitions. [2024-11-08 15:36:30,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 135 transitions. [2024-11-08 15:36:30,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 15:36:30,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:30,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-08 15:36:30,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:36:30,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:30,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:30,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1335401212, now seen corresponding path program 1 times [2024-11-08 15:36:30,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:30,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22075436] [2024-11-08 15:36:30,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:30,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:30,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:30,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22075436] [2024-11-08 15:36:30,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22075436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:30,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:30,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:36:30,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575426101] [2024-11-08 15:36:30,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:30,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:36:30,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:30,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:36:30,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:36:30,562 INFO L87 Difference]: Start difference. First operand 80 states and 135 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:30,671 INFO L93 Difference]: Finished difference Result 184 states and 301 transitions. [2024-11-08 15:36:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:36:30,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-08 15:36:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:30,674 INFO L225 Difference]: With dead ends: 184 [2024-11-08 15:36:30,676 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 15:36:30,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:36:30,677 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 80 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:30,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 494 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:36:30,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 15:36:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 80. [2024-11-08 15:36:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2024-11-08 15:36:30,692 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 29 [2024-11-08 15:36:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:30,692 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2024-11-08 15:36:30,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2024-11-08 15:36:30,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:36:30,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:30,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:36:30,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:36:30,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:30,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:30,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1970529547, now seen corresponding path program 1 times [2024-11-08 15:36:30,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:30,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127832401] [2024-11-08 15:36:30,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:30,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:30,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127832401] [2024-11-08 15:36:30,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127832401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:30,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:30,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:36:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228801386] [2024-11-08 15:36:30,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:30,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:36:30,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:30,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:36:30,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:36:30,860 INFO L87 Difference]: Start difference. First operand 80 states and 111 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:30,898 INFO L93 Difference]: Finished difference Result 172 states and 259 transitions. [2024-11-08 15:36:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:36:30,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-08 15:36:30,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:30,902 INFO L225 Difference]: With dead ends: 172 [2024-11-08 15:36:30,902 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 15:36:30,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 15:36:30,903 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 65 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:30,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 239 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:36:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 15:36:30,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-11-08 15:36:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 119 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-08 15:36:30,923 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 52 [2024-11-08 15:36:30,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:30,923 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-08 15:36:30,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-08 15:36:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:36:30,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:30,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:36:30,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:36:30,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:30,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:30,928 INFO L85 PathProgramCache]: Analyzing trace with hash -792098890, now seen corresponding path program 1 times [2024-11-08 15:36:30,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:30,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753881905] [2024-11-08 15:36:30,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:30,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:31,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:31,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753881905] [2024-11-08 15:36:31,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753881905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:31,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:31,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:36:31,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499134615] [2024-11-08 15:36:31,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:31,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:36:31,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:31,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:36:31,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:36:31,052 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:31,080 INFO L93 Difference]: Finished difference Result 284 states and 440 transitions. [2024-11-08 15:36:31,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:36:31,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-08 15:36:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:31,082 INFO L225 Difference]: With dead ends: 284 [2024-11-08 15:36:31,082 INFO L226 Difference]: Without dead ends: 194 [2024-11-08 15:36:31,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 15:36:31,084 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:31,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 236 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:36:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-08 15:36:31,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2024-11-08 15:36:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.5235602094240839) internal successors, (291), 191 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2024-11-08 15:36:31,101 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 52 [2024-11-08 15:36:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:31,101 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2024-11-08 15:36:31,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:31,102 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2024-11-08 15:36:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:36:31,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:31,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:36:31,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:36:31,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:31,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1685421303, now seen corresponding path program 1 times [2024-11-08 15:36:31,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:31,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305816437] [2024-11-08 15:36:31,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:31,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:31,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:31,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305816437] [2024-11-08 15:36:31,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305816437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:31,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:31,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:36:31,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592571558] [2024-11-08 15:36:31,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:31,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:36:31,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:31,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:36:31,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:36:31,283 INFO L87 Difference]: Start difference. First operand 192 states and 291 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:31,411 INFO L93 Difference]: Finished difference Result 1002 states and 1596 transitions. [2024-11-08 15:36:31,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:36:31,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-08 15:36:31,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:31,417 INFO L225 Difference]: With dead ends: 1002 [2024-11-08 15:36:31,417 INFO L226 Difference]: Without dead ends: 840 [2024-11-08 15:36:31,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:36:31,422 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 745 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:31,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 680 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:36:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-08 15:36:31,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 352. [2024-11-08 15:36:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.547008547008547) internal successors, (543), 351 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 543 transitions. [2024-11-08 15:36:31,478 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 543 transitions. Word has length 52 [2024-11-08 15:36:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:31,479 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 543 transitions. [2024-11-08 15:36:31,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 543 transitions. [2024-11-08 15:36:31,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 15:36:31,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:31,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:36:31,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:36:31,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:31,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash 325129465, now seen corresponding path program 1 times [2024-11-08 15:36:31,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:31,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651329983] [2024-11-08 15:36:31,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:31,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:31,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:31,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651329983] [2024-11-08 15:36:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651329983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:31,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:36:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558253051] [2024-11-08 15:36:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:31,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:36:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:36:31,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:36:31,869 INFO L87 Difference]: Start difference. First operand 352 states and 543 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:31,922 INFO L93 Difference]: Finished difference Result 378 states and 576 transitions. [2024-11-08 15:36:31,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:36:31,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-08 15:36:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:31,925 INFO L225 Difference]: With dead ends: 378 [2024-11-08 15:36:31,925 INFO L226 Difference]: Without dead ends: 376 [2024-11-08 15:36:31,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:36:31,929 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:31,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 720 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:36:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-08 15:36:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2024-11-08 15:36:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 1.512) internal successors, (567), 375 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 567 transitions. [2024-11-08 15:36:31,949 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 567 transitions. Word has length 53 [2024-11-08 15:36:31,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:31,950 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 567 transitions. [2024-11-08 15:36:31,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 567 transitions. [2024-11-08 15:36:31,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 15:36:31,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:31,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:36:31,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:36:31,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:31,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:31,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1541657359, now seen corresponding path program 1 times [2024-11-08 15:36:31,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:31,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667631383] [2024-11-08 15:36:31,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:31,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667631383] [2024-11-08 15:36:32,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667631383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:32,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:32,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:36:32,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581044926] [2024-11-08 15:36:32,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:32,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:36:32,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:32,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:36:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:36:32,066 INFO L87 Difference]: Start difference. First operand 376 states and 567 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:32,090 INFO L93 Difference]: Finished difference Result 1008 states and 1541 transitions. [2024-11-08 15:36:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:36:32,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-08 15:36:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:32,094 INFO L225 Difference]: With dead ends: 1008 [2024-11-08 15:36:32,094 INFO L226 Difference]: Without dead ends: 662 [2024-11-08 15:36:32,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 15:36:32,097 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:32,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:36:32,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-08 15:36:32,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2024-11-08 15:36:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 1.5098634294385433) internal successors, (995), 659 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 995 transitions. [2024-11-08 15:36:32,124 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 995 transitions. Word has length 54 [2024-11-08 15:36:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:32,125 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 995 transitions. [2024-11-08 15:36:32,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 995 transitions. [2024-11-08 15:36:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 15:36:32,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:32,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:36:32,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:36:32,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:32,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:32,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1960098574, now seen corresponding path program 1 times [2024-11-08 15:36:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:32,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163470228] [2024-11-08 15:36:32,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:32,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:32,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:32,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163470228] [2024-11-08 15:36:32,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163470228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:32,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:32,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:36:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697018523] [2024-11-08 15:36:32,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:32,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:36:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:32,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:36:32,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:36:32,212 INFO L87 Difference]: Start difference. First operand 660 states and 995 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:32,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:32,247 INFO L93 Difference]: Finished difference Result 1290 states and 1960 transitions. [2024-11-08 15:36:32,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:36:32,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-08 15:36:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:32,252 INFO L225 Difference]: With dead ends: 1290 [2024-11-08 15:36:32,252 INFO L226 Difference]: Without dead ends: 944 [2024-11-08 15:36:32,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 15:36:32,253 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 69 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:32,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 249 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:36:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-08 15:36:32,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2024-11-08 15:36:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 1.5015940488841657) internal successors, (1413), 941 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1413 transitions. [2024-11-08 15:36:32,282 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1413 transitions. Word has length 54 [2024-11-08 15:36:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:32,282 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1413 transitions. [2024-11-08 15:36:32,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1413 transitions. [2024-11-08 15:36:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 15:36:32,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:32,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:36:32,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:36:32,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:32,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash -487372750, now seen corresponding path program 1 times [2024-11-08 15:36:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:32,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588174630] [2024-11-08 15:36:32,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:32,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:32,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:32,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588174630] [2024-11-08 15:36:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588174630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:32,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:32,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:36:32,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59352253] [2024-11-08 15:36:32,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:32,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:36:32,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:32,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:36:32,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:36:32,342 INFO L87 Difference]: Start difference. First operand 942 states and 1413 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:32,394 INFO L93 Difference]: Finished difference Result 2570 states and 3839 transitions. [2024-11-08 15:36:32,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:36:32,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-08 15:36:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:32,403 INFO L225 Difference]: With dead ends: 2570 [2024-11-08 15:36:32,403 INFO L226 Difference]: Without dead ends: 1660 [2024-11-08 15:36:32,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 15:36:32,406 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 57 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:32,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 243 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:36:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-11-08 15:36:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1658. [2024-11-08 15:36:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.468316234158117) internal successors, (2433), 1657 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2433 transitions. [2024-11-08 15:36:32,456 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2433 transitions. Word has length 55 [2024-11-08 15:36:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:32,457 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2433 transitions. [2024-11-08 15:36:32,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2433 transitions. [2024-11-08 15:36:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 15:36:32,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:32,459 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:36:32,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:36:32,459 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:32,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:32,459 INFO L85 PathProgramCache]: Analyzing trace with hash 487430426, now seen corresponding path program 1 times [2024-11-08 15:36:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:32,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425458286] [2024-11-08 15:36:32,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:32,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:32,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:32,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425458286] [2024-11-08 15:36:32,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425458286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:32,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:32,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:36:32,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844149817] [2024-11-08 15:36:32,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:32,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:36:32,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:32,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:36:32,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:36:32,574 INFO L87 Difference]: Start difference. First operand 1658 states and 2433 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:32,617 INFO L93 Difference]: Finished difference Result 3286 states and 4835 transitions. [2024-11-08 15:36:32,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:36:32,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-08 15:36:32,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:32,624 INFO L225 Difference]: With dead ends: 3286 [2024-11-08 15:36:32,624 INFO L226 Difference]: Without dead ends: 1660 [2024-11-08 15:36:32,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 15:36:32,627 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 54 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:32,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 234 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:36:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-11-08 15:36:32,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1658. [2024-11-08 15:36:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.4538322269161135) internal successors, (2409), 1657 states have internal predecessors, (2409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2409 transitions. [2024-11-08 15:36:32,686 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2409 transitions. Word has length 77 [2024-11-08 15:36:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:32,687 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2409 transitions. [2024-11-08 15:36:32,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2409 transitions. [2024-11-08 15:36:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 15:36:32,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:32,690 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:36:32,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:36:32,690 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:32,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:32,691 INFO L85 PathProgramCache]: Analyzing trace with hash 873678745, now seen corresponding path program 1 times [2024-11-08 15:36:32,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:32,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328017980] [2024-11-08 15:36:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:32,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:36:32,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:32,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328017980] [2024-11-08 15:36:32,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328017980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:36:32,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466794830] [2024-11-08 15:36:32,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:32,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:36:32,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:36:32,876 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-08 15:36:32,879 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-08 15:36:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:33,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 15:36:33,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:36:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:33,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:36:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:34,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466794830] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:36:34,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:36:34,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 8] total 16 [2024-11-08 15:36:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971117301] [2024-11-08 15:36:34,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:36:34,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 15:36:34,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:34,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 15:36:34,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:36:34,774 INFO L87 Difference]: Start difference. First operand 1658 states and 2409 transitions. Second operand has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:36,041 INFO L93 Difference]: Finished difference Result 8423 states and 12075 transitions. [2024-11-08 15:36:36,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 15:36:36,042 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-08 15:36:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:36,067 INFO L225 Difference]: With dead ends: 8423 [2024-11-08 15:36:36,067 INFO L226 Difference]: Without dead ends: 6797 [2024-11-08 15:36:36,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=334, Invalid=788, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 15:36:36,074 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 2116 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2116 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:36,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2116 Valid, 1237 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:36:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6797 states. [2024-11-08 15:36:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6797 to 5983. [2024-11-08 15:36:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5983 states, 5982 states have (on average 1.4182547642928787) internal successors, (8484), 5982 states have internal predecessors, (8484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 8484 transitions. [2024-11-08 15:36:36,306 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 8484 transitions. Word has length 77 [2024-11-08 15:36:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:36,306 INFO L471 AbstractCegarLoop]: Abstraction has 5983 states and 8484 transitions. [2024-11-08 15:36:36,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 8484 transitions. [2024-11-08 15:36:36,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 15:36:36,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:36,309 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:36:36,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:36:36,510 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,SelfDestructingSolverStorable10 [2024-11-08 15:36:36,511 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:36,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1715995457, now seen corresponding path program 1 times [2024-11-08 15:36:36,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:36,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958873949] [2024-11-08 15:36:36,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:36,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:36:36,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:36,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958873949] [2024-11-08 15:36:36,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958873949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:36,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:36,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:36:36,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161732816] [2024-11-08 15:36:36,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:36,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:36:36,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:36,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:36:36,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:36:36,635 INFO L87 Difference]: Start difference. First operand 5983 states and 8484 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:36,986 INFO L93 Difference]: Finished difference Result 18150 states and 25893 transitions. [2024-11-08 15:36:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:36:36,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-08 15:36:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:37,038 INFO L225 Difference]: With dead ends: 18150 [2024-11-08 15:36:37,039 INFO L226 Difference]: Without dead ends: 15076 [2024-11-08 15:36:37,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:36:37,048 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 460 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:37,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 731 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:36:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15076 states. [2024-11-08 15:36:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15076 to 8917. [2024-11-08 15:36:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8917 states, 8916 states have (on average 1.4119560340960071) internal successors, (12589), 8916 states have internal predecessors, (12589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8917 states to 8917 states and 12589 transitions. [2024-11-08 15:36:37,454 INFO L78 Accepts]: Start accepts. Automaton has 8917 states and 12589 transitions. Word has length 78 [2024-11-08 15:36:37,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:37,455 INFO L471 AbstractCegarLoop]: Abstraction has 8917 states and 12589 transitions. [2024-11-08 15:36:37,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand 8917 states and 12589 transitions. [2024-11-08 15:36:37,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 15:36:37,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:37,456 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:36:37,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:36:37,457 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:37,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:37,457 INFO L85 PathProgramCache]: Analyzing trace with hash -898712317, now seen corresponding path program 1 times [2024-11-08 15:36:37,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:37,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390558595] [2024-11-08 15:36:37,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:37,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:36:37,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:37,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390558595] [2024-11-08 15:36:37,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390558595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:37,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:37,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:36:37,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223640370] [2024-11-08 15:36:37,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:37,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:36:37,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:37,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:36:37,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:36:37,613 INFO L87 Difference]: Start difference. First operand 8917 states and 12589 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:38,060 INFO L93 Difference]: Finished difference Result 21084 states and 29998 transitions. [2024-11-08 15:36:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:36:38,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-08 15:36:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:38,094 INFO L225 Difference]: With dead ends: 21084 [2024-11-08 15:36:38,095 INFO L226 Difference]: Without dead ends: 18010 [2024-11-08 15:36:38,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:36:38,102 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 460 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:38,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 699 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:36:38,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18010 states. [2024-11-08 15:36:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18010 to 11844. [2024-11-08 15:36:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11844 states, 11843 states have (on average 1.4086802330490584) internal successors, (16683), 11843 states have internal predecessors, (16683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 16683 transitions. [2024-11-08 15:36:38,507 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 16683 transitions. Word has length 78 [2024-11-08 15:36:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:38,507 INFO L471 AbstractCegarLoop]: Abstraction has 11844 states and 16683 transitions. [2024-11-08 15:36:38,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 16683 transitions. [2024-11-08 15:36:38,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 15:36:38,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:38,508 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:36:38,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:36:38,509 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:38,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash -924014651, now seen corresponding path program 1 times [2024-11-08 15:36:38,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:38,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828462383] [2024-11-08 15:36:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:36:38,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:38,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828462383] [2024-11-08 15:36:38,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828462383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:38,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:38,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:36:38,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275419331] [2024-11-08 15:36:38,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:38,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:36:38,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:38,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:36:38,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:36:38,689 INFO L87 Difference]: Start difference. First operand 11844 states and 16683 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:39,229 INFO L93 Difference]: Finished difference Result 23995 states and 34065 transitions. [2024-11-08 15:36:39,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:36:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-08 15:36:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:39,270 INFO L225 Difference]: With dead ends: 23995 [2024-11-08 15:36:39,270 INFO L226 Difference]: Without dead ends: 20921 [2024-11-08 15:36:39,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:36:39,282 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 505 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:39,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 669 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:36:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20921 states. [2024-11-08 15:36:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20921 to 14762. [2024-11-08 15:36:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14762 states, 14761 states have (on average 1.4064765259806247) internal successors, (20761), 14761 states have internal predecessors, (20761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14762 states to 14762 states and 20761 transitions. [2024-11-08 15:36:39,897 INFO L78 Accepts]: Start accepts. Automaton has 14762 states and 20761 transitions. Word has length 78 [2024-11-08 15:36:39,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:39,897 INFO L471 AbstractCegarLoop]: Abstraction has 14762 states and 20761 transitions. [2024-11-08 15:36:39,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 14762 states and 20761 transitions. [2024-11-08 15:36:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 15:36:39,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:39,900 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:36:39,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:36:39,900 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:39,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:39,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1191330695, now seen corresponding path program 1 times [2024-11-08 15:36:39,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:39,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002838181] [2024-11-08 15:36:39,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:39,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 15:36:40,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:40,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002838181] [2024-11-08 15:36:40,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002838181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:40,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:40,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:36:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504992116] [2024-11-08 15:36:40,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:40,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:36:40,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:40,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:36:40,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:36:40,025 INFO L87 Difference]: Start difference. First operand 14762 states and 20761 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:40,529 INFO L93 Difference]: Finished difference Result 26899 states and 38121 transitions. [2024-11-08 15:36:40,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:36:40,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-08 15:36:40,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:40,571 INFO L225 Difference]: With dead ends: 26899 [2024-11-08 15:36:40,571 INFO L226 Difference]: Without dead ends: 23825 [2024-11-08 15:36:40,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:36:40,580 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 471 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:40,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 738 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:36:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23825 states. [2024-11-08 15:36:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23825 to 17666. [2024-11-08 15:36:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17666 states, 17665 states have (on average 1.4048683838097933) internal successors, (24817), 17665 states have internal predecessors, (24817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17666 states to 17666 states and 24817 transitions. [2024-11-08 15:36:41,265 INFO L78 Accepts]: Start accepts. Automaton has 17666 states and 24817 transitions. Word has length 78 [2024-11-08 15:36:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:41,266 INFO L471 AbstractCegarLoop]: Abstraction has 17666 states and 24817 transitions. [2024-11-08 15:36:41,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 17666 states and 24817 transitions. [2024-11-08 15:36:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 15:36:41,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:41,268 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:36:41,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:36:41,269 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:41,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:41,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1364656701, now seen corresponding path program 1 times [2024-11-08 15:36:41,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:41,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146347542] [2024-11-08 15:36:41,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:41,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:41,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146347542] [2024-11-08 15:36:41,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146347542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:36:41,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911879804] [2024-11-08 15:36:41,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:41,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:36:41,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:36:41,780 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-08 15:36:41,782 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-08 15:36:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:41,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 15:36:41,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:36:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:42,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:36:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:43,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911879804] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:36:43,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:36:43,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-08 15:36:43,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756041436] [2024-11-08 15:36:43,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:36:43,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 15:36:43,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:43,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 15:36:43,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-08 15:36:43,316 INFO L87 Difference]: Start difference. First operand 17666 states and 24817 transitions. Second operand has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 20 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:44,848 INFO L93 Difference]: Finished difference Result 74604 states and 105976 transitions. [2024-11-08 15:36:44,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 15:36:44,848 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 20 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-08 15:36:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:44,937 INFO L225 Difference]: With dead ends: 74604 [2024-11-08 15:36:44,937 INFO L226 Difference]: Without dead ends: 57136 [2024-11-08 15:36:44,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=349, Invalid=983, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 15:36:44,965 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1850 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:44,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1850 Valid, 799 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:36:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57136 states. [2024-11-08 15:36:46,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57136 to 41794. [2024-11-08 15:36:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41794 states, 41793 states have (on average 1.4010240949441295) internal successors, (58553), 41793 states have internal predecessors, (58553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41794 states to 41794 states and 58553 transitions. [2024-11-08 15:36:46,322 INFO L78 Accepts]: Start accepts. Automaton has 41794 states and 58553 transitions. Word has length 81 [2024-11-08 15:36:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:46,323 INFO L471 AbstractCegarLoop]: Abstraction has 41794 states and 58553 transitions. [2024-11-08 15:36:46,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 20 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 41794 states and 58553 transitions. [2024-11-08 15:36:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 15:36:46,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:46,326 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:36:46,344 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-08 15:36:46,529 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,SelfDestructingSolverStorable15 [2024-11-08 15:36:46,530 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:46,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:46,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1112863492, now seen corresponding path program 1 times [2024-11-08 15:36:46,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:46,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157619927] [2024-11-08 15:36:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:46,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:46,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:46,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157619927] [2024-11-08 15:36:46,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157619927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:36:46,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:36:46,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:36:46,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231008431] [2024-11-08 15:36:46,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:36:46,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:36:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:46,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:36:46,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:36:46,770 INFO L87 Difference]: Start difference. First operand 41794 states and 58553 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:36:47,383 INFO L93 Difference]: Finished difference Result 62414 states and 87367 transitions. [2024-11-08 15:36:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:36:47,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-08 15:36:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:36:47,414 INFO L225 Difference]: With dead ends: 62414 [2024-11-08 15:36:47,415 INFO L226 Difference]: Without dead ends: 20934 [2024-11-08 15:36:47,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 15:36:47,453 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 38 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:36:47,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 221 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:36:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20934 states. [2024-11-08 15:36:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20934 to 20596. [2024-11-08 15:36:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20596 states, 20595 states have (on average 1.3793153678077203) internal successors, (28407), 20595 states have internal predecessors, (28407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 28407 transitions. [2024-11-08 15:36:48,353 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 28407 transitions. Word has length 81 [2024-11-08 15:36:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:36:48,353 INFO L471 AbstractCegarLoop]: Abstraction has 20596 states and 28407 transitions. [2024-11-08 15:36:48,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:36:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 28407 transitions. [2024-11-08 15:36:48,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 15:36:48,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:36:48,355 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:36:48,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:36:48,355 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:36:48,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:36:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1389959035, now seen corresponding path program 1 times [2024-11-08 15:36:48,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:36:48,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288845298] [2024-11-08 15:36:48,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:36:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:36:50,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288845298] [2024-11-08 15:36:50,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288845298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:36:50,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077037843] [2024-11-08 15:36:50,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:36:50,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:36:50,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:36:50,249 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-08 15:36:50,251 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-08 15:36:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:36:50,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 15:36:50,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:36:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:50,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:36:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:36:51,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077037843] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:36:51,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:36:51,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-11-08 15:36:51,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957348345] [2024-11-08 15:36:51,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:36:51,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 15:36:51,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:36:51,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 15:36:51,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2024-11-08 15:36:51,531 INFO L87 Difference]: Start difference. First operand 20596 states and 28407 transitions. Second operand has 28 states, 28 states have (on average 7.75) internal successors, (217), 27 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:37:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:37:00,920 INFO L93 Difference]: Finished difference Result 202297 states and 280176 transitions. [2024-11-08 15:37:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-08 15:37:00,921 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.75) internal successors, (217), 27 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-08 15:37:00,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:37:01,165 INFO L225 Difference]: With dead ends: 202297 [2024-11-08 15:37:01,165 INFO L226 Difference]: Without dead ends: 181953 [2024-11-08 15:37:01,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5511 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2802, Invalid=13454, Unknown=0, NotChecked=0, Total=16256 [2024-11-08 15:37:01,209 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 4394 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 2756 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4394 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:37:01,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4394 Valid, 2147 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2756 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 15:37:01,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181953 states. [2024-11-08 15:37:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181953 to 112767. [2024-11-08 15:37:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112767 states, 112766 states have (on average 1.3694021247539152) internal successors, (154422), 112766 states have internal predecessors, (154422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:37:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112767 states to 112767 states and 154422 transitions. [2024-11-08 15:37:05,283 INFO L78 Accepts]: Start accepts. Automaton has 112767 states and 154422 transitions. Word has length 81 [2024-11-08 15:37:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:37:05,284 INFO L471 AbstractCegarLoop]: Abstraction has 112767 states and 154422 transitions. [2024-11-08 15:37:05,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.75) internal successors, (217), 27 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:37:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 112767 states and 154422 transitions. [2024-11-08 15:37:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 15:37:05,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:37:05,287 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:37:05,303 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-08 15:37:05,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 15:37:05,492 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:37:05,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:37:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1824933852, now seen corresponding path program 1 times [2024-11-08 15:37:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:37:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565257217] [2024-11-08 15:37:05,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:37:05,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:37:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:37:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:37:05,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:37:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565257217] [2024-11-08 15:37:05,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565257217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:37:05,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:37:05,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:37:05,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522003988] [2024-11-08 15:37:05,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:37:05,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:37:05,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:37:05,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:37:05,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:37:05,576 INFO L87 Difference]: Start difference. First operand 112767 states and 154422 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:37:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:37:07,676 INFO L93 Difference]: Finished difference Result 178615 states and 244060 transitions. [2024-11-08 15:37:07,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:37:07,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-08 15:37:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:37:07,758 INFO L225 Difference]: With dead ends: 178615 [2024-11-08 15:37:07,759 INFO L226 Difference]: Without dead ends: 66596 [2024-11-08 15:37:07,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 15:37:07,802 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 31 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:37:07,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:37:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66596 states. [2024-11-08 15:37:09,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66596 to 65298. [2024-11-08 15:37:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65298 states, 65297 states have (on average 1.3375652786498613) internal successors, (87339), 65297 states have internal predecessors, (87339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:37:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65298 states to 65298 states and 87339 transitions. [2024-11-08 15:37:10,016 INFO L78 Accepts]: Start accepts. Automaton has 65298 states and 87339 transitions. Word has length 81 [2024-11-08 15:37:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:37:10,017 INFO L471 AbstractCegarLoop]: Abstraction has 65298 states and 87339 transitions. [2024-11-08 15:37:10,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:37:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 65298 states and 87339 transitions. [2024-11-08 15:37:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 15:37:10,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:37:10,019 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:37:10,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 15:37:10,019 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:37:10,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:37:10,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1672593283, now seen corresponding path program 1 times [2024-11-08 15:37:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:37:10,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364881392] [2024-11-08 15:37:10,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:37:10,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:37:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:37:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:37:10,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:37:10,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364881392] [2024-11-08 15:37:10,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364881392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:37:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081502870] [2024-11-08 15:37:10,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:37:10,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:37:10,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:37:10,621 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-08 15:37:10,623 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-08 15:37:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:37:10,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 15:37:10,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:37:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:37:11,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:37:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:37:11,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081502870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:37:11,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:37:11,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-08 15:37:11,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458653581] [2024-11-08 15:37:11,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:37:11,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 15:37:11,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:37:11,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 15:37:11,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-11-08 15:37:11,738 INFO L87 Difference]: Start difference. First operand 65298 states and 87339 transitions. Second operand has 21 states, 21 states have (on average 7.904761904761905) internal successors, (166), 20 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:37:15,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:37:15,382 INFO L93 Difference]: Finished difference Result 207260 states and 277076 transitions. [2024-11-08 15:37:15,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 15:37:15,383 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.904761904761905) internal successors, (166), 20 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-08 15:37:15,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:37:15,578 INFO L225 Difference]: With dead ends: 207260 [2024-11-08 15:37:15,578 INFO L226 Difference]: Without dead ends: 142509 [2024-11-08 15:37:15,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2024-11-08 15:37:15,629 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 989 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:37:15,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 754 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:37:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142509 states. [2024-11-08 15:37:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142509 to 133181. [2024-11-08 15:37:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133181 states, 133180 states have (on average 1.33318816639135) internal successors, (177554), 133180 states have internal predecessors, (177554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:37:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133181 states to 133181 states and 177554 transitions. [2024-11-08 15:37:20,238 INFO L78 Accepts]: Start accepts. Automaton has 133181 states and 177554 transitions. Word has length 81 [2024-11-08 15:37:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:37:20,239 INFO L471 AbstractCegarLoop]: Abstraction has 133181 states and 177554 transitions. [2024-11-08 15:37:20,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.904761904761905) internal successors, (166), 20 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:37:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 133181 states and 177554 transitions. [2024-11-08 15:37:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 15:37:20,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:37:20,242 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:37:20,260 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-08 15:37:20,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:37:20,443 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:37:20,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:37:20,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2083572889, now seen corresponding path program 1 times [2024-11-08 15:37:20,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:37:20,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024033195] [2024-11-08 15:37:20,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:37:20,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:37:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:37:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:37:20,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:37:20,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024033195] [2024-11-08 15:37:20,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024033195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:37:20,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:37:20,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:37:20,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127380780] [2024-11-08 15:37:20,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:37:20,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:37:20,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:37:20,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:37:20,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:37:20,503 INFO L87 Difference]: Start difference. First operand 133181 states and 177554 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:37:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:37:25,140 INFO L93 Difference]: Finished difference Result 303929 states and 404152 transitions. [2024-11-08 15:37:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:37:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-08 15:37:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:37:25,596 INFO L225 Difference]: With dead ends: 303929 [2024-11-08 15:37:25,596 INFO L226 Difference]: Without dead ends: 171664 [2024-11-08 15:37:25,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 15:37:25,691 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 53 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:37:25,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 213 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:37:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171664 states.