./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/eca-rers2012/Problem03_label28.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 480af262cda4397eeb9e570da47990ce157a2b110ec643ba069b0968d8ba36a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:18:44,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:18:44,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:18:44,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:18:44,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:18:44,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:18:44,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:18:44,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:18:44,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:18:44,995 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:18:44,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:18:44,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:18:44,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:18:44,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:18:44,998 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:18:44,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:18:44,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:18:44,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:18:44,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:18:45,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:18:45,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:18:45,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:18:45,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:18:45,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:18:45,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:18:45,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:18:45,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:18:45,004 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:18:45,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:18:45,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:18:45,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:18:45,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:18:45,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:18:45,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:18:45,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:18:45,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:18:45,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:18:45,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:18:45,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:18:45,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:18:45,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:18:45,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:18:45,009 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 -> 480af262cda4397eeb9e570da47990ce157a2b110ec643ba069b0968d8ba36a6 [2024-10-12 15:18:45,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:18:45,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:18:45,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:18:45,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:18:45,288 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:18:45,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label28.c [2024-10-12 15:18:46,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:18:47,027 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:18:47,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label28.c [2024-10-12 15:18:47,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b7ff29b/0d312cefedd04aa2a16d6b5f537ed6a0/FLAG37f7621ee [2024-10-12 15:18:47,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b7ff29b/0d312cefedd04aa2a16d6b5f537ed6a0 [2024-10-12 15:18:47,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:18:47,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:18:47,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:18:47,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:18:47,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:18:47,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:47,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c122613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47, skipping insertion in model container [2024-10-12 15:18:47,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:47,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:18:47,661 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/eca-rers2012/Problem03_label28.c[54731,54744] [2024-10-12 15:18:47,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:18:47,713 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:18:47,916 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/eca-rers2012/Problem03_label28.c[54731,54744] [2024-10-12 15:18:47,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:18:47,960 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:18:47,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47 WrapperNode [2024-10-12 15:18:47,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:18:47,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:18:47,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:18:47,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:18:47,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:48,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:48,118 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-12 15:18:48,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:18:48,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:18:48,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:18:48,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:18:48,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:48,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:48,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:48,200 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-12 15:18:48,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:48,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:48,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:48,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:48,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:48,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:48,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:18:48,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:18:48,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:18:48,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:18:48,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (1/1) ... [2024-10-12 15:18:48,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:18:48,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:18:48,370 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-12 15:18:48,375 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-12 15:18:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:18:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:18:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:18:48,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:18:48,527 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:18:48,530 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:18:50,300 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-12 15:18:50,300 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:18:50,362 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:18:50,363 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:18:50,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:18:50 BoogieIcfgContainer [2024-10-12 15:18:50,363 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:18:50,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:18:50,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:18:50,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:18:50,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:18:47" (1/3) ... [2024-10-12 15:18:50,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34be2e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:18:50, skipping insertion in model container [2024-10-12 15:18:50,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:18:47" (2/3) ... [2024-10-12 15:18:50,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34be2e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:18:50, skipping insertion in model container [2024-10-12 15:18:50,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:18:50" (3/3) ... [2024-10-12 15:18:50,373 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label28.c [2024-10-12 15:18:50,389 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:18:50,390 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:18:50,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:18:50,472 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;@6c2309e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:18:50,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:18:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 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-12 15:18:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 15:18:50,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:18:50,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:18:50,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:18:50,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:18:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash -54420364, now seen corresponding path program 1 times [2024-10-12 15:18:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:18:50,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152997841] [2024-10-12 15:18:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:18:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:18:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:18:51,104 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-12 15:18:51,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:18:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152997841] [2024-10-12 15:18:51,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152997841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:18:51,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:18:51,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:18:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713047858] [2024-10-12 15:18:51,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:18:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:18:51,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:18:51,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:18:51,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:18:51,146 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 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 75.5) internal successors, (151), 2 states have internal predecessors, (151), 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-12 15:18:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:18:51,193 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-12 15:18:51,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:18:51,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 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 151 [2024-10-12 15:18:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:18:51,213 INFO L225 Difference]: With dead ends: 479 [2024-10-12 15:18:51,213 INFO L226 Difference]: Without dead ends: 238 [2024-10-12 15:18:51,218 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-12 15:18:51,223 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:18:51,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:18:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-12 15:18:51,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-12 15:18:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 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-12 15:18:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-12 15:18:51,286 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 151 [2024-10-12 15:18:51,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:18:51,287 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-12 15:18:51,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 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-12 15:18:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-12 15:18:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 15:18:51,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:18:51,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:18:51,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:18:51,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:18:51,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:18:51,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1231419777, now seen corresponding path program 1 times [2024-10-12 15:18:51,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:18:51,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830935543] [2024-10-12 15:18:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:18:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:18:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:18:51,825 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-12 15:18:51,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:18:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830935543] [2024-10-12 15:18:51,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830935543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:18:51,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:18:51,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:18:51,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384375364] [2024-10-12 15:18:51,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:18:51,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:18:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:18:51,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:18:51,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:18:51,835 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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-12 15:18:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:18:52,750 INFO L93 Difference]: Finished difference Result 686 states and 1135 transitions. [2024-10-12 15:18:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:18:52,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 151 [2024-10-12 15:18:52,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:18:52,754 INFO L225 Difference]: With dead ends: 686 [2024-10-12 15:18:52,755 INFO L226 Difference]: Without dead ends: 449 [2024-10-12 15:18:52,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 15:18:52,757 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 126 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:18:52,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 90 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:18:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-12 15:18:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-10-12 15:18:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.6233183856502242) internal successors, (724), 446 states have internal predecessors, (724), 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-12 15:18:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 724 transitions. [2024-10-12 15:18:52,783 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 724 transitions. Word has length 151 [2024-10-12 15:18:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:18:52,785 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 724 transitions. [2024-10-12 15:18:52,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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-12 15:18:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 724 transitions. [2024-10-12 15:18:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-12 15:18:52,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:18:52,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:18:52,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:18:52,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:18:52,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:18:52,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1774688843, now seen corresponding path program 1 times [2024-10-12 15:18:52,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:18:52,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341993022] [2024-10-12 15:18:52,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:18:52,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:18:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:18:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:18:53,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:18:53,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341993022] [2024-10-12 15:18:53,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341993022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:18:53,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:18:53,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:18:53,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343222425] [2024-10-12 15:18:53,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:18:53,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:18:53,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:18:53,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:18:53,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:18:53,152 INFO L87 Difference]: Start difference. First operand 447 states and 724 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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-12 15:18:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:18:53,886 INFO L93 Difference]: Finished difference Result 1317 states and 2138 transitions. [2024-10-12 15:18:53,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:18:53,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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 156 [2024-10-12 15:18:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:18:53,890 INFO L225 Difference]: With dead ends: 1317 [2024-10-12 15:18:53,890 INFO L226 Difference]: Without dead ends: 871 [2024-10-12 15:18:53,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 15:18:53,893 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 251 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:18:53,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 156 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:18:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-10-12 15:18:53,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 867. [2024-10-12 15:18:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.5277136258660509) internal successors, (1323), 866 states have internal predecessors, (1323), 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-12 15:18:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1323 transitions. [2024-10-12 15:18:53,956 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1323 transitions. Word has length 156 [2024-10-12 15:18:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:18:53,956 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1323 transitions. [2024-10-12 15:18:53,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 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-12 15:18:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1323 transitions. [2024-10-12 15:18:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-12 15:18:53,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:18:53,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:18:53,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:18:53,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:18:53,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:18:53,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1538489826, now seen corresponding path program 1 times [2024-10-12 15:18:53,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:18:53,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889577669] [2024-10-12 15:18:53,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:18:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:18:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:18:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:18:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:18:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889577669] [2024-10-12 15:18:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889577669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:18:54,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:18:54,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:18:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021545131] [2024-10-12 15:18:54,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:18:54,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:18:54,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:18:54,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:18:54,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:18:54,129 INFO L87 Difference]: Start difference. First operand 867 states and 1323 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 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-12 15:18:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:18:54,952 INFO L93 Difference]: Finished difference Result 2565 states and 3930 transitions. [2024-10-12 15:18:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:18:54,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 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) Word has length 159 [2024-10-12 15:18:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:18:54,960 INFO L225 Difference]: With dead ends: 2565 [2024-10-12 15:18:54,961 INFO L226 Difference]: Without dead ends: 1699 [2024-10-12 15:18:54,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 15:18:54,967 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:18:54,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 88 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:18:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-10-12 15:18:55,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1683. [2024-10-12 15:18:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.4982164090368608) internal successors, (2520), 1682 states have internal predecessors, (2520), 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-12 15:18:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2520 transitions. [2024-10-12 15:18:55,041 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2520 transitions. Word has length 159 [2024-10-12 15:18:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:18:55,041 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2520 transitions. [2024-10-12 15:18:55,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 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-12 15:18:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2520 transitions. [2024-10-12 15:18:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 15:18:55,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:18:55,047 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:18:55,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:18:55,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:18:55,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:18:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1579575783, now seen corresponding path program 1 times [2024-10-12 15:18:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:18:55,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548482553] [2024-10-12 15:18:55,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:18:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:18:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:18:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:18:55,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:18:55,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548482553] [2024-10-12 15:18:55,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548482553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:18:55,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:18:55,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:18:55,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379155075] [2024-10-12 15:18:55,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:18:55,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:18:55,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:18:55,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:18:55,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:18:55,414 INFO L87 Difference]: Start difference. First operand 1683 states and 2520 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 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-12 15:18:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:18:56,257 INFO L93 Difference]: Finished difference Result 4187 states and 6246 transitions. [2024-10-12 15:18:56,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:18:56,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 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 161 [2024-10-12 15:18:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:18:56,267 INFO L225 Difference]: With dead ends: 4187 [2024-10-12 15:18:56,267 INFO L226 Difference]: Without dead ends: 2505 [2024-10-12 15:18:56,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 15:18:56,271 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 236 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:18:56,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 111 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:18:56,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-10-12 15:18:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2504. [2024-10-12 15:18:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2503 states have (on average 1.4702357171394327) internal successors, (3680), 2503 states have internal predecessors, (3680), 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-12 15:18:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3680 transitions. [2024-10-12 15:18:56,320 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3680 transitions. Word has length 161 [2024-10-12 15:18:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:18:56,321 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3680 transitions. [2024-10-12 15:18:56,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 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-12 15:18:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3680 transitions. [2024-10-12 15:18:56,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-12 15:18:56,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:18:56,326 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:18:56,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:18:56,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:18:56,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:18:56,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1659656081, now seen corresponding path program 1 times [2024-10-12 15:18:56,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:18:56,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747142663] [2024-10-12 15:18:56,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:18:56,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:18:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:18:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:18:56,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:18:56,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747142663] [2024-10-12 15:18:56,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747142663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:18:56,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:18:56,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:18:56,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107683464] [2024-10-12 15:18:56,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:18:56,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:18:56,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:18:56,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:18:56,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:18:56,573 INFO L87 Difference]: Start difference. First operand 2504 states and 3680 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-12 15:18:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:18:57,385 INFO L93 Difference]: Finished difference Result 5006 states and 7358 transitions. [2024-10-12 15:18:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:18:57,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 166 [2024-10-12 15:18:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:18:57,397 INFO L225 Difference]: With dead ends: 5006 [2024-10-12 15:18:57,398 INFO L226 Difference]: Without dead ends: 2503 [2024-10-12 15:18:57,401 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-12 15:18:57,402 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 126 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:18:57,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 376 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:18:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2024-10-12 15:18:57,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2501. [2024-10-12 15:18:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2500 states have (on average 1.3664) internal successors, (3416), 2500 states have internal predecessors, (3416), 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-12 15:18:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3416 transitions. [2024-10-12 15:18:57,458 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3416 transitions. Word has length 166 [2024-10-12 15:18:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:18:57,460 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3416 transitions. [2024-10-12 15:18:57,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-12 15:18:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3416 transitions. [2024-10-12 15:18:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-12 15:18:57,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:18:57,465 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:18:57,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:18:57,466 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:18:57,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:18:57,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2056229846, now seen corresponding path program 1 times [2024-10-12 15:18:57,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:18:57,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247543551] [2024-10-12 15:18:57,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:18:57,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:18:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:18:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:18:57,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:18:57,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247543551] [2024-10-12 15:18:57,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247543551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:18:57,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:18:57,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:18:57,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163566931] [2024-10-12 15:18:57,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:18:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:18:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:18:57,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:18:57,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:18:57,848 INFO L87 Difference]: Start difference. First operand 2501 states and 3416 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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-12 15:18:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:18:58,698 INFO L93 Difference]: Finished difference Result 7438 states and 10164 transitions. [2024-10-12 15:18:58,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:18:58,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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 168 [2024-10-12 15:18:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:18:58,717 INFO L225 Difference]: With dead ends: 7438 [2024-10-12 15:18:58,717 INFO L226 Difference]: Without dead ends: 4938 [2024-10-12 15:18:58,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 15:18:58,727 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 210 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:18:58,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 185 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:18:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2024-10-12 15:18:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4125. [2024-10-12 15:18:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4125 states, 4124 states have (on average 1.2580019398642095) internal successors, (5188), 4124 states have internal predecessors, (5188), 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-12 15:18:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 5188 transitions. [2024-10-12 15:18:58,817 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 5188 transitions. Word has length 168 [2024-10-12 15:18:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:18:58,817 INFO L471 AbstractCegarLoop]: Abstraction has 4125 states and 5188 transitions. [2024-10-12 15:18:58,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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-12 15:18:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 5188 transitions. [2024-10-12 15:18:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-12 15:18:58,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:18:58,823 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:18:58,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:18:58,824 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:18:58,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:18:58,824 INFO L85 PathProgramCache]: Analyzing trace with hash -48338940, now seen corresponding path program 1 times [2024-10-12 15:18:58,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:18:58,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044690822] [2024-10-12 15:18:58,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:18:58,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:18:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:18:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:18:59,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:18:59,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044690822] [2024-10-12 15:18:59,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044690822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:18:59,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:18:59,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:18:59,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608232967] [2024-10-12 15:18:59,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:18:59,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:18:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:18:59,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:18:59,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:18:59,218 INFO L87 Difference]: Start difference. First operand 4125 states and 5188 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 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-12 15:19:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:00,561 INFO L93 Difference]: Finished difference Result 16224 states and 20442 transitions. [2024-10-12 15:19:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:19:00,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 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 178 [2024-10-12 15:19:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:00,599 INFO L225 Difference]: With dead ends: 16224 [2024-10-12 15:19:00,600 INFO L226 Difference]: Without dead ends: 12100 [2024-10-12 15:19:00,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:19:00,610 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 888 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:00,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 111 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 15:19:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12100 states. [2024-10-12 15:19:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12100 to 12096. [2024-10-12 15:19:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 12095 states have (on average 1.2502687060768913) internal successors, (15122), 12095 states have internal predecessors, (15122), 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-12 15:19:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 15122 transitions. [2024-10-12 15:19:00,879 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 15122 transitions. Word has length 178 [2024-10-12 15:19:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:00,880 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 15122 transitions. [2024-10-12 15:19:00,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 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-12 15:19:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 15122 transitions. [2024-10-12 15:19:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-12 15:19:00,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:00,889 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:00,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:19:00,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:00,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1086643482, now seen corresponding path program 1 times [2024-10-12 15:19:00,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:00,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52621183] [2024-10-12 15:19:00,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:00,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:01,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:01,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52621183] [2024-10-12 15:19:01,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52621183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:01,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:01,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:19:01,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255333715] [2024-10-12 15:19:01,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:01,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:01,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:01,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:01,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:01,265 INFO L87 Difference]: Start difference. First operand 12096 states and 15122 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-12 15:19:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:02,140 INFO L93 Difference]: Finished difference Result 31524 states and 39382 transitions. [2024-10-12 15:19:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:02,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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 200 [2024-10-12 15:19:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:02,204 INFO L225 Difference]: With dead ends: 31524 [2024-10-12 15:19:02,205 INFO L226 Difference]: Without dead ends: 19429 [2024-10-12 15:19:02,224 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-12 15:19:02,225 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 193 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:02,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 379 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:19:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19429 states. [2024-10-12 15:19:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19429 to 18186. [2024-10-12 15:19:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18186 states, 18185 states have (on average 1.2152323343414901) internal successors, (22099), 18185 states have internal predecessors, (22099), 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-12 15:19:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18186 states to 18186 states and 22099 transitions. [2024-10-12 15:19:02,594 INFO L78 Accepts]: Start accepts. Automaton has 18186 states and 22099 transitions. Word has length 200 [2024-10-12 15:19:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:02,594 INFO L471 AbstractCegarLoop]: Abstraction has 18186 states and 22099 transitions. [2024-10-12 15:19:02,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-12 15:19:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 18186 states and 22099 transitions. [2024-10-12 15:19:02,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-12 15:19:02,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:02,603 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:02,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:19:02,603 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:02,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1685650987, now seen corresponding path program 1 times [2024-10-12 15:19:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:02,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943593718] [2024-10-12 15:19:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:19:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:03,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943593718] [2024-10-12 15:19:03,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943593718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:03,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:03,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:19:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405626764] [2024-10-12 15:19:03,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:03,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:19:03,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:03,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:19:03,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:19:03,043 INFO L87 Difference]: Start difference. First operand 18186 states and 22099 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 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-12 15:19:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:04,295 INFO L93 Difference]: Finished difference Result 38844 states and 47350 transitions. [2024-10-12 15:19:04,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:19:04,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 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 216 [2024-10-12 15:19:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:04,341 INFO L225 Difference]: With dead ends: 38844 [2024-10-12 15:19:04,341 INFO L226 Difference]: Without dead ends: 20659 [2024-10-12 15:19:04,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:19:04,366 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 391 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:04,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 172 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 15:19:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20659 states. [2024-10-12 15:19:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20659 to 17780. [2024-10-12 15:19:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17780 states, 17779 states have (on average 1.2131728443669498) internal successors, (21569), 17779 states have internal predecessors, (21569), 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-12 15:19:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17780 states to 17780 states and 21569 transitions. [2024-10-12 15:19:04,736 INFO L78 Accepts]: Start accepts. Automaton has 17780 states and 21569 transitions. Word has length 216 [2024-10-12 15:19:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:04,737 INFO L471 AbstractCegarLoop]: Abstraction has 17780 states and 21569 transitions. [2024-10-12 15:19:04,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 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-12 15:19:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 17780 states and 21569 transitions. [2024-10-12 15:19:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-12 15:19:04,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:04,747 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:19:04,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:19:04,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:04,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash 772073722, now seen corresponding path program 1 times [2024-10-12 15:19:04,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:04,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427205554] [2024-10-12 15:19:04,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 15:19:05,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:05,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427205554] [2024-10-12 15:19:05,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427205554] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:05,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048118497] [2024-10-12 15:19:05,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:05,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:05,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:05,245 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-12 15:19:05,246 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-12 15:19:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:05,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:19:05,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:19:05,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:19:05,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048118497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:05,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:19:05,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:19:05,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477633580] [2024-10-12 15:19:05,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:05,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:05,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:05,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:05,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:05,491 INFO L87 Difference]: Start difference. First operand 17780 states and 21569 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-12 15:19:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:06,220 INFO L93 Difference]: Finished difference Result 47360 states and 57199 transitions. [2024-10-12 15:19:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:06,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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 223 [2024-10-12 15:19:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:06,268 INFO L225 Difference]: With dead ends: 47360 [2024-10-12 15:19:06,269 INFO L226 Difference]: Without dead ends: 29581 [2024-10-12 15:19:06,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:06,299 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 207 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:06,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 409 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:19:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29581 states. [2024-10-12 15:19:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29581 to 28551. [2024-10-12 15:19:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28551 states, 28550 states have (on average 1.1866900175131347) internal successors, (33880), 28550 states have internal predecessors, (33880), 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-12 15:19:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28551 states to 28551 states and 33880 transitions. [2024-10-12 15:19:06,762 INFO L78 Accepts]: Start accepts. Automaton has 28551 states and 33880 transitions. Word has length 223 [2024-10-12 15:19:06,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:06,763 INFO L471 AbstractCegarLoop]: Abstraction has 28551 states and 33880 transitions. [2024-10-12 15:19:06,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-12 15:19:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 28551 states and 33880 transitions. [2024-10-12 15:19:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-12 15:19:06,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:06,776 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:06,805 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-12 15:19:06,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 15:19:06,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:06,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1333364578, now seen corresponding path program 1 times [2024-10-12 15:19:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798202737] [2024-10-12 15:19:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-12 15:19:07,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:07,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798202737] [2024-10-12 15:19:07,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798202737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:07,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:07,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404142804] [2024-10-12 15:19:07,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:07,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:07,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:07,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:07,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:07,498 INFO L87 Difference]: Start difference. First operand 28551 states and 33880 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 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-12 15:19:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:08,498 INFO L93 Difference]: Finished difference Result 62600 states and 74127 transitions. [2024-10-12 15:19:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:08,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 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 235 [2024-10-12 15:19:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:08,546 INFO L225 Difference]: With dead ends: 62600 [2024-10-12 15:19:08,546 INFO L226 Difference]: Without dead ends: 34050 [2024-10-12 15:19:08,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 15:19:08,576 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 200 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:08,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 186 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:19:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34050 states. [2024-10-12 15:19:09,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34050 to 33831. [2024-10-12 15:19:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33831 states, 33830 states have (on average 1.1814957138634348) internal successors, (39970), 33830 states have internal predecessors, (39970), 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-12 15:19:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33831 states to 33831 states and 39970 transitions. [2024-10-12 15:19:09,127 INFO L78 Accepts]: Start accepts. Automaton has 33831 states and 39970 transitions. Word has length 235 [2024-10-12 15:19:09,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:09,129 INFO L471 AbstractCegarLoop]: Abstraction has 33831 states and 39970 transitions. [2024-10-12 15:19:09,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 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-12 15:19:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 33831 states and 39970 transitions. [2024-10-12 15:19:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-12 15:19:09,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:09,149 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:09,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 15:19:09,149 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:09,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:09,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2092274527, now seen corresponding path program 1 times [2024-10-12 15:19:09,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:09,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855373417] [2024-10-12 15:19:09,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:09,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-12 15:19:09,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:09,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855373417] [2024-10-12 15:19:09,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855373417] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:09,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462904323] [2024-10-12 15:19:09,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:09,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:09,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:09,636 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-12 15:19:09,638 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-12 15:19:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:09,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:19:09,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 15:19:10,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:19:10,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462904323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:10,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:19:10,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:19:10,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669853780] [2024-10-12 15:19:10,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:10,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:10,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:10,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:10,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:10,044 INFO L87 Difference]: Start difference. First operand 33831 states and 39970 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-12 15:19:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:10,825 INFO L93 Difference]: Finished difference Result 85534 states and 101220 transitions. [2024-10-12 15:19:10,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:10,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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 243 [2024-10-12 15:19:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:10,887 INFO L225 Difference]: With dead ends: 85534 [2024-10-12 15:19:10,887 INFO L226 Difference]: Without dead ends: 51704 [2024-10-12 15:19:10,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:19:10,920 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 113 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:10,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 384 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:19:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51704 states. [2024-10-12 15:19:11,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51704 to 48250. [2024-10-12 15:19:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48250 states, 48249 states have (on average 1.1589255735870174) internal successors, (55917), 48249 states have internal predecessors, (55917), 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-12 15:19:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48250 states to 48250 states and 55917 transitions. [2024-10-12 15:19:11,582 INFO L78 Accepts]: Start accepts. Automaton has 48250 states and 55917 transitions. Word has length 243 [2024-10-12 15:19:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:11,583 INFO L471 AbstractCegarLoop]: Abstraction has 48250 states and 55917 transitions. [2024-10-12 15:19:11,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-12 15:19:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 48250 states and 55917 transitions. [2024-10-12 15:19:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-12 15:19:11,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:11,604 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:11,624 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-12 15:19:11,805 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,SelfDestructingSolverStorable12 [2024-10-12 15:19:11,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:11,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash -238922347, now seen corresponding path program 1 times [2024-10-12 15:19:11,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:11,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263118524] [2024-10-12 15:19:11,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:11,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-12 15:19:12,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:12,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263118524] [2024-10-12 15:19:12,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263118524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:12,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:12,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:12,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726615225] [2024-10-12 15:19:12,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:12,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:12,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:12,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:12,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:12,206 INFO L87 Difference]: Start difference. First operand 48250 states and 55917 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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-12 15:19:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:13,365 INFO L93 Difference]: Finished difference Result 98938 states and 114447 transitions. [2024-10-12 15:19:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:13,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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 269 [2024-10-12 15:19:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:13,428 INFO L225 Difference]: With dead ends: 98938 [2024-10-12 15:19:13,428 INFO L226 Difference]: Without dead ends: 50689 [2024-10-12 15:19:13,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 15:19:13,454 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 182 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:13,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 192 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:19:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50689 states. [2024-10-12 15:19:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50689 to 50686. [2024-10-12 15:19:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50686 states, 50685 states have (on average 1.1545624938344679) internal successors, (58519), 50685 states have internal predecessors, (58519), 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-12 15:19:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50686 states to 50686 states and 58519 transitions. [2024-10-12 15:19:14,154 INFO L78 Accepts]: Start accepts. Automaton has 50686 states and 58519 transitions. Word has length 269 [2024-10-12 15:19:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:14,154 INFO L471 AbstractCegarLoop]: Abstraction has 50686 states and 58519 transitions. [2024-10-12 15:19:14,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 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-12 15:19:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 50686 states and 58519 transitions. [2024-10-12 15:19:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-10-12 15:19:14,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:14,298 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:14,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 15:19:14,298 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:14,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1204215511, now seen corresponding path program 1 times [2024-10-12 15:19:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:14,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789589082] [2024-10-12 15:19:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:14,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-12 15:19:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:15,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789589082] [2024-10-12 15:19:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789589082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:15,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:15,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226104907] [2024-10-12 15:19:15,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:15,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:15,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:15,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:15,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:15,052 INFO L87 Difference]: Start difference. First operand 50686 states and 58519 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 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-12 15:19:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:15,810 INFO L93 Difference]: Finished difference Result 101575 states and 117236 transitions. [2024-10-12 15:19:15,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:15,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 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 279 [2024-10-12 15:19:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:15,874 INFO L225 Difference]: With dead ends: 101575 [2024-10-12 15:19:15,874 INFO L226 Difference]: Without dead ends: 51296 [2024-10-12 15:19:15,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 15:19:15,904 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 133 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:15,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 194 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:19:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51296 states. [2024-10-12 15:19:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51296 to 50889. [2024-10-12 15:19:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50889 states, 50888 states have (on average 1.1544371954095267) internal successors, (58747), 50888 states have internal predecessors, (58747), 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-12 15:19:16,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50889 states to 50889 states and 58747 transitions. [2024-10-12 15:19:16,619 INFO L78 Accepts]: Start accepts. Automaton has 50889 states and 58747 transitions. Word has length 279 [2024-10-12 15:19:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:16,619 INFO L471 AbstractCegarLoop]: Abstraction has 50889 states and 58747 transitions. [2024-10-12 15:19:16,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 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-12 15:19:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 50889 states and 58747 transitions. [2024-10-12 15:19:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-10-12 15:19:16,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:16,640 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:16,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 15:19:16,641 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:16,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:16,641 INFO L85 PathProgramCache]: Analyzing trace with hash -128653448, now seen corresponding path program 1 times [2024-10-12 15:19:16,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:16,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719994783] [2024-10-12 15:19:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:16,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-12 15:19:17,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:17,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719994783] [2024-10-12 15:19:17,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719994783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:17,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:17,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:17,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398420803] [2024-10-12 15:19:17,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:17,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:17,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:17,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:17,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:17,148 INFO L87 Difference]: Start difference. First operand 50889 states and 58747 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 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-12 15:19:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:18,129 INFO L93 Difference]: Finished difference Result 115428 states and 134017 transitions. [2024-10-12 15:19:18,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:18,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 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 292 [2024-10-12 15:19:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:18,207 INFO L225 Difference]: With dead ends: 115428 [2024-10-12 15:19:18,207 INFO L226 Difference]: Without dead ends: 67179 [2024-10-12 15:19:18,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 15:19:18,227 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 168 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:18,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 187 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:19:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67179 states. [2024-10-12 15:19:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67179 to 61658. [2024-10-12 15:19:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61658 states, 61657 states have (on average 1.1662260570575929) internal successors, (71906), 61657 states have internal predecessors, (71906), 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-12 15:19:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61658 states to 61658 states and 71906 transitions. [2024-10-12 15:19:18,920 INFO L78 Accepts]: Start accepts. Automaton has 61658 states and 71906 transitions. Word has length 292 [2024-10-12 15:19:18,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:18,921 INFO L471 AbstractCegarLoop]: Abstraction has 61658 states and 71906 transitions. [2024-10-12 15:19:18,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 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-12 15:19:18,921 INFO L276 IsEmpty]: Start isEmpty. Operand 61658 states and 71906 transitions. [2024-10-12 15:19:19,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-10-12 15:19:19,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:19,145 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:19,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 15:19:19,145 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:19,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash 88959897, now seen corresponding path program 1 times [2024-10-12 15:19:19,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:19,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965083813] [2024-10-12 15:19:19,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:19,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 147 proven. 6 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-10-12 15:19:19,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:19,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965083813] [2024-10-12 15:19:19,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965083813] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:19,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578518553] [2024-10-12 15:19:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:19,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:19,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:19,628 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-12 15:19:19,631 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-12 15:19:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:19,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 15:19:19,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-10-12 15:19:20,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:19:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-10-12 15:19:20,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578518553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:19:20,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:19:20,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-12 15:19:20,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863296655] [2024-10-12 15:19:20,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:19:20,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:19:20,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:20,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:19:20,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:19:20,548 INFO L87 Difference]: Start difference. First operand 61658 states and 71906 transitions. Second operand has 6 states, 6 states have (on average 66.83333333333333) internal successors, (401), 5 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-12 15:19:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:24,462 INFO L93 Difference]: Finished difference Result 234003 states and 273856 transitions. [2024-10-12 15:19:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 15:19:24,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 66.83333333333333) internal successors, (401), 5 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) Word has length 307 [2024-10-12 15:19:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:24,672 INFO L225 Difference]: With dead ends: 234003 [2024-10-12 15:19:24,672 INFO L226 Difference]: Without dead ends: 172549 [2024-10-12 15:19:24,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-12 15:19:24,730 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 2356 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 4584 mSolverCounterSat, 766 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2356 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 5350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 766 IncrementalHoareTripleChecker+Valid, 4584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:24,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2356 Valid, 450 Invalid, 5350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [766 Valid, 4584 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 15:19:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172549 states. [2024-10-12 15:19:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172549 to 150367. [2024-10-12 15:19:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150367 states, 150366 states have (on average 1.1495484351515635) internal successors, (172853), 150366 states have internal predecessors, (172853), 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-12 15:19:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150367 states to 150367 states and 172853 transitions. [2024-10-12 15:19:27,531 INFO L78 Accepts]: Start accepts. Automaton has 150367 states and 172853 transitions. Word has length 307 [2024-10-12 15:19:27,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:27,533 INFO L471 AbstractCegarLoop]: Abstraction has 150367 states and 172853 transitions. [2024-10-12 15:19:27,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.83333333333333) internal successors, (401), 5 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-12 15:19:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 150367 states and 172853 transitions. [2024-10-12 15:19:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-10-12 15:19:27,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:27,586 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:27,625 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-12 15:19:27,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:27,787 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:27,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:27,787 INFO L85 PathProgramCache]: Analyzing trace with hash 833498338, now seen corresponding path program 1 times [2024-10-12 15:19:27,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:27,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505580169] [2024-10-12 15:19:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:27,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-12 15:19:28,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:28,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505580169] [2024-10-12 15:19:28,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505580169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:28,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:28,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:19:28,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346817301] [2024-10-12 15:19:28,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:28,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:19:28,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:28,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:19:28,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:19:28,132 INFO L87 Difference]: Start difference. First operand 150367 states and 172853 transitions. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 3 states have internal predecessors, (255), 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-12 15:19:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:30,028 INFO L93 Difference]: Finished difference Result 310570 states and 356765 transitions. [2024-10-12 15:19:30,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:19:30,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 3 states have internal predecessors, (255), 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 313 [2024-10-12 15:19:30,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:30,220 INFO L225 Difference]: With dead ends: 310570 [2024-10-12 15:19:30,220 INFO L226 Difference]: Without dead ends: 156144 [2024-10-12 15:19:30,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:19:30,307 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 357 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:30,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 146 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 15:19:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156144 states. [2024-10-12 15:19:32,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156144 to 148158. [2024-10-12 15:19:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148158 states, 148157 states have (on average 1.107689815533522) internal successors, (164112), 148157 states have internal predecessors, (164112), 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-12 15:19:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148158 states to 148158 states and 164112 transitions. [2024-10-12 15:19:32,866 INFO L78 Accepts]: Start accepts. Automaton has 148158 states and 164112 transitions. Word has length 313 [2024-10-12 15:19:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:32,867 INFO L471 AbstractCegarLoop]: Abstraction has 148158 states and 164112 transitions. [2024-10-12 15:19:32,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 3 states have internal predecessors, (255), 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-12 15:19:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 148158 states and 164112 transitions. [2024-10-12 15:19:32,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2024-10-12 15:19:32,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:32,903 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:32,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 15:19:32,904 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:32,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:32,904 INFO L85 PathProgramCache]: Analyzing trace with hash -55258775, now seen corresponding path program 1 times [2024-10-12 15:19:32,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:32,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064198697] [2024-10-12 15:19:32,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:32,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 233 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-12 15:19:34,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:34,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064198697] [2024-10-12 15:19:34,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064198697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:34,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296682094] [2024-10-12 15:19:34,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:34,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:34,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:34,090 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-12 15:19:34,091 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-12 15:19:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:34,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:19:34,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-12 15:19:34,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:19:34,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296682094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:34,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:19:34,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:19:34,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615363186] [2024-10-12 15:19:34,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:34,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:34,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:34,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:34,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:19:34,356 INFO L87 Difference]: Start difference. First operand 148158 states and 164112 transitions. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-12 15:19:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:35,769 INFO L93 Difference]: Finished difference Result 296761 states and 328703 transitions. [2024-10-12 15:19:35,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:35,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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 364 [2024-10-12 15:19:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:35,955 INFO L225 Difference]: With dead ends: 296761 [2024-10-12 15:19:35,955 INFO L226 Difference]: Without dead ends: 149822 [2024-10-12 15:19:36,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:19:36,040 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 215 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:36,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 124 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:19:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149822 states. [2024-10-12 15:19:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149822 to 132511. [2024-10-12 15:19:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132511 states, 132510 states have (on average 1.093064674364199) internal successors, (144842), 132510 states have internal predecessors, (144842), 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-12 15:19:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132511 states to 132511 states and 144842 transitions. [2024-10-12 15:19:38,438 INFO L78 Accepts]: Start accepts. Automaton has 132511 states and 144842 transitions. Word has length 364 [2024-10-12 15:19:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:38,439 INFO L471 AbstractCegarLoop]: Abstraction has 132511 states and 144842 transitions. [2024-10-12 15:19:38,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-12 15:19:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 132511 states and 144842 transitions. [2024-10-12 15:19:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-10-12 15:19:38,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:38,489 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:38,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 15:19:38,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:38,690 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:38,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash 815142635, now seen corresponding path program 1 times [2024-10-12 15:19:38,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:38,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262912001] [2024-10-12 15:19:38,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:38,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 442 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-12 15:19:39,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:39,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262912001] [2024-10-12 15:19:39,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262912001] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:19:39,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467372244] [2024-10-12 15:19:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:39,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:39,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:19:39,784 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-12 15:19:39,787 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-12 15:19:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:40,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:19:40,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:19:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-10-12 15:19:40,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:19:40,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467372244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:40,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:19:40,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-12 15:19:40,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418711219] [2024-10-12 15:19:40,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:40,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:40,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:40,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:40,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:19:40,226 INFO L87 Difference]: Start difference. First operand 132511 states and 144842 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 2 states have internal predecessors, (281), 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-12 15:19:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:41,542 INFO L93 Difference]: Finished difference Result 374959 states and 410337 transitions. [2024-10-12 15:19:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:41,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 2 states have internal predecessors, (281), 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 413 [2024-10-12 15:19:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:41,891 INFO L225 Difference]: With dead ends: 374959 [2024-10-12 15:19:41,891 INFO L226 Difference]: Without dead ends: 245088 [2024-10-12 15:19:41,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:19:41,990 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 205 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:41,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 548 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:19:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245088 states. [2024-10-12 15:19:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245088 to 245076. [2024-10-12 15:19:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245076 states, 245075 states have (on average 1.0938610629399164) internal successors, (268078), 245075 states have internal predecessors, (268078), 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-12 15:19:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245076 states to 245076 states and 268078 transitions. [2024-10-12 15:19:46,117 INFO L78 Accepts]: Start accepts. Automaton has 245076 states and 268078 transitions. Word has length 413 [2024-10-12 15:19:46,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:19:46,117 INFO L471 AbstractCegarLoop]: Abstraction has 245076 states and 268078 transitions. [2024-10-12 15:19:46,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 2 states have internal predecessors, (281), 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-12 15:19:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 245076 states and 268078 transitions. [2024-10-12 15:19:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2024-10-12 15:19:46,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:19:46,143 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:19:46,157 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-12 15:19:46,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:19:46,344 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:19:46,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:19:46,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1068720046, now seen corresponding path program 1 times [2024-10-12 15:19:46,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:19:46,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100798339] [2024-10-12 15:19:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:19:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:19:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:19:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-12 15:19:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:19:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100798339] [2024-10-12 15:19:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100798339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:19:47,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:19:47,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:19:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038657587] [2024-10-12 15:19:47,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:19:47,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:19:47,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:19:47,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:19:47,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:19:47,621 INFO L87 Difference]: Start difference. First operand 245076 states and 268078 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 2 states have internal predecessors, (284), 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-12 15:19:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:19:49,592 INFO L93 Difference]: Finished difference Result 498305 states and 545521 transitions. [2024-10-12 15:19:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:19:49,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 2 states have internal predecessors, (284), 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 443 [2024-10-12 15:19:49,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:19:49,959 INFO L225 Difference]: With dead ends: 498305 [2024-10-12 15:19:49,959 INFO L226 Difference]: Without dead ends: 254651 [2024-10-12 15:19:50,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12 15:19:50,101 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 93 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:19:50,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 167 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:19:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254651 states.