./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:37:49,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:37:49,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:37:49,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:37:49,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:37:49,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:37:49,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:37:49,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:37:49,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:37:49,130 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:37:49,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:37:49,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:37:49,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:37:49,131 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:37:49,131 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:37:49,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:37:49,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:37:49,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:37:49,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:37:49,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:37:49,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:37:49,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:37:49,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:37:49,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:37:49,138 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:37:49,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:37:49,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:37:49,139 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:37:49,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:37:49,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:37:49,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:37:49,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:37:49,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:37:49,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:37:49,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:37:49,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:37:49,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:37:49,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:37:49,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:37:49,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:37:49,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:37:49,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:37:49,142 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 [2024-10-13 22:37:49,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:37:49,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:37:49,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:37:49,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:37:49,326 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:37:49,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2024-10-13 22:37:50,613 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:37:50,772 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:37:50,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2024-10-13 22:37:50,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be978101/c9f1450b31ca49fcb0978ce3537a80a2/FLAGf6e144151 [2024-10-13 22:37:51,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be978101/c9f1450b31ca49fcb0978ce3537a80a2 [2024-10-13 22:37:51,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:37:51,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:37:51,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:37:51,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:37:51,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:37:51,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a399c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51, skipping insertion in model container [2024-10-13 22:37:51,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:37:51,333 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i[1166,1179] [2024-10-13 22:37:51,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:37:51,381 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:37:51,393 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i[1166,1179] [2024-10-13 22:37:51,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:37:51,434 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:37:51,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51 WrapperNode [2024-10-13 22:37:51,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:37:51,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:37:51,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:37:51,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:37:51,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,492 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 149 [2024-10-13 22:37:51,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:37:51,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:37:51,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:37:51,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:37:51,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,521 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-10-13 22:37:51,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:37:51,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:37:51,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:37:51,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:37:51,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (1/1) ... [2024-10-13 22:37:51,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:37:51,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:37:51,568 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-10-13 22:37:51,574 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-10-13 22:37:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:37:51,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:37:51,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:37:51,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:37:51,664 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:37:51,666 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:37:51,963 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-13 22:37:51,963 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:37:52,008 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:37:52,009 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 22:37:52,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:37:52 BoogieIcfgContainer [2024-10-13 22:37:52,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:37:52,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:37:52,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:37:52,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:37:52,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:37:51" (1/3) ... [2024-10-13 22:37:52,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424cc0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:37:52, skipping insertion in model container [2024-10-13 22:37:52,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:37:51" (2/3) ... [2024-10-13 22:37:52,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424cc0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:37:52, skipping insertion in model container [2024-10-13 22:37:52,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:37:52" (3/3) ... [2024-10-13 22:37:52,019 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2024-10-13 22:37:52,032 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:37:52,032 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:37:52,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:37:52,083 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;@29be446c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:37:52,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:37:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 46 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 22:37:52,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:52,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:52,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:52,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1580274276, now seen corresponding path program 1 times [2024-10-13 22:37:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:52,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495382256] [2024-10-13 22:37:52,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:52,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:37:52,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:52,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495382256] [2024-10-13 22:37:52,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495382256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:52,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:37:52,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:37:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46099377] [2024-10-13 22:37:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:52,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 22:37:52,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:52,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 22:37:52,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:37:52,291 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 46 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:52,310 INFO L93 Difference]: Finished difference Result 68 states and 115 transitions. [2024-10-13 22:37:52,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 22:37:52,312 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 22:37:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:52,318 INFO L225 Difference]: With dead ends: 68 [2024-10-13 22:37:52,319 INFO L226 Difference]: Without dead ends: 45 [2024-10-13 22:37:52,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:37:52,325 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:52,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:37:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-13 22:37:52,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-13 22:37:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.75) internal successors, (77), 44 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 77 transitions. [2024-10-13 22:37:52,366 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 77 transitions. Word has length 13 [2024-10-13 22:37:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:52,366 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 77 transitions. [2024-10-13 22:37:52,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2024-10-13 22:37:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 22:37:52,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:52,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:52,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:37:52,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:52,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:52,369 INFO L85 PathProgramCache]: Analyzing trace with hash 388665470, now seen corresponding path program 1 times [2024-10-13 22:37:52,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:52,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758588151] [2024-10-13 22:37:52,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:52,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:37:52,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:52,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758588151] [2024-10-13 22:37:52,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758588151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:52,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:37:52,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:37:52,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440973667] [2024-10-13 22:37:52,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:52,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:37:52,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:52,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:37:52,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:37:52,590 INFO L87 Difference]: Start difference. First operand 45 states and 77 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:52,697 INFO L93 Difference]: Finished difference Result 104 states and 183 transitions. [2024-10-13 22:37:52,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:37:52,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 22:37:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:52,698 INFO L225 Difference]: With dead ends: 104 [2024-10-13 22:37:52,698 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 22:37:52,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:37:52,699 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 24 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:52,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 82 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:37:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 22:37:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-10-13 22:37:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 65 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-13 22:37:52,705 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 13 [2024-10-13 22:37:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:52,705 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-13 22:37:52,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-13 22:37:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 22:37:52,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:52,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:52,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:37:52,707 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:52,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash -920391629, now seen corresponding path program 1 times [2024-10-13 22:37:52,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:52,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991869052] [2024-10-13 22:37:52,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:37:52,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:52,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991869052] [2024-10-13 22:37:52,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991869052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:52,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:37:52,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:37:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260301656] [2024-10-13 22:37:52,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:52,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:37:52,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:52,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:37:52,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:37:52,794 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:52,983 INFO L93 Difference]: Finished difference Result 161 states and 276 transitions. [2024-10-13 22:37:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:37:52,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-13 22:37:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:52,985 INFO L225 Difference]: With dead ends: 161 [2024-10-13 22:37:52,985 INFO L226 Difference]: Without dead ends: 125 [2024-10-13 22:37:52,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-13 22:37:52,987 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 92 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:52,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 108 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:37:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-13 22:37:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2024-10-13 22:37:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.5568181818181819) internal successors, (137), 88 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2024-10-13 22:37:52,994 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 19 [2024-10-13 22:37:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:52,994 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2024-10-13 22:37:52,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2024-10-13 22:37:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 22:37:52,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:52,996 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:52,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:37:52,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:52,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:52,996 INFO L85 PathProgramCache]: Analyzing trace with hash 414964068, now seen corresponding path program 1 times [2024-10-13 22:37:52,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:52,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687482283] [2024-10-13 22:37:52,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:52,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:37:53,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:53,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687482283] [2024-10-13 22:37:53,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687482283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:53,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:37:53,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:37:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429297888] [2024-10-13 22:37:53,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:53,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:37:53,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:53,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:37:53,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:37:53,140 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:53,268 INFO L93 Difference]: Finished difference Result 231 states and 351 transitions. [2024-10-13 22:37:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:37:53,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-13 22:37:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:53,269 INFO L225 Difference]: With dead ends: 231 [2024-10-13 22:37:53,269 INFO L226 Difference]: Without dead ends: 154 [2024-10-13 22:37:53,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-13 22:37:53,270 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 70 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:53,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 172 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:37:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-13 22:37:53,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 97. [2024-10-13 22:37:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 96 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 146 transitions. [2024-10-13 22:37:53,278 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 146 transitions. Word has length 25 [2024-10-13 22:37:53,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:53,278 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 146 transitions. [2024-10-13 22:37:53,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:53,279 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 146 transitions. [2024-10-13 22:37:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 22:37:53,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:53,280 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:53,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:37:53,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:53,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash 983673701, now seen corresponding path program 1 times [2024-10-13 22:37:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:53,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906630842] [2024-10-13 22:37:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:37:53,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:53,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906630842] [2024-10-13 22:37:53,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906630842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:53,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:37:53,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:37:53,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122993607] [2024-10-13 22:37:53,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:53,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:37:53,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:53,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:37:53,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:37:53,374 INFO L87 Difference]: Start difference. First operand 97 states and 146 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:53,497 INFO L93 Difference]: Finished difference Result 252 states and 377 transitions. [2024-10-13 22:37:53,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:37:53,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 22:37:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:53,498 INFO L225 Difference]: With dead ends: 252 [2024-10-13 22:37:53,498 INFO L226 Difference]: Without dead ends: 174 [2024-10-13 22:37:53,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-13 22:37:53,500 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 74 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:53,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 180 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:37:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-13 22:37:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 107. [2024-10-13 22:37:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.5) internal successors, (159), 106 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2024-10-13 22:37:53,508 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 26 [2024-10-13 22:37:53,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:53,508 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2024-10-13 22:37:53,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2024-10-13 22:37:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 22:37:53,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:53,509 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:53,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 22:37:53,510 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:53,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:53,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1858982925, now seen corresponding path program 1 times [2024-10-13 22:37:53,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:53,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61098280] [2024-10-13 22:37:53,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:53,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:37:53,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:53,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61098280] [2024-10-13 22:37:53,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61098280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:37:53,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718054394] [2024-10-13 22:37:53,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:53,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:37:53,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:37:53,592 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-10-13 22:37:53,594 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-10-13 22:37:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:53,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 22:37:53,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:37:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 22:37:53,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:37:53,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718054394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:53,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:37:53,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-13 22:37:53,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872466264] [2024-10-13 22:37:53,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:53,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:37:53,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:53,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:37:53,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:37:53,751 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:53,912 INFO L93 Difference]: Finished difference Result 227 states and 360 transitions. [2024-10-13 22:37:53,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:37:53,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-13 22:37:53,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:53,913 INFO L225 Difference]: With dead ends: 227 [2024-10-13 22:37:53,913 INFO L226 Difference]: Without dead ends: 152 [2024-10-13 22:37:53,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:37:53,914 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 37 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:53,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 143 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:37:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-13 22:37:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2024-10-13 22:37:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4370370370370371) internal successors, (194), 135 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2024-10-13 22:37:53,921 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 27 [2024-10-13 22:37:53,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:53,921 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2024-10-13 22:37:53,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2024-10-13 22:37:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 22:37:53,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:53,923 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:53,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 22:37:54,123 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,SelfDestructingSolverStorable5 [2024-10-13 22:37:54,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:54,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:54,124 INFO L85 PathProgramCache]: Analyzing trace with hash 466929768, now seen corresponding path program 1 times [2024-10-13 22:37:54,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:54,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306471794] [2024-10-13 22:37:54,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:54,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:37:54,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:54,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306471794] [2024-10-13 22:37:54,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306471794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:37:54,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482768942] [2024-10-13 22:37:54,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:54,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:37:54,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:37:54,237 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-10-13 22:37:54,238 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-10-13 22:37:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:54,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 22:37:54,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:37:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 22:37:54,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:37:54,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482768942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:54,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:37:54,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-10-13 22:37:54,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419764315] [2024-10-13 22:37:54,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:54,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:37:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:54,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:37:54,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:37:54,336 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:54,464 INFO L93 Difference]: Finished difference Result 285 states and 424 transitions. [2024-10-13 22:37:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:37:54,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-13 22:37:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:54,466 INFO L225 Difference]: With dead ends: 285 [2024-10-13 22:37:54,466 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 22:37:54,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:37:54,468 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 36 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:54,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 143 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:37:54,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 22:37:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 159. [2024-10-13 22:37:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.3987341772151898) internal successors, (221), 158 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2024-10-13 22:37:54,482 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 33 [2024-10-13 22:37:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:54,482 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2024-10-13 22:37:54,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2024-10-13 22:37:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 22:37:54,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:54,483 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:54,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 22:37:54,683 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,SelfDestructingSolverStorable6 [2024-10-13 22:37:54,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:54,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:54,685 INFO L85 PathProgramCache]: Analyzing trace with hash -564822695, now seen corresponding path program 1 times [2024-10-13 22:37:54,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:54,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901733248] [2024-10-13 22:37:54,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:54,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 22:37:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901733248] [2024-10-13 22:37:54,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901733248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:54,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:37:54,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:37:54,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736657414] [2024-10-13 22:37:54,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:54,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:37:54,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:54,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:37:54,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:37:54,793 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:54,974 INFO L93 Difference]: Finished difference Result 513 states and 711 transitions. [2024-10-13 22:37:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:37:54,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-13 22:37:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:54,976 INFO L225 Difference]: With dead ends: 513 [2024-10-13 22:37:54,976 INFO L226 Difference]: Without dead ends: 383 [2024-10-13 22:37:54,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10-13 22:37:54,977 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 152 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:54,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 297 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:37:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-13 22:37:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 159. [2024-10-13 22:37:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.3987341772151898) internal successors, (221), 158 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:54,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2024-10-13 22:37:54,991 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 39 [2024-10-13 22:37:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:54,992 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2024-10-13 22:37:54,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2024-10-13 22:37:54,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 22:37:54,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:54,993 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:54,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 22:37:54,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:54,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash -985440832, now seen corresponding path program 1 times [2024-10-13 22:37:54,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:54,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828192257] [2024-10-13 22:37:54,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:54,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 22:37:55,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:55,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828192257] [2024-10-13 22:37:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828192257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:55,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:37:55,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 22:37:55,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797807588] [2024-10-13 22:37:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:55,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:37:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:55,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:37:55,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:37:55,092 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:55,269 INFO L93 Difference]: Finished difference Result 493 states and 686 transitions. [2024-10-13 22:37:55,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:37:55,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-13 22:37:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:55,271 INFO L225 Difference]: With dead ends: 493 [2024-10-13 22:37:55,271 INFO L226 Difference]: Without dead ends: 364 [2024-10-13 22:37:55,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-10-13 22:37:55,273 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 141 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:55,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 262 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:37:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-13 22:37:55,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 159. [2024-10-13 22:37:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.3987341772151898) internal successors, (221), 158 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2024-10-13 22:37:55,285 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 40 [2024-10-13 22:37:55,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:55,285 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2024-10-13 22:37:55,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2024-10-13 22:37:55,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 22:37:55,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:55,286 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:55,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 22:37:55,289 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:55,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:55,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1696419390, now seen corresponding path program 1 times [2024-10-13 22:37:55,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:55,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15184352] [2024-10-13 22:37:55,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:55,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 22:37:55,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:55,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15184352] [2024-10-13 22:37:55,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15184352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:55,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:37:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 22:37:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654514681] [2024-10-13 22:37:55,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:55,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:37:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:55,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:37:55,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:37:55,411 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:55,686 INFO L93 Difference]: Finished difference Result 601 states and 834 transitions. [2024-10-13 22:37:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:37:55,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-13 22:37:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:55,688 INFO L225 Difference]: With dead ends: 601 [2024-10-13 22:37:55,688 INFO L226 Difference]: Without dead ends: 472 [2024-10-13 22:37:55,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-10-13 22:37:55,689 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 212 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:55,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 393 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:37:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-10-13 22:37:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 159. [2024-10-13 22:37:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.3987341772151898) internal successors, (221), 158 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2024-10-13 22:37:55,696 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 41 [2024-10-13 22:37:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:55,697 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2024-10-13 22:37:55,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2024-10-13 22:37:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 22:37:55,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:55,698 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:55,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 22:37:55,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:55,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:55,702 INFO L85 PathProgramCache]: Analyzing trace with hash -354564608, now seen corresponding path program 1 times [2024-10-13 22:37:55,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:55,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438322929] [2024-10-13 22:37:55,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:55,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 22:37:55,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:55,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438322929] [2024-10-13 22:37:55,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438322929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:55,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:37:55,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 22:37:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856775211] [2024-10-13 22:37:55,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:55,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 22:37:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:55,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 22:37:55,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:37:55,835 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:56,202 INFO L93 Difference]: Finished difference Result 642 states and 885 transitions. [2024-10-13 22:37:56,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 22:37:56,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-13 22:37:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:56,204 INFO L225 Difference]: With dead ends: 642 [2024-10-13 22:37:56,204 INFO L226 Difference]: Without dead ends: 512 [2024-10-13 22:37:56,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-10-13 22:37:56,204 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 307 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:56,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 560 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:37:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-10-13 22:37:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 147. [2024-10-13 22:37:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.3904109589041096) internal successors, (203), 146 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. [2024-10-13 22:37:56,211 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 203 transitions. Word has length 41 [2024-10-13 22:37:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:56,211 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 203 transitions. [2024-10-13 22:37:56,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 203 transitions. [2024-10-13 22:37:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 22:37:56,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:56,212 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:56,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 22:37:56,213 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:56,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash 695912277, now seen corresponding path program 1 times [2024-10-13 22:37:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:56,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339996734] [2024-10-13 22:37:56,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:56,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 22:37:56,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:56,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339996734] [2024-10-13 22:37:56,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339996734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:56,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:37:56,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:37:56,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207209024] [2024-10-13 22:37:56,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:56,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:37:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:56,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:37:56,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:37:56,278 INFO L87 Difference]: Start difference. First operand 147 states and 203 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:56,290 INFO L93 Difference]: Finished difference Result 217 states and 295 transitions. [2024-10-13 22:37:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:37:56,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-13 22:37:56,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:56,292 INFO L225 Difference]: With dead ends: 217 [2024-10-13 22:37:56,292 INFO L226 Difference]: Without dead ends: 177 [2024-10-13 22:37:56,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:37:56,292 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:56,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 146 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:37:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-13 22:37:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-10-13 22:37:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.3579545454545454) internal successors, (239), 176 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 239 transitions. [2024-10-13 22:37:56,300 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 239 transitions. Word has length 46 [2024-10-13 22:37:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:56,300 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 239 transitions. [2024-10-13 22:37:56,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2024-10-13 22:37:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 22:37:56,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:56,302 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:56,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 22:37:56,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:56,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:56,303 INFO L85 PathProgramCache]: Analyzing trace with hash 970671891, now seen corresponding path program 1 times [2024-10-13 22:37:56,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:56,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873761973] [2024-10-13 22:37:56,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:56,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 22:37:56,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:56,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873761973] [2024-10-13 22:37:56,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873761973] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:37:56,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317065154] [2024-10-13 22:37:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:56,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:37:56,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:37:56,410 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-10-13 22:37:56,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 22:37:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:56,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 22:37:56,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:37:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 22:37:56,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:37:56,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317065154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:56,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:37:56,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-10-13 22:37:56,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610522874] [2024-10-13 22:37:56,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:56,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:37:56,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:37:56,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:37:56,510 INFO L87 Difference]: Start difference. First operand 177 states and 239 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:56,603 INFO L93 Difference]: Finished difference Result 523 states and 708 transitions. [2024-10-13 22:37:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:37:56,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-13 22:37:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:56,604 INFO L225 Difference]: With dead ends: 523 [2024-10-13 22:37:56,604 INFO L226 Difference]: Without dead ends: 331 [2024-10-13 22:37:56,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:37:56,605 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 36 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:56,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 176 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:37:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-13 22:37:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 302. [2024-10-13 22:37:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.3322259136212624) internal successors, (401), 301 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 401 transitions. [2024-10-13 22:37:56,620 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 401 transitions. Word has length 46 [2024-10-13 22:37:56,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:56,620 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 401 transitions. [2024-10-13 22:37:56,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 401 transitions. [2024-10-13 22:37:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 22:37:56,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:56,621 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:56,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 22:37:56,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:37:56,825 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:56,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:56,825 INFO L85 PathProgramCache]: Analyzing trace with hash 537130145, now seen corresponding path program 1 times [2024-10-13 22:37:56,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:56,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026779766] [2024-10-13 22:37:56,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:56,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 22:37:56,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:56,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026779766] [2024-10-13 22:37:56,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026779766] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:37:56,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850861891] [2024-10-13 22:37:56,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:56,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:37:56,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:37:56,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:37:56,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 22:37:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:57,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 22:37:57,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:37:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 22:37:57,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:37:57,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850861891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:57,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:37:57,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2024-10-13 22:37:57,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145323778] [2024-10-13 22:37:57,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:57,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 22:37:57,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:57,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 22:37:57,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-13 22:37:57,135 INFO L87 Difference]: Start difference. First operand 302 states and 401 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:57,318 INFO L93 Difference]: Finished difference Result 965 states and 1302 transitions. [2024-10-13 22:37:57,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 22:37:57,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-13 22:37:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:57,320 INFO L225 Difference]: With dead ends: 965 [2024-10-13 22:37:57,320 INFO L226 Difference]: Without dead ends: 801 [2024-10-13 22:37:57,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-13 22:37:57,321 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 371 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:57,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 675 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:37:57,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-10-13 22:37:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 406. [2024-10-13 22:37:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 1.3358024691358024) internal successors, (541), 405 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 541 transitions. [2024-10-13 22:37:57,338 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 541 transitions. Word has length 47 [2024-10-13 22:37:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:57,338 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 541 transitions. [2024-10-13 22:37:57,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 541 transitions. [2024-10-13 22:37:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 22:37:57,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:57,339 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:57,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 22:37:57,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:37:57,540 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:57,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:57,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1385856520, now seen corresponding path program 1 times [2024-10-13 22:37:57,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:57,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133936019] [2024-10-13 22:37:57,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:57,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 22:37:57,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:57,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133936019] [2024-10-13 22:37:57,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133936019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:57,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:37:57,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 22:37:57,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011927756] [2024-10-13 22:37:57,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:57,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 22:37:57,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:57,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 22:37:57,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 22:37:57,695 INFO L87 Difference]: Start difference. First operand 406 states and 541 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:58,083 INFO L93 Difference]: Finished difference Result 1501 states and 1971 transitions. [2024-10-13 22:37:58,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 22:37:58,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-13 22:37:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:58,086 INFO L225 Difference]: With dead ends: 1501 [2024-10-13 22:37:58,086 INFO L226 Difference]: Without dead ends: 1235 [2024-10-13 22:37:58,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-10-13 22:37:58,088 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 251 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:58,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 473 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:37:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2024-10-13 22:37:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 398. [2024-10-13 22:37:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.3425692695214106) internal successors, (533), 397 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 533 transitions. [2024-10-13 22:37:58,107 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 533 transitions. Word has length 48 [2024-10-13 22:37:58,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:58,107 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 533 transitions. [2024-10-13 22:37:58,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 533 transitions. [2024-10-13 22:37:58,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 22:37:58,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:58,109 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:58,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 22:37:58,109 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:58,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:58,109 INFO L85 PathProgramCache]: Analyzing trace with hash 59779456, now seen corresponding path program 1 times [2024-10-13 22:37:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:58,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186161912] [2024-10-13 22:37:58,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:58,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 22:37:58,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:58,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186161912] [2024-10-13 22:37:58,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186161912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:37:58,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:37:58,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 22:37:58,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888960908] [2024-10-13 22:37:58,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:37:58,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 22:37:58,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:58,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 22:37:58,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:37:58,197 INFO L87 Difference]: Start difference. First operand 398 states and 533 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:37:58,320 INFO L93 Difference]: Finished difference Result 993 states and 1324 transitions. [2024-10-13 22:37:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 22:37:58,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-13 22:37:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:37:58,323 INFO L225 Difference]: With dead ends: 993 [2024-10-13 22:37:58,323 INFO L226 Difference]: Without dead ends: 682 [2024-10-13 22:37:58,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10-13 22:37:58,324 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 44 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:37:58,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 136 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:37:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-10-13 22:37:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 619. [2024-10-13 22:37:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 618 states have (on average 1.3236245954692556) internal successors, (818), 618 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 818 transitions. [2024-10-13 22:37:58,349 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 818 transitions. Word has length 49 [2024-10-13 22:37:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:37:58,349 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 818 transitions. [2024-10-13 22:37:58,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:37:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 818 transitions. [2024-10-13 22:37:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 22:37:58,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:37:58,350 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:37:58,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 22:37:58,351 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:37:58,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:37:58,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1404509181, now seen corresponding path program 1 times [2024-10-13 22:37:58,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:37:58,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734779913] [2024-10-13 22:37:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:37:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 22:37:58,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:37:58,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734779913] [2024-10-13 22:37:58,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734779913] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:37:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711513663] [2024-10-13 22:37:58,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:37:58,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:37:58,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:37:58,464 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:37:58,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 22:37:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:37:58,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 22:37:58,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:37:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 22:37:58,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:37:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 22:37:58,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711513663] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:37:58,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:37:58,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 18 [2024-10-13 22:37:58,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677290267] [2024-10-13 22:37:58,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:37:58,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 22:37:58,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:37:58,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 22:37:58,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-10-13 22:37:58,790 INFO L87 Difference]: Start difference. First operand 619 states and 818 transitions. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:00,798 INFO L93 Difference]: Finished difference Result 3258 states and 4546 transitions. [2024-10-13 22:38:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-10-13 22:38:00,799 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-13 22:38:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:00,805 INFO L225 Difference]: With dead ends: 3258 [2024-10-13 22:38:00,805 INFO L226 Difference]: Without dead ends: 2509 [2024-10-13 22:38:00,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1172, Invalid=4230, Unknown=0, NotChecked=0, Total=5402 [2024-10-13 22:38:00,807 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 1237 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 2100 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1237 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 2298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:00,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1237 Valid, 505 Invalid, 2298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2100 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 22:38:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2024-10-13 22:38:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1806. [2024-10-13 22:38:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1805 states have (on average 1.296398891966759) internal successors, (2340), 1805 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2340 transitions. [2024-10-13 22:38:00,898 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2340 transitions. Word has length 50 [2024-10-13 22:38:00,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:00,898 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2340 transitions. [2024-10-13 22:38:00,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2340 transitions. [2024-10-13 22:38:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 22:38:00,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:00,899 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:38:00,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 22:38:01,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 22:38:01,100 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:01,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:01,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1469543108, now seen corresponding path program 1 times [2024-10-13 22:38:01,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:01,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477714097] [2024-10-13 22:38:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:01,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 22:38:01,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:01,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477714097] [2024-10-13 22:38:01,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477714097] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:01,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158924] [2024-10-13 22:38:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:01,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:01,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:01,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:01,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 22:38:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:01,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 22:38:01,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 22:38:01,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:38:01,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:38:01,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:38:01,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-10-13 22:38:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213986982] [2024-10-13 22:38:01,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:01,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 22:38:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:01,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 22:38:01,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 22:38:01,423 INFO L87 Difference]: Start difference. First operand 1806 states and 2340 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:01,921 INFO L93 Difference]: Finished difference Result 3559 states and 4661 transitions. [2024-10-13 22:38:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 22:38:01,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-13 22:38:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:01,948 INFO L225 Difference]: With dead ends: 3559 [2024-10-13 22:38:01,948 INFO L226 Difference]: Without dead ends: 2664 [2024-10-13 22:38:01,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-10-13 22:38:01,950 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 229 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:01,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 372 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:38:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2024-10-13 22:38:02,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2443. [2024-10-13 22:38:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2442 states have (on average 1.2936117936117937) internal successors, (3159), 2442 states have internal predecessors, (3159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3159 transitions. [2024-10-13 22:38:02,093 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3159 transitions. Word has length 51 [2024-10-13 22:38:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:02,093 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3159 transitions. [2024-10-13 22:38:02,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3159 transitions. [2024-10-13 22:38:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 22:38:02,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:02,095 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:38:02,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 22:38:02,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 22:38:02,300 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:02,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash 728236542, now seen corresponding path program 1 times [2024-10-13 22:38:02,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:02,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275250162] [2024-10-13 22:38:02,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:02,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 22:38:02,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:02,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275250162] [2024-10-13 22:38:02,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275250162] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:02,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127964529] [2024-10-13 22:38:02,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:02,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:02,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:02,434 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:02,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 22:38:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:02,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 22:38:02,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 22:38:02,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:38:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127964529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:38:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:38:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2024-10-13 22:38:02,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124666565] [2024-10-13 22:38:02,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:38:02,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 22:38:02,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:02,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 22:38:02,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:38:02,552 INFO L87 Difference]: Start difference. First operand 2443 states and 3159 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:38:03,134 INFO L93 Difference]: Finished difference Result 4224 states and 5516 transitions. [2024-10-13 22:38:03,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 22:38:03,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-13 22:38:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:38:03,143 INFO L225 Difference]: With dead ends: 4224 [2024-10-13 22:38:03,143 INFO L226 Difference]: Without dead ends: 3365 [2024-10-13 22:38:03,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-13 22:38:03,146 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 287 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:38:03,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 633 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:38:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2024-10-13 22:38:03,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3107. [2024-10-13 22:38:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3107 states, 3106 states have (on average 1.2936252414681262) internal successors, (4018), 3106 states have internal predecessors, (4018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 3107 states and 4018 transitions. [2024-10-13 22:38:03,299 INFO L78 Accepts]: Start accepts. Automaton has 3107 states and 4018 transitions. Word has length 52 [2024-10-13 22:38:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:38:03,300 INFO L471 AbstractCegarLoop]: Abstraction has 3107 states and 4018 transitions. [2024-10-13 22:38:03,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:38:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3107 states and 4018 transitions. [2024-10-13 22:38:03,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 22:38:03,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:38:03,302 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:38:03,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 22:38:03,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:03,506 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:38:03,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:38:03,506 INFO L85 PathProgramCache]: Analyzing trace with hash -165249796, now seen corresponding path program 1 times [2024-10-13 22:38:03,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:38:03,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141015281] [2024-10-13 22:38:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:03,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:38:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 22:38:05,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:38:05,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141015281] [2024-10-13 22:38:05,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141015281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:38:05,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729566625] [2024-10-13 22:38:05,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:38:05,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:38:05,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:38:05,841 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:38:05,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 22:38:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:38:06,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-13 22:38:06,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:38:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 22:38:19,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:38:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:38:36,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729566625] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:38:36,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:38:36,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 54 [2024-10-13 22:38:36,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931461357] [2024-10-13 22:38:36,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:38:36,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-13 22:38:36,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:38:36,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-13 22:38:36,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2627, Unknown=2, NotChecked=0, Total=2970 [2024-10-13 22:38:36,382 INFO L87 Difference]: Start difference. First operand 3107 states and 4018 transitions. Second operand has 55 states, 55 states have (on average 2.418181818181818) internal successors, (133), 54 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:13,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:39:17,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 22:39:23,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []