./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 23:50:06,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 23:50:06,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-11 23:50:06,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 23:50:06,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 23:50:06,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 23:50:06,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 23:50:06,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 23:50:06,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 23:50:06,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 23:50:06,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 23:50:06,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 23:50:06,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 23:50:06,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 23:50:06,206 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 23:50:06,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 23:50:06,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 23:50:06,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 23:50:06,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 23:50:06,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 23:50:06,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 23:50:06,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 23:50:06,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 23:50:06,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 23:50:06,213 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 23:50:06,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 23:50:06,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 23:50:06,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 23:50:06,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 23:50:06,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:50:06,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 23:50:06,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 23:50:06,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 23:50:06,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 23:50:06,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 23:50:06,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 23:50:06,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 23:50:06,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 23:50:06,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 23:50:06,216 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca [2024-11-11 23:50:06,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 23:50:06,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 23:50:06,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 23:50:06,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 23:50:06,530 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 23:50:06,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-11-11 23:50:08,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 23:50:08,405 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 23:50:08,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-11-11 23:50:08,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0ed4953/ea3ca83bfa5048e781d0bdc10e25aca0/FLAGd3e3ee280 [2024-11-11 23:50:08,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0ed4953/ea3ca83bfa5048e781d0bdc10e25aca0 [2024-11-11 23:50:08,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 23:50:08,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 23:50:08,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 23:50:08,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 23:50:08,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 23:50:08,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:50:08" (1/1) ... [2024-11-11 23:50:08,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f5981a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:08, skipping insertion in model container [2024-11-11 23:50:08,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:50:08" (1/1) ... [2024-11-11 23:50:08,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 23:50:08,946 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2024-11-11 23:50:09,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:50:09,134 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 23:50:09,149 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/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2024-11-11 23:50:09,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:50:09,277 INFO L204 MainTranslator]: Completed translation [2024-11-11 23:50:09,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09 WrapperNode [2024-11-11 23:50:09,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 23:50:09,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 23:50:09,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 23:50:09,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 23:50:09,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (1/1) ... [2024-11-11 23:50:09,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (1/1) ... [2024-11-11 23:50:09,457 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1383 [2024-11-11 23:50:09,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 23:50:09,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 23:50:09,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 23:50:09,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 23:50:09,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (1/1) ... [2024-11-11 23:50:09,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (1/1) ... [2024-11-11 23:50:09,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (1/1) ... [2024-11-11 23:50:09,571 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 23:50:09,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (1/1) ... [2024-11-11 23:50:09,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (1/1) ... [2024-11-11 23:50:09,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (1/1) ... [2024-11-11 23:50:09,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (1/1) ... [2024-11-11 23:50:09,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (1/1) ... [2024-11-11 23:50:09,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (1/1) ... [2024-11-11 23:50:09,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 23:50:09,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 23:50:09,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 23:50:09,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 23:50:09,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (1/1) ... [2024-11-11 23:50:09,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:50:09,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:50:09,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 23:50:09,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 23:50:09,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 23:50:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-11 23:50:09,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-11 23:50:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 23:50:09,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 23:50:09,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 23:50:10,223 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 23:50:10,225 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 23:50:11,901 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-11 23:50:11,901 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 23:50:11,923 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 23:50:11,924 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 23:50:11,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:50:11 BoogieIcfgContainer [2024-11-11 23:50:11,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 23:50:11,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 23:50:11,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 23:50:11,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 23:50:11,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:50:08" (1/3) ... [2024-11-11 23:50:11,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdff2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:50:11, skipping insertion in model container [2024-11-11 23:50:11,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:50:09" (2/3) ... [2024-11-11 23:50:11,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdff2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:50:11, skipping insertion in model container [2024-11-11 23:50:11,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:50:11" (3/3) ... [2024-11-11 23:50:11,934 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-11-11 23:50:11,953 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 23:50:11,954 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 23:50:12,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 23:50:12,037 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;@367b8030, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 23:50:12,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 23:50:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 392 states, 386 states have (on average 1.4922279792746114) internal successors, (576), 387 states have internal predecessors, (576), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 23:50:12,064 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:12,065 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:12,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:12,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:12,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1656611576, now seen corresponding path program 1 times [2024-11-11 23:50:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:12,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344081473] [2024-11-11 23:50:12,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:12,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:12,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:12,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 23:50:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:12,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 23:50:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:12,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:12,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344081473] [2024-11-11 23:50:12,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344081473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:12,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:12,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 23:50:12,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40164713] [2024-11-11 23:50:12,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:12,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 23:50:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:12,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 23:50:12,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 23:50:12,609 INFO L87 Difference]: Start difference. First operand has 392 states, 386 states have (on average 1.4922279792746114) internal successors, (576), 387 states have internal predecessors, (576), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 23:50:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:12,668 INFO L93 Difference]: Finished difference Result 711 states and 1061 transitions. [2024-11-11 23:50:12,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 23:50:12,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 117 [2024-11-11 23:50:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:12,681 INFO L225 Difference]: With dead ends: 711 [2024-11-11 23:50:12,681 INFO L226 Difference]: Without dead ends: 389 [2024-11-11 23:50:12,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-11 23:50:12,689 INFO L435 NwaCegarLoop]: 577 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, 577 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-11 23:50:12,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-11 23:50:12,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-11-11 23:50:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.4869791666666667) internal successors, (571), 384 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 577 transitions. [2024-11-11 23:50:12,748 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 577 transitions. Word has length 117 [2024-11-11 23:50:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:12,749 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 577 transitions. [2024-11-11 23:50:12,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 23:50:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 577 transitions. [2024-11-11 23:50:12,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 23:50:12,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:12,754 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:12,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 23:50:12,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:12,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:12,755 INFO L85 PathProgramCache]: Analyzing trace with hash 782291010, now seen corresponding path program 1 times [2024-11-11 23:50:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633965873] [2024-11-11 23:50:12,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:12,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:13,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:13,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 23:50:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:13,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 23:50:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:13,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:13,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633965873] [2024-11-11 23:50:13,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633965873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:13,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:13,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:13,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928196737] [2024-11-11 23:50:13,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:13,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:13,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:13,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:13,645 INFO L87 Difference]: Start difference. First operand 389 states and 577 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:13,707 INFO L93 Difference]: Finished difference Result 393 states and 581 transitions. [2024-11-11 23:50:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:13,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2024-11-11 23:50:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:13,712 INFO L225 Difference]: With dead ends: 393 [2024-11-11 23:50:13,714 INFO L226 Difference]: Without dead ends: 391 [2024-11-11 23:50:13,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:13,716 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 0 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:13,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1719 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:13,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-11 23:50:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-11 23:50:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.4844559585492227) internal successors, (573), 386 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 579 transitions. [2024-11-11 23:50:13,741 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 579 transitions. Word has length 117 [2024-11-11 23:50:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:13,742 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 579 transitions. [2024-11-11 23:50:13,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 579 transitions. [2024-11-11 23:50:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 23:50:13,746 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:13,746 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:13,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 23:50:13,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:13,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1517086696, now seen corresponding path program 1 times [2024-11-11 23:50:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:13,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485284637] [2024-11-11 23:50:13,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:13,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:14,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:14,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 23:50:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:14,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 23:50:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:14,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:14,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485284637] [2024-11-11 23:50:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485284637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:14,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:14,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88140433] [2024-11-11 23:50:14,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:14,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:14,218 INFO L87 Difference]: Start difference. First operand 391 states and 579 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:14,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:14,609 INFO L93 Difference]: Finished difference Result 971 states and 1441 transitions. [2024-11-11 23:50:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 23:50:14,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2024-11-11 23:50:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:14,616 INFO L225 Difference]: With dead ends: 971 [2024-11-11 23:50:14,616 INFO L226 Difference]: Without dead ends: 391 [2024-11-11 23:50:14,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 23:50:14,622 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 1090 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:14,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1687 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-11 23:50:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-11 23:50:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.4818652849740932) internal successors, (572), 386 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 578 transitions. [2024-11-11 23:50:14,659 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 578 transitions. Word has length 118 [2024-11-11 23:50:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:14,662 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 578 transitions. [2024-11-11 23:50:14,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 578 transitions. [2024-11-11 23:50:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 23:50:14,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:14,664 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:14,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 23:50:14,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:14,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:14,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1565089340, now seen corresponding path program 1 times [2024-11-11 23:50:14,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:14,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681437901] [2024-11-11 23:50:14,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:14,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:15,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:15,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 23:50:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:15,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 23:50:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:15,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:15,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681437901] [2024-11-11 23:50:15,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681437901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:15,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:15,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:15,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940207192] [2024-11-11 23:50:15,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:15,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:15,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:15,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:15,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:15,062 INFO L87 Difference]: Start difference. First operand 391 states and 578 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:15,094 INFO L93 Difference]: Finished difference Result 714 states and 1055 transitions. [2024-11-11 23:50:15,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:15,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2024-11-11 23:50:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:15,098 INFO L225 Difference]: With dead ends: 714 [2024-11-11 23:50:15,098 INFO L226 Difference]: Without dead ends: 393 [2024-11-11 23:50:15,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:15,102 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 0 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:15,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1712 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-11 23:50:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-11 23:50:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4793814432989691) internal successors, (574), 388 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 580 transitions. [2024-11-11 23:50:15,116 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 580 transitions. Word has length 119 [2024-11-11 23:50:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:15,117 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 580 transitions. [2024-11-11 23:50:15,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 580 transitions. [2024-11-11 23:50:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 23:50:15,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:15,119 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:15,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 23:50:15,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:15,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash 175163959, now seen corresponding path program 1 times [2024-11-11 23:50:15,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:15,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526926492] [2024-11-11 23:50:15,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:15,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:15,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 23:50:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:15,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 23:50:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:15,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:15,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526926492] [2024-11-11 23:50:15,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526926492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:15,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:15,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:15,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428542449] [2024-11-11 23:50:15,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:15,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:15,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:15,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:15,614 INFO L87 Difference]: Start difference. First operand 393 states and 580 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:15,680 INFO L93 Difference]: Finished difference Result 716 states and 1056 transitions. [2024-11-11 23:50:15,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:15,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2024-11-11 23:50:15,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:15,683 INFO L225 Difference]: With dead ends: 716 [2024-11-11 23:50:15,683 INFO L226 Difference]: Without dead ends: 393 [2024-11-11 23:50:15,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:15,685 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 487 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:15,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1110 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-11 23:50:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-11 23:50:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4742268041237114) internal successors, (572), 388 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 578 transitions. [2024-11-11 23:50:15,694 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 578 transitions. Word has length 120 [2024-11-11 23:50:15,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:15,694 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 578 transitions. [2024-11-11 23:50:15,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 578 transitions. [2024-11-11 23:50:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 23:50:15,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:15,696 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:15,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 23:50:15,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:15,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:15,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1490569844, now seen corresponding path program 1 times [2024-11-11 23:50:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:15,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253569890] [2024-11-11 23:50:15,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:15,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:16,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 23:50:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:16,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 23:50:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:16,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253569890] [2024-11-11 23:50:16,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253569890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:16,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:16,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:16,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785326126] [2024-11-11 23:50:16,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:16,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:16,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:16,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:16,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:16,049 INFO L87 Difference]: Start difference. First operand 393 states and 578 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:16,119 INFO L93 Difference]: Finished difference Result 716 states and 1052 transitions. [2024-11-11 23:50:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:16,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2024-11-11 23:50:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:16,122 INFO L225 Difference]: With dead ends: 716 [2024-11-11 23:50:16,122 INFO L226 Difference]: Without dead ends: 393 [2024-11-11 23:50:16,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:16,124 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 1041 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:16,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1110 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-11 23:50:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-11 23:50:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4716494845360826) internal successors, (571), 388 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 577 transitions. [2024-11-11 23:50:16,137 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 577 transitions. Word has length 122 [2024-11-11 23:50:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:16,138 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 577 transitions. [2024-11-11 23:50:16,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:16,138 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 577 transitions. [2024-11-11 23:50:16,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 23:50:16,139 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:16,140 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:16,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 23:50:16,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:16,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:16,141 INFO L85 PathProgramCache]: Analyzing trace with hash 990395376, now seen corresponding path program 1 times [2024-11-11 23:50:16,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:16,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669816585] [2024-11-11 23:50:16,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:16,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:16,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 23:50:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:16,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 23:50:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:16,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:16,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669816585] [2024-11-11 23:50:16,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669816585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:16,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:16,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:16,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134759763] [2024-11-11 23:50:16,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:16,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:16,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:16,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:16,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:16,711 INFO L87 Difference]: Start difference. First operand 393 states and 577 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:16,832 INFO L93 Difference]: Finished difference Result 716 states and 1050 transitions. [2024-11-11 23:50:16,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:16,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2024-11-11 23:50:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:16,835 INFO L225 Difference]: With dead ends: 716 [2024-11-11 23:50:16,835 INFO L226 Difference]: Without dead ends: 393 [2024-11-11 23:50:16,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:16,839 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 476 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:16,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1064 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-11 23:50:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-11 23:50:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4690721649484537) internal successors, (570), 388 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 576 transitions. [2024-11-11 23:50:16,853 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 576 transitions. Word has length 123 [2024-11-11 23:50:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:16,854 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 576 transitions. [2024-11-11 23:50:16,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 576 transitions. [2024-11-11 23:50:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 23:50:16,855 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:16,856 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:16,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 23:50:16,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:16,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1202028506, now seen corresponding path program 1 times [2024-11-11 23:50:16,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:16,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078156160] [2024-11-11 23:50:16,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:16,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 23:50:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 23:50:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:17,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:17,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078156160] [2024-11-11 23:50:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078156160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:17,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:17,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17658263] [2024-11-11 23:50:17,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:17,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:17,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:17,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:17,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:17,196 INFO L87 Difference]: Start difference. First operand 393 states and 576 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:17,296 INFO L93 Difference]: Finished difference Result 718 states and 1050 transitions. [2024-11-11 23:50:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:50:17,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2024-11-11 23:50:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:17,298 INFO L225 Difference]: With dead ends: 718 [2024-11-11 23:50:17,299 INFO L226 Difference]: Without dead ends: 393 [2024-11-11 23:50:17,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:50:17,300 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 479 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:17,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1665 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-11 23:50:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-11 23:50:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4664948453608246) internal successors, (569), 388 states have internal predecessors, (569), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 575 transitions. [2024-11-11 23:50:17,310 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 575 transitions. Word has length 124 [2024-11-11 23:50:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:17,310 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 575 transitions. [2024-11-11 23:50:17,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 575 transitions. [2024-11-11 23:50:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 23:50:17,312 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:17,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:17,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 23:50:17,313 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:17,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:17,314 INFO L85 PathProgramCache]: Analyzing trace with hash 685921225, now seen corresponding path program 1 times [2024-11-11 23:50:17,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:17,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494496225] [2024-11-11 23:50:17,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:17,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 23:50:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 23:50:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:17,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:17,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494496225] [2024-11-11 23:50:17,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494496225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:17,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:17,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743872701] [2024-11-11 23:50:17,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:17,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:17,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:17,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:17,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:17,646 INFO L87 Difference]: Start difference. First operand 393 states and 575 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:17,747 INFO L93 Difference]: Finished difference Result 716 states and 1046 transitions. [2024-11-11 23:50:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:17,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125 [2024-11-11 23:50:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:17,750 INFO L225 Difference]: With dead ends: 716 [2024-11-11 23:50:17,750 INFO L226 Difference]: Without dead ends: 393 [2024-11-11 23:50:17,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:17,751 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 1024 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:17,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1064 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-11 23:50:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-11 23:50:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4639175257731958) internal successors, (568), 388 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 574 transitions. [2024-11-11 23:50:17,761 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 574 transitions. Word has length 125 [2024-11-11 23:50:17,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:17,761 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 574 transitions. [2024-11-11 23:50:17,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 574 transitions. [2024-11-11 23:50:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-11 23:50:17,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:17,763 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:17,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 23:50:17,763 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:17,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1133333018, now seen corresponding path program 1 times [2024-11-11 23:50:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077773380] [2024-11-11 23:50:17,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:17,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:18,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 23:50:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 23:50:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:18,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:18,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077773380] [2024-11-11 23:50:18,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077773380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:18,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:18,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274186254] [2024-11-11 23:50:18,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:18,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:18,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:18,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:18,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:18,046 INFO L87 Difference]: Start difference. First operand 393 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:18,150 INFO L93 Difference]: Finished difference Result 716 states and 1044 transitions. [2024-11-11 23:50:18,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:18,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2024-11-11 23:50:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:18,152 INFO L225 Difference]: With dead ends: 716 [2024-11-11 23:50:18,152 INFO L226 Difference]: Without dead ends: 393 [2024-11-11 23:50:18,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:18,154 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 1016 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:18,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1064 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-11 23:50:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-11 23:50:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.461340206185567) internal successors, (567), 388 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 573 transitions. [2024-11-11 23:50:18,166 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 573 transitions. Word has length 126 [2024-11-11 23:50:18,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:18,167 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 573 transitions. [2024-11-11 23:50:18,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 573 transitions. [2024-11-11 23:50:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-11 23:50:18,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:18,169 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:18,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 23:50:18,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:18,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1944964062, now seen corresponding path program 1 times [2024-11-11 23:50:18,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:18,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139967602] [2024-11-11 23:50:18,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:18,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:18,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 23:50:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 23:50:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139967602] [2024-11-11 23:50:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139967602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:18,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:18,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338831111] [2024-11-11 23:50:18,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:18,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:18,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:18,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:18,626 INFO L87 Difference]: Start difference. First operand 393 states and 573 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 23:50:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:18,686 INFO L93 Difference]: Finished difference Result 716 states and 1042 transitions. [2024-11-11 23:50:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:18,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 127 [2024-11-11 23:50:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:18,689 INFO L225 Difference]: With dead ends: 716 [2024-11-11 23:50:18,689 INFO L226 Difference]: Without dead ends: 393 [2024-11-11 23:50:18,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:18,690 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 518 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:18,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1108 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-11 23:50:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-11 23:50:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.458762886597938) internal successors, (566), 388 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 572 transitions. [2024-11-11 23:50:18,700 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 572 transitions. Word has length 127 [2024-11-11 23:50:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:18,701 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 572 transitions. [2024-11-11 23:50:18,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 23:50:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 572 transitions. [2024-11-11 23:50:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 23:50:18,702 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:18,702 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:18,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 23:50:18,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:18,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:18,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1181888200, now seen corresponding path program 1 times [2024-11-11 23:50:18,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:18,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791464825] [2024-11-11 23:50:18,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:18,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:19,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 23:50:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:19,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 23:50:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:19,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:19,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791464825] [2024-11-11 23:50:19,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791464825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:19,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:19,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:19,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236176678] [2024-11-11 23:50:19,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:19,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:19,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:19,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:19,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:19,259 INFO L87 Difference]: Start difference. First operand 393 states and 572 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:19,365 INFO L93 Difference]: Finished difference Result 716 states and 1040 transitions. [2024-11-11 23:50:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:19,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 128 [2024-11-11 23:50:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:19,367 INFO L225 Difference]: With dead ends: 716 [2024-11-11 23:50:19,367 INFO L226 Difference]: Without dead ends: 393 [2024-11-11 23:50:19,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:19,369 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 473 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:19,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1062 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-11 23:50:19,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-11 23:50:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4561855670103092) internal successors, (565), 388 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 571 transitions. [2024-11-11 23:50:19,379 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 571 transitions. Word has length 128 [2024-11-11 23:50:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:19,380 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 571 transitions. [2024-11-11 23:50:19,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 571 transitions. [2024-11-11 23:50:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 23:50:19,381 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:19,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:19,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 23:50:19,382 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:19,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash 988572428, now seen corresponding path program 1 times [2024-11-11 23:50:19,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:19,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287790482] [2024-11-11 23:50:19,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:19,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:19,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 23:50:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:19,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 23:50:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:19,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:19,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287790482] [2024-11-11 23:50:19,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287790482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:19,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:19,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:19,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776395341] [2024-11-11 23:50:19,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:19,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:19,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:19,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:19,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:19,875 INFO L87 Difference]: Start difference. First operand 393 states and 571 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:20,004 INFO L93 Difference]: Finished difference Result 716 states and 1038 transitions. [2024-11-11 23:50:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:20,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 129 [2024-11-11 23:50:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:20,007 INFO L225 Difference]: With dead ends: 716 [2024-11-11 23:50:20,007 INFO L226 Difference]: Without dead ends: 393 [2024-11-11 23:50:20,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:20,009 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 469 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:20,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1069 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:20,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-11 23:50:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-11 23:50:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4536082474226804) internal successors, (564), 388 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 570 transitions. [2024-11-11 23:50:20,022 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 570 transitions. Word has length 129 [2024-11-11 23:50:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:20,022 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 570 transitions. [2024-11-11 23:50:20,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 570 transitions. [2024-11-11 23:50:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 23:50:20,024 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:20,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:20,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 23:50:20,025 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:20,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash 406852665, now seen corresponding path program 1 times [2024-11-11 23:50:20,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:20,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536069422] [2024-11-11 23:50:20,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:20,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:20,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:20,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 23:50:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:20,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 23:50:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536069422] [2024-11-11 23:50:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536069422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:20,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:20,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888679041] [2024-11-11 23:50:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:20,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:20,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:20,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:20,737 INFO L87 Difference]: Start difference. First operand 393 states and 570 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:20,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:20,973 INFO L93 Difference]: Finished difference Result 722 states and 1044 transitions. [2024-11-11 23:50:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:50:20,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130 [2024-11-11 23:50:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:20,976 INFO L225 Difference]: With dead ends: 722 [2024-11-11 23:50:20,976 INFO L226 Difference]: Without dead ends: 397 [2024-11-11 23:50:20,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-11 23:50:20,977 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 2 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:20,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2087 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-11 23:50:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2024-11-11 23:50:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4512820512820512) internal successors, (566), 390 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 572 transitions. [2024-11-11 23:50:20,987 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 572 transitions. Word has length 130 [2024-11-11 23:50:20,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:20,988 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 572 transitions. [2024-11-11 23:50:20,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 572 transitions. [2024-11-11 23:50:20,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 23:50:20,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:20,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:20,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 23:50:20,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:20,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1709410096, now seen corresponding path program 1 times [2024-11-11 23:50:20,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:20,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145827698] [2024-11-11 23:50:20,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 23:50:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 23:50:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:21,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:21,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145827698] [2024-11-11 23:50:21,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145827698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:21,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:21,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:21,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796763465] [2024-11-11 23:50:21,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:21,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:21,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:21,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:21,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:21,417 INFO L87 Difference]: Start difference. First operand 395 states and 572 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:21,530 INFO L93 Difference]: Finished difference Result 720 states and 1040 transitions. [2024-11-11 23:50:21,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:21,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131 [2024-11-11 23:50:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:21,533 INFO L225 Difference]: With dead ends: 720 [2024-11-11 23:50:21,533 INFO L226 Difference]: Without dead ends: 395 [2024-11-11 23:50:21,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:21,534 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 926 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:21,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1062 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-11 23:50:21,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-11 23:50:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4487179487179487) internal successors, (565), 390 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2024-11-11 23:50:21,545 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 131 [2024-11-11 23:50:21,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:21,545 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2024-11-11 23:50:21,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2024-11-11 23:50:21,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-11 23:50:21,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:21,547 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:21,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 23:50:21,547 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:21,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:21,548 INFO L85 PathProgramCache]: Analyzing trace with hash -815191116, now seen corresponding path program 1 times [2024-11-11 23:50:21,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:21,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752288] [2024-11-11 23:50:21,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:21,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 23:50:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 23:50:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:21,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:21,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752288] [2024-11-11 23:50:21,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:21,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:21,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:21,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210841377] [2024-11-11 23:50:21,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:21,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:21,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:21,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:21,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:21,884 INFO L87 Difference]: Start difference. First operand 395 states and 571 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 23:50:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:21,952 INFO L93 Difference]: Finished difference Result 720 states and 1038 transitions. [2024-11-11 23:50:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:21,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 132 [2024-11-11 23:50:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:21,955 INFO L225 Difference]: With dead ends: 720 [2024-11-11 23:50:21,955 INFO L226 Difference]: Without dead ends: 395 [2024-11-11 23:50:21,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:21,958 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 513 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:21,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1102 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-11 23:50:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-11 23:50:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4461538461538461) internal successors, (564), 390 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 570 transitions. [2024-11-11 23:50:21,971 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 570 transitions. Word has length 132 [2024-11-11 23:50:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:21,971 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 570 transitions. [2024-11-11 23:50:21,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 23:50:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 570 transitions. [2024-11-11 23:50:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-11 23:50:21,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:21,973 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:21,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 23:50:21,973 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:21,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:21,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1900448443, now seen corresponding path program 1 times [2024-11-11 23:50:21,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:21,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031956535] [2024-11-11 23:50:21,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:21,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:22,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:22,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 23:50:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:22,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 23:50:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:22,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031956535] [2024-11-11 23:50:22,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031956535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:22,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:22,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922011529] [2024-11-11 23:50:22,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:22,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:22,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:22,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:22,761 INFO L87 Difference]: Start difference. First operand 395 states and 570 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:22,811 INFO L93 Difference]: Finished difference Result 766 states and 1093 transitions. [2024-11-11 23:50:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:50:22,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133 [2024-11-11 23:50:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:22,814 INFO L225 Difference]: With dead ends: 766 [2024-11-11 23:50:22,814 INFO L226 Difference]: Without dead ends: 441 [2024-11-11 23:50:22,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-11 23:50:22,815 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 19 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:22,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2223 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-11 23:50:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 439. [2024-11-11 23:50:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 434 states have (on average 1.4216589861751152) internal successors, (617), 434 states have internal predecessors, (617), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 623 transitions. [2024-11-11 23:50:22,827 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 623 transitions. Word has length 133 [2024-11-11 23:50:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:22,828 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 623 transitions. [2024-11-11 23:50:22,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 623 transitions. [2024-11-11 23:50:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-11 23:50:22,829 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:22,829 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:22,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 23:50:22,830 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:22,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash -306752993, now seen corresponding path program 1 times [2024-11-11 23:50:22,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:22,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446436400] [2024-11-11 23:50:22,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:22,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:23,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 23:50:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:23,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 23:50:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:23,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 23:50:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:23,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:23,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446436400] [2024-11-11 23:50:23,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446436400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:23,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:23,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 23:50:23,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948631805] [2024-11-11 23:50:23,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:23,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 23:50:23,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:23,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 23:50:23,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:50:23,626 INFO L87 Difference]: Start difference. First operand 439 states and 623 transitions. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:23,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:23,944 INFO L93 Difference]: Finished difference Result 886 states and 1253 transitions. [2024-11-11 23:50:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 23:50:23,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 134 [2024-11-11 23:50:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:23,946 INFO L225 Difference]: With dead ends: 886 [2024-11-11 23:50:23,946 INFO L226 Difference]: Without dead ends: 443 [2024-11-11 23:50:23,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-11 23:50:23,948 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 646 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:23,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 2562 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-11 23:50:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2024-11-11 23:50:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 436 states have (on average 1.4174311926605505) internal successors, (618), 436 states have internal predecessors, (618), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 23:50:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 624 transitions. [2024-11-11 23:50:23,961 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 624 transitions. Word has length 134 [2024-11-11 23:50:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:23,961 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 624 transitions. [2024-11-11 23:50:23,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 624 transitions. [2024-11-11 23:50:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-11 23:50:23,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:23,963 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:23,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 23:50:23,963 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:23,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1457685238, now seen corresponding path program 1 times [2024-11-11 23:50:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:23,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805684686] [2024-11-11 23:50:23,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:23,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:24,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:25,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:25,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 23:50:25,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:25,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805684686] [2024-11-11 23:50:25,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805684686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:25,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 23:50:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20925619] [2024-11-11 23:50:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:25,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 23:50:25,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:25,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 23:50:25,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:25,010 INFO L87 Difference]: Start difference. First operand 441 states and 624 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:25,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:25,133 INFO L93 Difference]: Finished difference Result 980 states and 1367 transitions. [2024-11-11 23:50:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 23:50:25,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 135 [2024-11-11 23:50:25,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:25,136 INFO L225 Difference]: With dead ends: 980 [2024-11-11 23:50:25,136 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 23:50:25,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-11 23:50:25,137 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 857 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:25,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 2198 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 23:50:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-11 23:50:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3876871880199668) internal successors, (834), 601 states have internal predecessors, (834), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 23:50:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 846 transitions. [2024-11-11 23:50:25,160 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 846 transitions. Word has length 135 [2024-11-11 23:50:25,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:25,160 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 846 transitions. [2024-11-11 23:50:25,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 846 transitions. [2024-11-11 23:50:25,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-11 23:50:25,164 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:25,165 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:25,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 23:50:25,165 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:25,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2091908698, now seen corresponding path program 1 times [2024-11-11 23:50:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:25,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450999234] [2024-11-11 23:50:25,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:26,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:26,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:26,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:26,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-11 23:50:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-11 23:50:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:26,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-11 23:50:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:26,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:26,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450999234] [2024-11-11 23:50:26,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450999234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:26,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:26,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:26,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636587419] [2024-11-11 23:50:26,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:26,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:26,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:26,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:26,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:26,235 INFO L87 Difference]: Start difference. First operand 609 states and 846 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:26,349 INFO L93 Difference]: Finished difference Result 980 states and 1366 transitions. [2024-11-11 23:50:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:26,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2024-11-11 23:50:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:26,353 INFO L225 Difference]: With dead ends: 980 [2024-11-11 23:50:26,353 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 23:50:26,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:26,355 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 936 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:26,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1058 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 23:50:26,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-11 23:50:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3860232945091515) internal successors, (833), 601 states have internal predecessors, (833), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 23:50:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 845 transitions. [2024-11-11 23:50:26,381 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 845 transitions. Word has length 324 [2024-11-11 23:50:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:26,381 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 845 transitions. [2024-11-11 23:50:26,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 845 transitions. [2024-11-11 23:50:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-11 23:50:26,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:26,387 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:26,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 23:50:26,388 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:26,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash -722514356, now seen corresponding path program 1 times [2024-11-11 23:50:26,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:26,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928083611] [2024-11-11 23:50:26,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:26,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:27,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:27,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:27,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:27,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-11 23:50:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:27,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-11 23:50:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:27,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-11 23:50:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:27,607 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:27,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:27,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928083611] [2024-11-11 23:50:27,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928083611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:27,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:27,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:27,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996878918] [2024-11-11 23:50:27,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:27,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:27,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:27,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:27,612 INFO L87 Difference]: Start difference. First operand 609 states and 845 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:27,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:27,718 INFO L93 Difference]: Finished difference Result 980 states and 1364 transitions. [2024-11-11 23:50:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:27,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2024-11-11 23:50:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:27,721 INFO L225 Difference]: With dead ends: 980 [2024-11-11 23:50:27,722 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 23:50:27,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:27,724 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 506 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:27,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1065 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 23:50:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-11 23:50:27,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3843594009983362) internal successors, (832), 601 states have internal predecessors, (832), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 23:50:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 844 transitions. [2024-11-11 23:50:27,747 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 844 transitions. Word has length 325 [2024-11-11 23:50:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:27,747 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 844 transitions. [2024-11-11 23:50:27,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 844 transitions. [2024-11-11 23:50:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-11 23:50:27,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:27,753 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:27,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 23:50:27,753 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:27,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:27,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1951186673, now seen corresponding path program 1 times [2024-11-11 23:50:27,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:27,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715156841] [2024-11-11 23:50:27,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:27,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:28,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:28,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:28,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-11 23:50:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-11 23:50:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:28,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-11 23:50:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:28,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:28,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715156841] [2024-11-11 23:50:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715156841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:28,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:28,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:28,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772919914] [2024-11-11 23:50:28,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:28,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:28,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:28,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:28,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:28,823 INFO L87 Difference]: Start difference. First operand 609 states and 844 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:29,009 INFO L93 Difference]: Finished difference Result 980 states and 1362 transitions. [2024-11-11 23:50:29,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:29,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2024-11-11 23:50:29,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:29,016 INFO L225 Difference]: With dead ends: 980 [2024-11-11 23:50:29,016 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 23:50:29,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:29,021 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 904 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:29,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 1058 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 23:50:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-11 23:50:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.382695507487521) internal successors, (831), 601 states have internal predecessors, (831), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 23:50:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 843 transitions. [2024-11-11 23:50:29,065 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 843 transitions. Word has length 326 [2024-11-11 23:50:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:29,066 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 843 transitions. [2024-11-11 23:50:29,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 843 transitions. [2024-11-11 23:50:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-11 23:50:29,078 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:29,079 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:29,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 23:50:29,079 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:29,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1071864095, now seen corresponding path program 1 times [2024-11-11 23:50:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:29,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684716256] [2024-11-11 23:50:29,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:29,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:29,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:29,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:29,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:29,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-11 23:50:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:29,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-11 23:50:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:29,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-11 23:50:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684716256] [2024-11-11 23:50:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684716256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:29,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:29,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763110761] [2024-11-11 23:50:29,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:29,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:29,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:29,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:29,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:29,991 INFO L87 Difference]: Start difference. First operand 609 states and 843 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:30,085 INFO L93 Difference]: Finished difference Result 980 states and 1360 transitions. [2024-11-11 23:50:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:30,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2024-11-11 23:50:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:30,089 INFO L225 Difference]: With dead ends: 980 [2024-11-11 23:50:30,089 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 23:50:30,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:30,091 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 490 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:30,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1065 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 23:50:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-11 23:50:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3810316139767056) internal successors, (830), 601 states have internal predecessors, (830), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 23:50:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 842 transitions. [2024-11-11 23:50:30,109 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 842 transitions. Word has length 327 [2024-11-11 23:50:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:30,110 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 842 transitions. [2024-11-11 23:50:30,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 842 transitions. [2024-11-11 23:50:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-11 23:50:30,114 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:30,114 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:30,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 23:50:30,115 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:30,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash 437028676, now seen corresponding path program 1 times [2024-11-11 23:50:30,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:30,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437569916] [2024-11-11 23:50:30,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-11 23:50:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-11 23:50:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-11 23:50:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437569916] [2024-11-11 23:50:31,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437569916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:31,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:31,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:31,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736095108] [2024-11-11 23:50:31,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:31,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:31,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:31,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:31,177 INFO L87 Difference]: Start difference. First operand 609 states and 842 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:31,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:31,251 INFO L93 Difference]: Finished difference Result 980 states and 1358 transitions. [2024-11-11 23:50:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:31,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2024-11-11 23:50:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:31,255 INFO L225 Difference]: With dead ends: 980 [2024-11-11 23:50:31,256 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 23:50:31,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:31,257 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 475 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:31,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1089 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 23:50:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-11 23:50:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3793677204658903) internal successors, (829), 601 states have internal predecessors, (829), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 23:50:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 841 transitions. [2024-11-11 23:50:31,285 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 841 transitions. Word has length 328 [2024-11-11 23:50:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:31,285 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 841 transitions. [2024-11-11 23:50:31,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 841 transitions. [2024-11-11 23:50:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-11 23:50:31,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:31,292 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:31,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 23:50:31,292 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:31,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash -825845002, now seen corresponding path program 1 times [2024-11-11 23:50:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466195718] [2024-11-11 23:50:31,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:32,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:32,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-11 23:50:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:32,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-11 23:50:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-11 23:50:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:32,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:32,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466195718] [2024-11-11 23:50:32,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466195718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:32,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:32,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:32,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255979737] [2024-11-11 23:50:32,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:32,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:32,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:32,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:32,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:32,372 INFO L87 Difference]: Start difference. First operand 609 states and 841 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:32,441 INFO L93 Difference]: Finished difference Result 980 states and 1356 transitions. [2024-11-11 23:50:32,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:32,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2024-11-11 23:50:32,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:32,449 INFO L225 Difference]: With dead ends: 980 [2024-11-11 23:50:32,449 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 23:50:32,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:32,451 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 849 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:32,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 1082 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 23:50:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-11 23:50:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.377703826955075) internal successors, (828), 601 states have internal predecessors, (828), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 23:50:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 840 transitions. [2024-11-11 23:50:32,469 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 840 transitions. Word has length 329 [2024-11-11 23:50:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:32,470 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 840 transitions. [2024-11-11 23:50:32,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 840 transitions. [2024-11-11 23:50:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-11 23:50:32,474 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:32,475 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:32,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 23:50:32,475 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:32,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash -174190343, now seen corresponding path program 1 times [2024-11-11 23:50:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:32,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856747800] [2024-11-11 23:50:32,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:33,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:33,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:33,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:33,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 23:50:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:33,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-11 23:50:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:33,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-11 23:50:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:33,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:33,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856747800] [2024-11-11 23:50:33,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856747800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:33,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:33,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855045734] [2024-11-11 23:50:33,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:33,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:33,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:33,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:33,433 INFO L87 Difference]: Start difference. First operand 609 states and 840 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:33,720 INFO L93 Difference]: Finished difference Result 980 states and 1354 transitions. [2024-11-11 23:50:33,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:33,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2024-11-11 23:50:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:33,723 INFO L225 Difference]: With dead ends: 980 [2024-11-11 23:50:33,724 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 23:50:33,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:33,725 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 789 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:33,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 802 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 23:50:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-11 23:50:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3760399334442597) internal successors, (827), 601 states have internal predecessors, (827), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 23:50:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 839 transitions. [2024-11-11 23:50:33,741 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 839 transitions. Word has length 330 [2024-11-11 23:50:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:33,742 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 839 transitions. [2024-11-11 23:50:33,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 839 transitions. [2024-11-11 23:50:33,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-11 23:50:33,746 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:33,747 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:33,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 23:50:33,747 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:33,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:33,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1306618507, now seen corresponding path program 1 times [2024-11-11 23:50:33,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:33,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136857372] [2024-11-11 23:50:33,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:33,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-11 23:50:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-11 23:50:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-11 23:50:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:35,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:35,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136857372] [2024-11-11 23:50:35,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136857372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:35,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:35,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:35,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806278927] [2024-11-11 23:50:35,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:35,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:35,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:35,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:35,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:35,470 INFO L87 Difference]: Start difference. First operand 609 states and 839 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:35,529 INFO L93 Difference]: Finished difference Result 980 states and 1352 transitions. [2024-11-11 23:50:35,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:35,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331 [2024-11-11 23:50:35,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:35,533 INFO L225 Difference]: With dead ends: 980 [2024-11-11 23:50:35,533 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 23:50:35,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:35,534 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 381 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:35,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1080 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:50:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 23:50:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-11 23:50:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3743760399334441) internal successors, (826), 601 states have internal predecessors, (826), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 23:50:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 838 transitions. [2024-11-11 23:50:35,555 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 838 transitions. Word has length 331 [2024-11-11 23:50:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:35,556 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 838 transitions. [2024-11-11 23:50:35,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 838 transitions. [2024-11-11 23:50:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-11 23:50:35,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:35,563 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:35,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 23:50:35,563 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:35,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash 84549355, now seen corresponding path program 1 times [2024-11-11 23:50:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:35,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386234701] [2024-11-11 23:50:35,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:35,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:37,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:37,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:37,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 23:50:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:37,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-11 23:50:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-11 23:50:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:37,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:37,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386234701] [2024-11-11 23:50:37,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386234701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:37,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:37,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:37,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119282566] [2024-11-11 23:50:37,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:37,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:37,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:37,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:37,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:37,062 INFO L87 Difference]: Start difference. First operand 609 states and 838 transitions. Second operand has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:37,177 INFO L93 Difference]: Finished difference Result 980 states and 1350 transitions. [2024-11-11 23:50:37,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:37,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2024-11-11 23:50:37,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:37,185 INFO L225 Difference]: With dead ends: 980 [2024-11-11 23:50:37,185 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 23:50:37,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:37,189 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 861 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:37,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1050 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 23:50:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-11 23:50:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3727121464226288) internal successors, (825), 601 states have internal predecessors, (825), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 23:50:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 837 transitions. [2024-11-11 23:50:37,221 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 837 transitions. Word has length 332 [2024-11-11 23:50:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:37,222 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 837 transitions. [2024-11-11 23:50:37,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 837 transitions. [2024-11-11 23:50:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-11 23:50:37,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:37,230 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:37,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 23:50:37,230 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:37,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:37,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1221638347, now seen corresponding path program 1 times [2024-11-11 23:50:37,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:37,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289195291] [2024-11-11 23:50:37,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:37,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:38,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:38,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-11 23:50:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:38,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-11 23:50:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:38,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-11 23:50:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:38,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:38,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289195291] [2024-11-11 23:50:38,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289195291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:38,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:38,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:38,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286632560] [2024-11-11 23:50:38,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:38,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:38,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:38,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:38,949 INFO L87 Difference]: Start difference. First operand 609 states and 837 transitions. Second operand has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:39,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:39,058 INFO L93 Difference]: Finished difference Result 980 states and 1348 transitions. [2024-11-11 23:50:39,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:39,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 333 [2024-11-11 23:50:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:39,062 INFO L225 Difference]: With dead ends: 980 [2024-11-11 23:50:39,062 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 23:50:39,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:39,063 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 453 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:39,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1057 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 23:50:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-11 23:50:39,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3710482529118135) internal successors, (824), 601 states have internal predecessors, (824), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 23:50:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 836 transitions. [2024-11-11 23:50:39,083 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 836 transitions. Word has length 333 [2024-11-11 23:50:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:39,084 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 836 transitions. [2024-11-11 23:50:39,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 836 transitions. [2024-11-11 23:50:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-11 23:50:39,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:39,087 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:39,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 23:50:39,088 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:39,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:39,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1872351418, now seen corresponding path program 1 times [2024-11-11 23:50:39,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:39,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434856074] [2024-11-11 23:50:39,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:39,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:40,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:40,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:40,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:40,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-11 23:50:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:40,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-11 23:50:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:40,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-11 23:50:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:40,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434856074] [2024-11-11 23:50:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434856074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:40,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:40,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:40,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567288144] [2024-11-11 23:50:40,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:40,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:40,460 INFO L87 Difference]: Start difference. First operand 609 states and 836 transitions. Second operand has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:40,556 INFO L93 Difference]: Finished difference Result 980 states and 1346 transitions. [2024-11-11 23:50:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:40,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 334 [2024-11-11 23:50:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:40,559 INFO L225 Difference]: With dead ends: 980 [2024-11-11 23:50:40,559 INFO L226 Difference]: Without dead ends: 609 [2024-11-11 23:50:40,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:40,561 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 452 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:40,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1057 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:50:40,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-11 23:50:40,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-11 23:50:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3693843594009982) internal successors, (823), 601 states have internal predecessors, (823), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-11 23:50:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 835 transitions. [2024-11-11 23:50:40,577 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 835 transitions. Word has length 334 [2024-11-11 23:50:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:40,578 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 835 transitions. [2024-11-11 23:50:40,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 835 transitions. [2024-11-11 23:50:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-11 23:50:40,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:40,581 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:40,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 23:50:40,582 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:40,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:40,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2098226244, now seen corresponding path program 1 times [2024-11-11 23:50:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:40,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472669661] [2024-11-11 23:50:40,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:40,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:42,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:42,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:42,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:42,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-11 23:50:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:42,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-11 23:50:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:42,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-11 23:50:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:42,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:42,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472669661] [2024-11-11 23:50:42,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472669661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:42,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:42,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 23:50:42,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797708042] [2024-11-11 23:50:42,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:42,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 23:50:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:42,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 23:50:42,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:42,041 INFO L87 Difference]: Start difference. First operand 609 states and 835 transitions. Second operand has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:42,573 INFO L93 Difference]: Finished difference Result 1429 states and 1965 transitions. [2024-11-11 23:50:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 23:50:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2024-11-11 23:50:42,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:42,582 INFO L225 Difference]: With dead ends: 1429 [2024-11-11 23:50:42,582 INFO L226 Difference]: Without dead ends: 1058 [2024-11-11 23:50:42,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:50:42,584 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 591 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:42,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1968 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 23:50:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-11-11 23:50:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 936. [2024-11-11 23:50:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 925 states have (on average 1.3654054054054054) internal successors, (1263), 925 states have internal predecessors, (1263), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 23:50:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1281 transitions. [2024-11-11 23:50:42,655 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1281 transitions. Word has length 335 [2024-11-11 23:50:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:42,655 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1281 transitions. [2024-11-11 23:50:42,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:42,656 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1281 transitions. [2024-11-11 23:50:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-11 23:50:42,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:42,664 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:42,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-11 23:50:42,665 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:42,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:42,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1248794528, now seen corresponding path program 1 times [2024-11-11 23:50:42,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:42,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443151077] [2024-11-11 23:50:42,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:42,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:45,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:45,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:45,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-11 23:50:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-11 23:50:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-11 23:50:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:50:45,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:45,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443151077] [2024-11-11 23:50:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443151077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:45,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:45,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 23:50:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435008392] [2024-11-11 23:50:45,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:45,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 23:50:45,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:45,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 23:50:45,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:50:45,554 INFO L87 Difference]: Start difference. First operand 936 states and 1281 transitions. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:46,452 INFO L93 Difference]: Finished difference Result 1330 states and 1824 transitions. [2024-11-11 23:50:46,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 23:50:46,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336 [2024-11-11 23:50:46,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:46,456 INFO L225 Difference]: With dead ends: 1330 [2024-11-11 23:50:46,456 INFO L226 Difference]: Without dead ends: 959 [2024-11-11 23:50:46,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:50:46,457 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 766 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:46,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1579 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 23:50:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-11-11 23:50:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 937. [2024-11-11 23:50:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 926 states have (on average 1.3650107991360692) internal successors, (1264), 926 states have internal predecessors, (1264), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 23:50:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1282 transitions. [2024-11-11 23:50:46,487 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1282 transitions. Word has length 336 [2024-11-11 23:50:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:46,487 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1282 transitions. [2024-11-11 23:50:46,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1282 transitions. [2024-11-11 23:50:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-11 23:50:46,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:46,492 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:46,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-11 23:50:46,492 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:46,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:46,493 INFO L85 PathProgramCache]: Analyzing trace with hash 214777389, now seen corresponding path program 1 times [2024-11-11 23:50:46,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:46,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687147268] [2024-11-11 23:50:46,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:46,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 23:50:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:48,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 23:50:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 23:50:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:48,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-11 23:50:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:48,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-11 23:50:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-11 23:50:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-11 23:50:48,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:48,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687147268] [2024-11-11 23:50:48,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687147268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:48,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:48,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 23:50:48,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703037097] [2024-11-11 23:50:48,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:48,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 23:50:48,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:48,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 23:50:48,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 23:50:48,447 INFO L87 Difference]: Start difference. First operand 937 states and 1282 transitions. Second operand has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:49,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:49,789 INFO L93 Difference]: Finished difference Result 2112 states and 2883 transitions. [2024-11-11 23:50:49,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 23:50:49,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336 [2024-11-11 23:50:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:49,796 INFO L225 Difference]: With dead ends: 2112 [2024-11-11 23:50:49,797 INFO L226 Difference]: Without dead ends: 1625 [2024-11-11 23:50:49,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-11 23:50:49,799 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 1362 mSDsluCounter, 3404 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 4322 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:49,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 4322 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 23:50:49,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-11-11 23:50:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1006. [2024-11-11 23:50:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 992 states have (on average 1.3669354838709677) internal successors, (1356), 992 states have internal predecessors, (1356), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 23:50:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1380 transitions. [2024-11-11 23:50:49,839 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1380 transitions. Word has length 336 [2024-11-11 23:50:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:49,842 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1380 transitions. [2024-11-11 23:50:49,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:49,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1380 transitions. [2024-11-11 23:50:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-11 23:50:49,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:49,845 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:49,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-11 23:50:49,845 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:49,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash 401373631, now seen corresponding path program 1 times [2024-11-11 23:50:49,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:49,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868441488] [2024-11-11 23:50:49,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:49,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:51,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:51,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:51,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:51,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-11 23:50:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:51,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-11 23:50:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:51,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-11 23:50:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-11 23:50:51,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:51,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868441488] [2024-11-11 23:50:51,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868441488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:51,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:51,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:50:51,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932890060] [2024-11-11 23:50:51,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:51,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:50:51,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:51,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:50:51,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:51,673 INFO L87 Difference]: Start difference. First operand 1006 states and 1380 transitions. Second operand has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:51,999 INFO L93 Difference]: Finished difference Result 1672 states and 2269 transitions. [2024-11-11 23:50:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:50:51,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 337 [2024-11-11 23:50:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:52,004 INFO L225 Difference]: With dead ends: 1672 [2024-11-11 23:50:52,004 INFO L226 Difference]: Without dead ends: 1018 [2024-11-11 23:50:52,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:50:52,005 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 323 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:52,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1188 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-11-11 23:50:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1012. [2024-11-11 23:50:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 998 states have (on average 1.3647294589178356) internal successors, (1362), 998 states have internal predecessors, (1362), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 23:50:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1386 transitions. [2024-11-11 23:50:52,032 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1386 transitions. Word has length 337 [2024-11-11 23:50:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:52,033 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1386 transitions. [2024-11-11 23:50:52,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 23:50:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1386 transitions. [2024-11-11 23:50:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-11 23:50:52,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:52,036 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:52,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-11 23:50:52,036 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:52,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:52,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1255397875, now seen corresponding path program 1 times [2024-11-11 23:50:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:52,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461539459] [2024-11-11 23:50:52,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:52,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:53,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:53,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:53,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-11 23:50:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:53,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-11 23:50:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:53,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-11 23:50:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-11 23:50:53,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:53,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461539459] [2024-11-11 23:50:53,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461539459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:53,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:53,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:50:53,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424054075] [2024-11-11 23:50:53,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:53,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:53,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:53,074 INFO L87 Difference]: Start difference. First operand 1012 states and 1386 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:53,324 INFO L93 Difference]: Finished difference Result 1668 states and 2259 transitions. [2024-11-11 23:50:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:53,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 337 [2024-11-11 23:50:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:53,328 INFO L225 Difference]: With dead ends: 1668 [2024-11-11 23:50:53,328 INFO L226 Difference]: Without dead ends: 1012 [2024-11-11 23:50:53,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:50:53,330 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 501 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:53,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 807 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 23:50:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-11-11 23:50:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2024-11-11 23:50:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 998 states have (on average 1.3587174348697395) internal successors, (1356), 998 states have internal predecessors, (1356), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 23:50:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1380 transitions. [2024-11-11 23:50:53,361 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1380 transitions. Word has length 337 [2024-11-11 23:50:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:53,361 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1380 transitions. [2024-11-11 23:50:53,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1380 transitions. [2024-11-11 23:50:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-11 23:50:53,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:53,365 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:53,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-11 23:50:53,365 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:53,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:53,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1921807987, now seen corresponding path program 1 times [2024-11-11 23:50:53,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:53,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279720464] [2024-11-11 23:50:53,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:53,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:55,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:55,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:55,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:55,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-11 23:50:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:55,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-11 23:50:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:55,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-11 23:50:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-11 23:50:55,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:55,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279720464] [2024-11-11 23:50:55,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279720464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:55,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:50:55,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 23:50:55,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734952950] [2024-11-11 23:50:55,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:55,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 23:50:55,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:55,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 23:50:55,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 23:50:55,043 INFO L87 Difference]: Start difference. First operand 1012 states and 1380 transitions. Second operand has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:55,744 INFO L93 Difference]: Finished difference Result 2518 states and 3403 transitions. [2024-11-11 23:50:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 23:50:55,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339 [2024-11-11 23:50:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:55,755 INFO L225 Difference]: With dead ends: 2518 [2024-11-11 23:50:55,755 INFO L226 Difference]: Without dead ends: 1878 [2024-11-11 23:50:55,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-11 23:50:55,759 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 1289 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:55,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 2402 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 23:50:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2024-11-11 23:50:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1870. [2024-11-11 23:50:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1844 states have (on average 1.3503253796095445) internal successors, (2490), 1844 states have internal predecessors, (2490), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-11 23:50:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2538 transitions. [2024-11-11 23:50:55,808 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2538 transitions. Word has length 339 [2024-11-11 23:50:55,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:55,808 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 2538 transitions. [2024-11-11 23:50:55,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2538 transitions. [2024-11-11 23:50:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-11 23:50:55,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:55,813 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:55,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-11 23:50:55,814 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:55,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2080700861, now seen corresponding path program 1 times [2024-11-11 23:50:55,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:55,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947061666] [2024-11-11 23:50:55,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:55,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:50:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:57,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 23:50:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:57,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 23:50:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:57,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 23:50:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:57,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-11 23:50:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-11 23:50:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-11 23:50:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 79 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-11 23:50:57,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:50:57,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947061666] [2024-11-11 23:50:57,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947061666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 23:50:57,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522309869] [2024-11-11 23:50:57,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:57,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 23:50:57,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:50:57,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 23:50:57,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 23:50:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:50:58,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 23:50:58,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 23:50:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-11 23:50:58,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 23:50:58,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522309869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:50:58,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 23:50:58,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-11 23:50:58,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490773065] [2024-11-11 23:50:58,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:50:58,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:50:58,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:50:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:50:58,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:50:58,962 INFO L87 Difference]: Start difference. First operand 1870 states and 2538 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:50:59,304 INFO L93 Difference]: Finished difference Result 2599 states and 3514 transitions. [2024-11-11 23:50:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:50:59,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 341 [2024-11-11 23:50:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:50:59,309 INFO L225 Difference]: With dead ends: 2599 [2024-11-11 23:50:59,310 INFO L226 Difference]: Without dead ends: 1010 [2024-11-11 23:50:59,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-11 23:50:59,315 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 458 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:50:59,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 794 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:50:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-11-11 23:50:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2024-11-11 23:50:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 996 states have (on average 1.3534136546184738) internal successors, (1348), 996 states have internal predecessors, (1348), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 23:50:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1372 transitions. [2024-11-11 23:50:59,341 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1372 transitions. Word has length 341 [2024-11-11 23:50:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:50:59,341 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1372 transitions. [2024-11-11 23:50:59,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 23:50:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1372 transitions. [2024-11-11 23:50:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-11 23:50:59,345 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:50:59,345 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:50:59,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 23:50:59,545 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,SelfDestructingSolverStorable36 [2024-11-11 23:50:59,546 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:50:59,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:50:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1578736179, now seen corresponding path program 1 times [2024-11-11 23:50:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:50:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348906765] [2024-11-11 23:50:59,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:50:59,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:51:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:01,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 23:51:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:01,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 23:51:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:01,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 23:51:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:01,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-11 23:51:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:01,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-11 23:51:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:01,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-11 23:51:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-11 23:51:01,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:51:01,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348906765] [2024-11-11 23:51:01,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348906765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:51:01,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:51:01,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 23:51:01,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133999223] [2024-11-11 23:51:01,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:51:01,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 23:51:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:51:01,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 23:51:01,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-11 23:51:01,720 INFO L87 Difference]: Start difference. First operand 1010 states and 1372 transitions. Second operand has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 23:51:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:51:02,724 INFO L93 Difference]: Finished difference Result 2457 states and 3296 transitions. [2024-11-11 23:51:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 23:51:02,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 341 [2024-11-11 23:51:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:51:02,731 INFO L225 Difference]: With dead ends: 2457 [2024-11-11 23:51:02,731 INFO L226 Difference]: Without dead ends: 1746 [2024-11-11 23:51:02,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-11 23:51:02,733 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 2136 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 23:51:02,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 3382 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 23:51:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2024-11-11 23:51:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1126. [2024-11-11 23:51:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1108 states have (on average 1.364620938628159) internal successors, (1512), 1108 states have internal predecessors, (1512), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-11 23:51:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1544 transitions. [2024-11-11 23:51:02,763 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1544 transitions. Word has length 341 [2024-11-11 23:51:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:51:02,763 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1544 transitions. [2024-11-11 23:51:02,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 23:51:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1544 transitions. [2024-11-11 23:51:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-11-11 23:51:02,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:51:02,767 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:51:02,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-11 23:51:02,767 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:51:02,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:51:02,768 INFO L85 PathProgramCache]: Analyzing trace with hash 675720909, now seen corresponding path program 1 times [2024-11-11 23:51:02,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:51:02,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210377262] [2024-11-11 23:51:02,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:51:02,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:51:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:04,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 23:51:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 23:51:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:04,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 23:51:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:04,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-11 23:51:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:04,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-11 23:51:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:04,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-11 23:51:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-11 23:51:04,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:51:04,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210377262] [2024-11-11 23:51:04,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210377262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:51:04,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:51:04,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 23:51:04,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730418322] [2024-11-11 23:51:04,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:51:04,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 23:51:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:51:04,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 23:51:04,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 23:51:04,327 INFO L87 Difference]: Start difference. First operand 1126 states and 1544 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 23:51:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:51:04,753 INFO L93 Difference]: Finished difference Result 2071 states and 2832 transitions. [2024-11-11 23:51:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 23:51:04,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 343 [2024-11-11 23:51:04,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:51:04,757 INFO L225 Difference]: With dead ends: 2071 [2024-11-11 23:51:04,758 INFO L226 Difference]: Without dead ends: 1142 [2024-11-11 23:51:04,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-11 23:51:04,759 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 536 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 23:51:04,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1560 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 23:51:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-11 23:51:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1134. [2024-11-11 23:51:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1116 states have (on average 1.3584229390681004) internal successors, (1516), 1116 states have internal predecessors, (1516), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-11 23:51:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1548 transitions. [2024-11-11 23:51:04,785 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1548 transitions. Word has length 343 [2024-11-11 23:51:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:51:04,786 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1548 transitions. [2024-11-11 23:51:04,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 23:51:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1548 transitions. [2024-11-11 23:51:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-11-11 23:51:04,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:51:04,789 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:51:04,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-11 23:51:04,789 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:51:04,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:51:04,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1280165033, now seen corresponding path program 1 times [2024-11-11 23:51:04,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:51:04,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040324264] [2024-11-11 23:51:04,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:51:04,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:51:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:06,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 23:51:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 23:51:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 23:51:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:06,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-11 23:51:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-11 23:51:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:06,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-11 23:51:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-11 23:51:06,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:51:06,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040324264] [2024-11-11 23:51:06,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040324264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:51:06,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:51:06,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 23:51:06,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092267075] [2024-11-11 23:51:06,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:51:06,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 23:51:06,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:51:06,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 23:51:06,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:51:06,153 INFO L87 Difference]: Start difference. First operand 1134 states and 1548 transitions. Second operand has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 23:51:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:51:06,601 INFO L93 Difference]: Finished difference Result 2061 states and 2807 transitions. [2024-11-11 23:51:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 23:51:06,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 345 [2024-11-11 23:51:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:51:06,609 INFO L225 Difference]: With dead ends: 2061 [2024-11-11 23:51:06,612 INFO L226 Difference]: Without dead ends: 1142 [2024-11-11 23:51:06,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 23:51:06,614 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 495 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 23:51:06,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1553 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 23:51:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-11 23:51:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1138. [2024-11-11 23:51:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1120 states have (on average 1.3571428571428572) internal successors, (1520), 1120 states have internal predecessors, (1520), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-11 23:51:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1552 transitions. [2024-11-11 23:51:06,640 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1552 transitions. Word has length 345 [2024-11-11 23:51:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:51:06,640 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1552 transitions. [2024-11-11 23:51:06,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 23:51:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1552 transitions. [2024-11-11 23:51:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-11 23:51:06,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:51:06,644 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:51:06,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-11 23:51:06,644 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:51:06,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:51:06,645 INFO L85 PathProgramCache]: Analyzing trace with hash -240678099, now seen corresponding path program 1 times [2024-11-11 23:51:06,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:51:06,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361694774] [2024-11-11 23:51:06,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:51:06,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:51:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:08,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 23:51:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:08,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 23:51:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:08,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 23:51:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:08,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-11 23:51:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:08,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-11 23:51:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:08,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-11-11 23:51:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:51:08,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:51:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361694774] [2024-11-11 23:51:08,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361694774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 23:51:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688584130] [2024-11-11 23:51:08,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:51:08,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 23:51:08,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:51:08,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 23:51:08,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 23:51:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:09,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-11 23:51:09,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 23:51:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-11 23:51:10,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 23:51:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-11 23:51:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688584130] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 23:51:10,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 23:51:10,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 25 [2024-11-11 23:51:10,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394227164] [2024-11-11 23:51:10,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:51:10,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 23:51:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:51:10,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 23:51:10,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-11-11 23:51:10,559 INFO L87 Difference]: Start difference. First operand 1138 states and 1552 transitions. Second operand has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 23:51:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:51:10,984 INFO L93 Difference]: Finished difference Result 2009 states and 2729 transitions. [2024-11-11 23:51:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 23:51:10,985 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 347 [2024-11-11 23:51:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:51:10,988 INFO L225 Difference]: With dead ends: 2009 [2024-11-11 23:51:10,988 INFO L226 Difference]: Without dead ends: 1170 [2024-11-11 23:51:10,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2024-11-11 23:51:10,990 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 1074 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 23:51:10,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 1563 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 23:51:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2024-11-11 23:51:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1170. [2024-11-11 23:51:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1152 states have (on average 1.3576388888888888) internal successors, (1564), 1152 states have internal predecessors, (1564), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-11 23:51:11,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1596 transitions. [2024-11-11 23:51:11,017 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1596 transitions. Word has length 347 [2024-11-11 23:51:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:51:11,017 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1596 transitions. [2024-11-11 23:51:11,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 23:51:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1596 transitions. [2024-11-11 23:51:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-11 23:51:11,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:51:11,021 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:51:11,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 23:51:11,221 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,SelfDestructingSolverStorable40 [2024-11-11 23:51:11,222 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:51:11,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:51:11,222 INFO L85 PathProgramCache]: Analyzing trace with hash -167980851, now seen corresponding path program 1 times [2024-11-11 23:51:11,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:51:11,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938400871] [2024-11-11 23:51:11,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:51:11,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:51:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:13,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 23:51:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:13,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 23:51:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:13,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 23:51:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:13,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-11 23:51:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:13,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-11 23:51:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:13,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-11 23:51:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-11 23:51:13,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:51:13,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938400871] [2024-11-11 23:51:13,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938400871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:51:13,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:51:13,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 23:51:13,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861730799] [2024-11-11 23:51:13,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:51:13,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 23:51:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:51:13,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 23:51:13,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 23:51:13,649 INFO L87 Difference]: Start difference. First operand 1170 states and 1596 transitions. Second operand has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 23:51:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:51:14,019 INFO L93 Difference]: Finished difference Result 2207 states and 2999 transitions. [2024-11-11 23:51:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 23:51:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 347 [2024-11-11 23:51:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:51:14,023 INFO L225 Difference]: With dead ends: 2207 [2024-11-11 23:51:14,023 INFO L226 Difference]: Without dead ends: 1538 [2024-11-11 23:51:14,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-11 23:51:14,025 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 1246 mSDsluCounter, 5173 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 6015 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 23:51:14,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 6015 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 23:51:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-11 23:51:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1235. [2024-11-11 23:51:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1214 states have (on average 1.3599670510708401) internal successors, (1651), 1214 states have internal predecessors, (1651), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-11 23:51:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1689 transitions. [2024-11-11 23:51:14,070 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1689 transitions. Word has length 347 [2024-11-11 23:51:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:51:14,071 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1689 transitions. [2024-11-11 23:51:14,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 23:51:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1689 transitions. [2024-11-11 23:51:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-11 23:51:14,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:51:14,075 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:51:14,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-11 23:51:14,075 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:51:14,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:51:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1056061037, now seen corresponding path program 1 times [2024-11-11 23:51:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:51:14,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067860974] [2024-11-11 23:51:14,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:51:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:51:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 23:51:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:16,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 23:51:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 23:51:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-11 23:51:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:16,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-11 23:51:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:16,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-11 23:51:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:51:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 23:51:16,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:51:16,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067860974] [2024-11-11 23:51:16,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067860974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 23:51:16,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338551150] [2024-11-11 23:51:16,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:51:16,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 23:51:16,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:51:16,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 23:51:16,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process