./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/Problem10_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label59.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c3365f1635b74f6a53afd889ed9f5ab40e7b8a98b6d57619b7925d1a2f204728 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:17:15,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:17:15,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:17:15,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:17:15,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:17:15,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:17:15,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:17:15,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:17:15,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:17:15,188 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:17:15,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:17:15,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:17:15,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:17:15,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:17:15,190 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:17:15,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:17:15,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:17:15,193 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:17:15,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:17:15,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:17:15,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:17:15,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:17:15,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:17:15,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:17:15,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:17:15,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:17:15,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:17:15,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:17:15,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:17:15,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:17:15,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:17:15,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:17:15,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:17:15,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:17:15,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:17:15,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:17:15,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:17:15,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:17:15,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:17:15,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:17:15,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:17:15,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:17:15,199 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-clean/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-clean/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 -> c3365f1635b74f6a53afd889ed9f5ab40e7b8a98b6d57619b7925d1a2f204728 [2024-10-10 23:17:15,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:17:15,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:17:15,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:17:15,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:17:15,455 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:17:15,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label59.c [2024-10-10 23:17:16,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:17:17,028 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:17:17,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label59.c [2024-10-10 23:17:17,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2addbe2a6/324cbe46ad134737944613ebefc5b04d/FLAG99ef1c3e1 [2024-10-10 23:17:17,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2addbe2a6/324cbe46ad134737944613ebefc5b04d [2024-10-10 23:17:17,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:17:17,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:17:17,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:17:17,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:17:17,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:17:17,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:17,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2252614b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17, skipping insertion in model container [2024-10-10 23:17:17,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:17,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:17:17,620 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/Problem10_label59.c[7385,7398] [2024-10-10 23:17:17,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:17:17,769 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:17:17,813 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/Problem10_label59.c[7385,7398] [2024-10-10 23:17:17,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:17:17,935 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:17:17,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17 WrapperNode [2024-10-10 23:17:17,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:17:17,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:17:17,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:17:17,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:17:17,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:17,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:18,008 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-10 23:17:18,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:17:18,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:17:18,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:17:18,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:17:18,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:18,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:18,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:18,057 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-10 23:17:18,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:18,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:18,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:18,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:18,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:18,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:18,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:17:18,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:17:18,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:17:18,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:17:18,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (1/1) ... [2024-10-10 23:17:18,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:17:18,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:18,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:17:18,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:17:18,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:17:18,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:17:18,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:17:18,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:17:18,252 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:17:18,254 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:17:19,159 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 23:17:19,160 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:17:19,192 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:17:19,193 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:17:19,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:17:19 BoogieIcfgContainer [2024-10-10 23:17:19,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:17:19,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:17:19,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:17:19,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:17:19,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:17:17" (1/3) ... [2024-10-10 23:17:19,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3284be60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:17:19, skipping insertion in model container [2024-10-10 23:17:19,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:17" (2/3) ... [2024-10-10 23:17:19,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3284be60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:17:19, skipping insertion in model container [2024-10-10 23:17:19,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:17:19" (3/3) ... [2024-10-10 23:17:19,200 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label59.c [2024-10-10 23:17:19,213 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:17:19,213 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:17:19,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:17:19,275 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;@22e9c7be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:17:19,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:17:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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-10 23:17:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-10 23:17:19,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:19,289 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] [2024-10-10 23:17:19,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:19,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:19,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1143630123, now seen corresponding path program 1 times [2024-10-10 23:17:19,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:19,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263249210] [2024-10-10 23:17:19,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:19,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:19,488 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-10 23:17:19,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:19,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263249210] [2024-10-10 23:17:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263249210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:19,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:19,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:19,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899285332] [2024-10-10 23:17:19,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:19,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:17:19,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:19,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:17:19,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:17:19,516 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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-10 23:17:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:19,549 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-10 23:17:19,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:17:19,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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 64 [2024-10-10 23:17:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:19,560 INFO L225 Difference]: With dead ends: 287 [2024-10-10 23:17:19,560 INFO L226 Difference]: Without dead ends: 142 [2024-10-10 23:17:19,563 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-10 23:17:19,568 INFO L432 NwaCegarLoop]: 217 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, 217 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-10 23:17:19,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:17:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-10 23:17:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-10 23:17:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-10 23:17:19,610 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 64 [2024-10-10 23:17:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:19,611 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-10 23:17:19,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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-10 23:17:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-10 23:17:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-10 23:17:19,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:19,613 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] [2024-10-10 23:17:19,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:17:19,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:19,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1483752594, now seen corresponding path program 1 times [2024-10-10 23:17:19,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:19,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494886015] [2024-10-10 23:17:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:19,856 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-10 23:17:19,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:19,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494886015] [2024-10-10 23:17:19,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494886015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:19,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:19,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:19,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357863367] [2024-10-10 23:17:19,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:19,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:19,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:19,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:19,863 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 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-10 23:17:20,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:20,672 INFO L93 Difference]: Finished difference Result 283 states and 433 transitions. [2024-10-10 23:17:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:20,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 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 64 [2024-10-10 23:17:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:20,674 INFO L225 Difference]: With dead ends: 283 [2024-10-10 23:17:20,674 INFO L226 Difference]: Without dead ends: 281 [2024-10-10 23:17:20,675 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-10 23:17:20,676 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 87 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:20,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 9 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:17:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-10 23:17:20,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-10 23:17:20,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.5392857142857144) internal successors, (431), 280 states have internal predecessors, (431), 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-10 23:17:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2024-10-10 23:17:20,700 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 64 [2024-10-10 23:17:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:20,700 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2024-10-10 23:17:20,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 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-10 23:17:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2024-10-10 23:17:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-10 23:17:20,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:20,706 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:17:20,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:17:20,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:20,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash -572430815, now seen corresponding path program 1 times [2024-10-10 23:17:20,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:20,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390294040] [2024-10-10 23:17:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:20,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:20,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390294040] [2024-10-10 23:17:20,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390294040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:20,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:20,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892529685] [2024-10-10 23:17:20,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:20,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:20,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:20,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:20,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:20,984 INFO L87 Difference]: Start difference. First operand 281 states and 431 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-10 23:17:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:21,440 INFO L93 Difference]: Finished difference Result 839 states and 1290 transitions. [2024-10-10 23:17:21,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:21,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 130 [2024-10-10 23:17:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:21,443 INFO L225 Difference]: With dead ends: 839 [2024-10-10 23:17:21,443 INFO L226 Difference]: Without dead ends: 559 [2024-10-10 23:17:21,444 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-10 23:17:21,445 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 77 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:21,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 223 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-10 23:17:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-10 23:17:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3064516129032258) internal successors, (729), 558 states have internal predecessors, (729), 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-10 23:17:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 729 transitions. [2024-10-10 23:17:21,463 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 729 transitions. Word has length 130 [2024-10-10 23:17:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:21,464 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 729 transitions. [2024-10-10 23:17:21,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-10 23:17:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 729 transitions. [2024-10-10 23:17:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-10 23:17:21,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:21,466 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:17:21,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:17:21,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:21,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash -292020410, now seen corresponding path program 1 times [2024-10-10 23:17:21,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:21,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939264279] [2024-10-10 23:17:21,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:21,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:21,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939264279] [2024-10-10 23:17:21,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939264279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:21,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:21,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:21,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666985728] [2024-10-10 23:17:21,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:21,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:21,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:21,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:21,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:21,620 INFO L87 Difference]: Start difference. First operand 559 states and 729 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:22,033 INFO L93 Difference]: Finished difference Result 1256 states and 1671 transitions. [2024-10-10 23:17:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:22,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2024-10-10 23:17:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:22,036 INFO L225 Difference]: With dead ends: 1256 [2024-10-10 23:17:22,036 INFO L226 Difference]: Without dead ends: 698 [2024-10-10 23:17:22,038 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-10 23:17:22,038 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:22,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 50 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:22,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-10 23:17:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-10-10 23:17:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2955523672883789) internal successors, (903), 697 states have internal predecessors, (903), 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-10 23:17:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 903 transitions. [2024-10-10 23:17:22,056 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 903 transitions. Word has length 137 [2024-10-10 23:17:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:22,056 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 903 transitions. [2024-10-10 23:17:22,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 903 transitions. [2024-10-10 23:17:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-10 23:17:22,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:22,058 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:17:22,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:17:22,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:22,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash 239691536, now seen corresponding path program 1 times [2024-10-10 23:17:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:22,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805419991] [2024-10-10 23:17:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:22,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:22,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805419991] [2024-10-10 23:17:22,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805419991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:22,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:22,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:22,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526190248] [2024-10-10 23:17:22,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:22,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:22,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:22,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:22,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:22,229 INFO L87 Difference]: Start difference. First operand 698 states and 903 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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-10 23:17:22,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:22,647 INFO L93 Difference]: Finished difference Result 1673 states and 2234 transitions. [2024-10-10 23:17:22,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:22,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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 141 [2024-10-10 23:17:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:22,655 INFO L225 Difference]: With dead ends: 1673 [2024-10-10 23:17:22,655 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:17:22,656 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-10 23:17:22,657 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 70 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:22,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 73 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:17:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-10 23:17:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.2276923076923076) internal successors, (1197), 975 states have internal predecessors, (1197), 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-10 23:17:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1197 transitions. [2024-10-10 23:17:22,693 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1197 transitions. Word has length 141 [2024-10-10 23:17:22,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:22,694 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1197 transitions. [2024-10-10 23:17:22,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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-10 23:17:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1197 transitions. [2024-10-10 23:17:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-10 23:17:22,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:22,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:17:22,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:17:22,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:22,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:22,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1100118903, now seen corresponding path program 1 times [2024-10-10 23:17:22,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:22,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949661490] [2024-10-10 23:17:22,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:22,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:22,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:22,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949661490] [2024-10-10 23:17:22,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949661490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:22,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:22,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:22,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304566340] [2024-10-10 23:17:22,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:22,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:17:22,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:22,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:17:22,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:17:22,982 INFO L87 Difference]: Start difference. First operand 976 states and 1197 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 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-10 23:17:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:23,775 INFO L93 Difference]: Finished difference Result 1812 states and 2244 transitions. [2024-10-10 23:17:23,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:17:23,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 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-10 23:17:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:23,778 INFO L225 Difference]: With dead ends: 1812 [2024-10-10 23:17:23,780 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:17:23,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:17:23,782 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:23,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 83 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:17:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:17:23,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-10 23:17:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.2225641025641025) internal successors, (1192), 975 states have internal predecessors, (1192), 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-10 23:17:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1192 transitions. [2024-10-10 23:17:23,803 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1192 transitions. Word has length 151 [2024-10-10 23:17:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:23,804 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1192 transitions. [2024-10-10 23:17:23,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 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-10 23:17:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1192 transitions. [2024-10-10 23:17:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-10 23:17:23,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:23,807 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, 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] [2024-10-10 23:17:23,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:17:23,808 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:23,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1834551236, now seen corresponding path program 1 times [2024-10-10 23:17:23,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:23,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180004080] [2024-10-10 23:17:23,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:23,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:24,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:24,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180004080] [2024-10-10 23:17:24,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180004080] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:17:24,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866555035] [2024-10-10 23:17:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:24,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:24,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:24,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:17:24,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:17:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:24,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:17:24,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:17:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 127 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:24,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:17:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 127 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:25,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866555035] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:17:25,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:17:25,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-10 23:17:25,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641621650] [2024-10-10 23:17:25,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:17:25,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 23:17:25,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:25,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 23:17:25,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:17:25,015 INFO L87 Difference]: Start difference. First operand 976 states and 1192 transitions. Second operand has 9 states, 9 states have (on average 63.22222222222222) internal successors, (569), 9 states have internal predecessors, (569), 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-10 23:17:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:27,805 INFO L93 Difference]: Finished difference Result 4036 states and 5310 transitions. [2024-10-10 23:17:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-10 23:17:27,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 63.22222222222222) internal successors, (569), 9 states have internal predecessors, (569), 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 212 [2024-10-10 23:17:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:27,815 INFO L225 Difference]: With dead ends: 4036 [2024-10-10 23:17:27,815 INFO L226 Difference]: Without dead ends: 3200 [2024-10-10 23:17:27,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-10 23:17:27,817 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 1322 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 1017 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1017 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:27,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 45 Invalid, 3305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1017 Valid, 2288 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:17:27,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2024-10-10 23:17:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2088. [2024-10-10 23:17:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2087 states have (on average 1.2678485864877815) internal successors, (2646), 2087 states have internal predecessors, (2646), 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-10 23:17:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2646 transitions. [2024-10-10 23:17:27,848 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2646 transitions. Word has length 212 [2024-10-10 23:17:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:27,848 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2646 transitions. [2024-10-10 23:17:27,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 63.22222222222222) internal successors, (569), 9 states have internal predecessors, (569), 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-10 23:17:27,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2646 transitions. [2024-10-10 23:17:27,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-10 23:17:27,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:27,851 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:27,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:17:28,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:28,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:28,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:28,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1047900045, now seen corresponding path program 1 times [2024-10-10 23:17:28,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:28,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497075141] [2024-10-10 23:17:28,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:28,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 23:17:28,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497075141] [2024-10-10 23:17:28,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497075141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:28,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:28,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:17:28,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697172194] [2024-10-10 23:17:28,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:28,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:17:28,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:28,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:17:28,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:17:28,354 INFO L87 Difference]: Start difference. First operand 2088 states and 2646 transitions. Second operand has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 6 states have internal predecessors, (209), 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-10 23:17:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:28,764 INFO L93 Difference]: Finished difference Result 4091 states and 5202 transitions. [2024-10-10 23:17:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:17:28,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 6 states have internal predecessors, (209), 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-10 23:17:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:28,770 INFO L225 Difference]: With dead ends: 4091 [2024-10-10 23:17:28,770 INFO L226 Difference]: Without dead ends: 2088 [2024-10-10 23:17:28,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:17:28,772 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:28,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 21 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2024-10-10 23:17:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2088. [2024-10-10 23:17:28,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2087 states have (on average 1.2635361763296598) internal successors, (2637), 2087 states have internal predecessors, (2637), 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-10 23:17:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2637 transitions. [2024-10-10 23:17:28,800 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2637 transitions. Word has length 216 [2024-10-10 23:17:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:28,801 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2637 transitions. [2024-10-10 23:17:28,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 6 states have internal predecessors, (209), 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-10 23:17:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2637 transitions. [2024-10-10 23:17:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-10 23:17:28,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:28,804 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, 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] [2024-10-10 23:17:28,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:17:28,804 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:28,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash -48377976, now seen corresponding path program 1 times [2024-10-10 23:17:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:28,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465650409] [2024-10-10 23:17:28,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 63 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:29,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:29,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465650409] [2024-10-10 23:17:29,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465650409] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:17:29,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625537748] [2024-10-10 23:17:29,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:29,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:29,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:29,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:17:29,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:17:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:29,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:17:29,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:17:29,371 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:17:29,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:17:29,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625537748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:29,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:17:29,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:17:29,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802322667] [2024-10-10 23:17:29,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:29,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:29,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:29,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:29,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:17:29,374 INFO L87 Difference]: Start difference. First operand 2088 states and 2637 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-10 23:17:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:29,745 INFO L93 Difference]: Finished difference Result 4036 states and 5130 transitions. [2024-10-10 23:17:29,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:29,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 258 [2024-10-10 23:17:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:29,751 INFO L225 Difference]: With dead ends: 4036 [2024-10-10 23:17:29,751 INFO L226 Difference]: Without dead ends: 2088 [2024-10-10 23:17:29,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:17:29,753 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 77 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:29,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 222 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:17:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2024-10-10 23:17:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2088. [2024-10-10 23:17:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2087 states have (on average 1.19932918064207) internal successors, (2503), 2087 states have internal predecessors, (2503), 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-10 23:17:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2503 transitions. [2024-10-10 23:17:29,777 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2503 transitions. Word has length 258 [2024-10-10 23:17:29,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:29,777 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2503 transitions. [2024-10-10 23:17:29,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-10 23:17:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2503 transitions. [2024-10-10 23:17:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-10-10 23:17:29,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:29,780 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, 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, 1, 1, 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-10 23:17:29,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:17:29,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:29,981 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:29,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:29,982 INFO L85 PathProgramCache]: Analyzing trace with hash 85053556, now seen corresponding path program 1 times [2024-10-10 23:17:29,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:29,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822444222] [2024-10-10 23:17:29,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:29,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 125 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:30,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:30,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822444222] [2024-10-10 23:17:30,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822444222] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:17:30,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652116722] [2024-10-10 23:17:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:30,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:30,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:30,277 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:17:30,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:17:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:30,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:17:30,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:17:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-10 23:17:30,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:17:30,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652116722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:30,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:17:30,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-10 23:17:30,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355740331] [2024-10-10 23:17:30,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:30,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:30,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:17:30,541 INFO L87 Difference]: Start difference. First operand 2088 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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-10 23:17:30,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:30,883 INFO L93 Difference]: Finished difference Result 4731 states and 5730 transitions. [2024-10-10 23:17:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:30,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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 265 [2024-10-10 23:17:30,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:30,890 INFO L225 Difference]: With dead ends: 4731 [2024-10-10 23:17:30,890 INFO L226 Difference]: Without dead ends: 2783 [2024-10-10 23:17:30,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:17:30,893 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 64 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:30,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 33 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:17:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2024-10-10 23:17:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2783. [2024-10-10 23:17:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2783 states, 2782 states have (on average 1.1595974119338606) internal successors, (3226), 2782 states have internal predecessors, (3226), 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-10 23:17:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 3226 transitions. [2024-10-10 23:17:30,932 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 3226 transitions. Word has length 265 [2024-10-10 23:17:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:30,933 INFO L471 AbstractCegarLoop]: Abstraction has 2783 states and 3226 transitions. [2024-10-10 23:17:30,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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-10 23:17:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 3226 transitions. [2024-10-10 23:17:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-10 23:17:30,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:30,936 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:17:30,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:17:31,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:31,137 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:31,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash -50964190, now seen corresponding path program 1 times [2024-10-10 23:17:31,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:31,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027845340] [2024-10-10 23:17:31,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-10 23:17:31,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:31,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027845340] [2024-10-10 23:17:31,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027845340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:31,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:31,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481722471] [2024-10-10 23:17:31,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:31,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:31,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:31,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:31,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:31,279 INFO L87 Difference]: Start difference. First operand 2783 states and 3226 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-10 23:17:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:31,624 INFO L93 Difference]: Finished difference Result 5426 states and 6308 transitions. [2024-10-10 23:17:31,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:31,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 274 [2024-10-10 23:17:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:31,630 INFO L225 Difference]: With dead ends: 5426 [2024-10-10 23:17:31,631 INFO L226 Difference]: Without dead ends: 2783 [2024-10-10 23:17:31,633 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-10 23:17:31,633 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 83 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:31,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 197 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:17:31,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2024-10-10 23:17:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2505. [2024-10-10 23:17:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2504 states have (on average 1.1261980830670926) internal successors, (2820), 2504 states have internal predecessors, (2820), 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-10 23:17:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 2820 transitions. [2024-10-10 23:17:31,663 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 2820 transitions. Word has length 274 [2024-10-10 23:17:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:31,663 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 2820 transitions. [2024-10-10 23:17:31,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-10 23:17:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 2820 transitions. [2024-10-10 23:17:31,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-10 23:17:31,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:31,666 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:31,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:17:31,666 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:31,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash -12051553, now seen corresponding path program 1 times [2024-10-10 23:17:31,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:31,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78923701] [2024-10-10 23:17:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:31,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-10 23:17:31,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:31,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78923701] [2024-10-10 23:17:31,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78923701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:31,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:31,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614541159] [2024-10-10 23:17:31,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:31,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:31,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:31,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:31,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:31,878 INFO L87 Difference]: Start difference. First operand 2505 states and 2820 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-10 23:17:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:32,466 INFO L93 Difference]: Finished difference Result 4731 states and 5352 transitions. [2024-10-10 23:17:32,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:32,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 280 [2024-10-10 23:17:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:32,473 INFO L225 Difference]: With dead ends: 4731 [2024-10-10 23:17:32,474 INFO L226 Difference]: Without dead ends: 2366 [2024-10-10 23:17:32,476 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-10 23:17:32,476 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 78 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:32,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 212 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:17:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2024-10-10 23:17:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2024-10-10 23:17:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2365 states have (on average 1.0959830866807612) internal successors, (2592), 2365 states have internal predecessors, (2592), 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-10 23:17:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 2592 transitions. [2024-10-10 23:17:32,504 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 2592 transitions. Word has length 280 [2024-10-10 23:17:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:32,504 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 2592 transitions. [2024-10-10 23:17:32,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-10 23:17:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 2592 transitions. [2024-10-10 23:17:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-10-10 23:17:32,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:32,509 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, 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, 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, 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] [2024-10-10 23:17:32,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:17:32,509 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:32,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash 913807930, now seen corresponding path program 1 times [2024-10-10 23:17:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:32,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863781816] [2024-10-10 23:17:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-10 23:17:32,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:32,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863781816] [2024-10-10 23:17:32,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863781816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:32,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:32,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:17:32,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605410325] [2024-10-10 23:17:32,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:32,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:17:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:32,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:17:32,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:17:32,868 INFO L87 Difference]: Start difference. First operand 2366 states and 2592 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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-10 23:17:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:33,443 INFO L93 Difference]: Finished difference Result 5009 states and 5482 transitions. [2024-10-10 23:17:33,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:17:33,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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 362 [2024-10-10 23:17:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:33,449 INFO L225 Difference]: With dead ends: 5009 [2024-10-10 23:17:33,450 INFO L226 Difference]: Without dead ends: 2783 [2024-10-10 23:17:33,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10 23:17:33,452 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:33,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 14 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:17:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2024-10-10 23:17:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2227. [2024-10-10 23:17:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 2226 states have (on average 1.0952380952380953) internal successors, (2438), 2226 states have internal predecessors, (2438), 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-10 23:17:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 2438 transitions. [2024-10-10 23:17:33,478 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 2438 transitions. Word has length 362 [2024-10-10 23:17:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:33,479 INFO L471 AbstractCegarLoop]: Abstraction has 2227 states and 2438 transitions. [2024-10-10 23:17:33,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 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-10 23:17:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 2438 transitions. [2024-10-10 23:17:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-10-10 23:17:33,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:33,484 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, 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, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:33,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:17:33,484 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:33,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:33,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1636937517, now seen corresponding path program 1 times [2024-10-10 23:17:33,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:33,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375067161] [2024-10-10 23:17:33,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:33,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-10 23:17:33,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:33,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375067161] [2024-10-10 23:17:33,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375067161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:33,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:33,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:33,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057265341] [2024-10-10 23:17:33,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:33,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:33,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:33,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:33,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:33,670 INFO L87 Difference]: Start difference. First operand 2227 states and 2438 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 23:17:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:33,985 INFO L93 Difference]: Finished difference Result 4314 states and 4732 transitions. [2024-10-10 23:17:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:33,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 372 [2024-10-10 23:17:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:33,991 INFO L225 Difference]: With dead ends: 4314 [2024-10-10 23:17:33,991 INFO L226 Difference]: Without dead ends: 2227 [2024-10-10 23:17:33,993 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-10 23:17:33,993 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 90 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:33,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 187 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:17:33,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2024-10-10 23:17:34,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2088. [2024-10-10 23:17:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2087 states have (on average 1.0757067561092477) internal successors, (2245), 2087 states have internal predecessors, (2245), 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-10 23:17:34,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2245 transitions. [2024-10-10 23:17:34,014 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2245 transitions. Word has length 372 [2024-10-10 23:17:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:34,015 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2245 transitions. [2024-10-10 23:17:34,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-10 23:17:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2245 transitions. [2024-10-10 23:17:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-10-10 23:17:34,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:34,019 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, 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, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:34,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:17:34,019 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:34,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:34,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1972331490, now seen corresponding path program 1 times [2024-10-10 23:17:34,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:34,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775040098] [2024-10-10 23:17:34,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:34,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-10 23:17:34,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:34,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775040098] [2024-10-10 23:17:34,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775040098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:34,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:34,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:17:34,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513795916] [2024-10-10 23:17:34,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:34,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:17:34,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:34,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:17:34,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:17:34,395 INFO L87 Difference]: Start difference. First operand 2088 states and 2245 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 6 states have internal predecessors, (189), 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-10 23:17:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:34,791 INFO L93 Difference]: Finished difference Result 3952 states and 4253 transitions. [2024-10-10 23:17:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:17:34,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 6 states have internal predecessors, (189), 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 378 [2024-10-10 23:17:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:34,792 INFO L225 Difference]: With dead ends: 3952 [2024-10-10 23:17:34,792 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:17:34,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:17:34,794 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 89 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:34,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 21 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:17:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:17:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-10 23:17:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:17:34,795 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 378 [2024-10-10 23:17:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:34,796 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:17:34,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 6 states have internal predecessors, (189), 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-10 23:17:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:17:34,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:17:34,798 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:17:34,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:17:34,801 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:34,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:17:34,966 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:17:34,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:17:34 BoogieIcfgContainer [2024-10-10 23:17:34,993 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:17:34,994 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:17:34,994 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:17:34,994 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:17:34,994 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:17:19" (3/4) ... [2024-10-10 23:17:34,996 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:17:35,017 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:17:35,022 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:17:35,022 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:17:35,023 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:17:35,160 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:17:35,160 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:17:35,161 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:17:35,161 INFO L158 Benchmark]: Toolchain (without parser) took 17796.27ms. Allocated memory was 144.7MB in the beginning and 465.6MB in the end (delta: 320.9MB). Free memory was 73.8MB in the beginning and 216.5MB in the end (delta: -142.7MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. [2024-10-10 23:17:35,161 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 144.7MB. Free memory is still 107.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:17:35,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.92ms. Allocated memory was 144.7MB in the beginning and 188.7MB in the end (delta: 44.0MB). Free memory was 73.5MB in the beginning and 151.9MB in the end (delta: -78.4MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-10-10 23:17:35,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.83ms. Allocated memory is still 188.7MB. Free memory was 151.9MB in the beginning and 143.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:17:35,162 INFO L158 Benchmark]: Boogie Preprocessor took 93.12ms. Allocated memory is still 188.7MB. Free memory was 143.5MB in the beginning and 134.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:17:35,162 INFO L158 Benchmark]: RCFGBuilder took 1090.28ms. Allocated memory is still 188.7MB. Free memory was 134.1MB in the beginning and 107.5MB in the end (delta: 26.6MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-10 23:17:35,163 INFO L158 Benchmark]: TraceAbstraction took 15798.74ms. Allocated memory was 188.7MB in the beginning and 465.6MB in the end (delta: 276.8MB). Free memory was 107.5MB in the beginning and 229.1MB in the end (delta: -121.6MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. [2024-10-10 23:17:35,163 INFO L158 Benchmark]: Witness Printer took 166.99ms. Allocated memory is still 465.6MB. Free memory was 228.0MB in the beginning and 216.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:17:35,164 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 144.7MB. Free memory is still 107.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.92ms. Allocated memory was 144.7MB in the beginning and 188.7MB in the end (delta: 44.0MB). Free memory was 73.5MB in the beginning and 151.9MB in the end (delta: -78.4MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.83ms. Allocated memory is still 188.7MB. Free memory was 151.9MB in the beginning and 143.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.12ms. Allocated memory is still 188.7MB. Free memory was 143.5MB in the beginning and 134.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1090.28ms. Allocated memory is still 188.7MB. Free memory was 134.1MB in the beginning and 107.5MB in the end (delta: 26.6MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15798.74ms. Allocated memory was 188.7MB in the beginning and 465.6MB in the end (delta: 276.8MB). Free memory was 107.5MB in the beginning and 229.1MB in the end (delta: -121.6MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. * Witness Printer took 166.99ms. Allocated memory is still 465.6MB. Free memory was 228.0MB in the beginning and 216.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 209]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2529 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2529 mSDsluCounter, 1607 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 1625 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8343 IncrementalHoareTripleChecker+Invalid, 9968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1625 mSolverCounterUnsat, 1493 mSDtfsCounter, 8343 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1011 GetRequests, 967 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2783occurred in iteration=10, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 2085 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 4039 NumberOfCodeBlocks, 4039 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4232 ConstructedInterpolants, 0 QuantifiedInterpolants, 15910 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1032 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 3222/3646 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: ((((((((((a10 == 1) && (14 == a4)) && (a12 == 0)) && (0 <= ((long long) 600000 + a1))) || ((((a10 == 0) && (0 <= ((long long) a1 + 12))) && (14 == a4)) && (a12 == 0))) || (((((a10 == 0) && (14 == a4)) && (a12 == 0)) && (0 <= ((long long) 600000 + a1))) && (10 <= a19))) || (((((a19 <= 9) && (a10 == 3)) && (14 == a4)) && (a12 == 0)) && (0 <= ((long long) 600000 + a1)))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((((a10 == 0) && (14 == a4)) && (a12 == 0)) && (a19 == 6)) && (0 <= ((long long) 600000 + a1)))) || (((((a19 <= 9) && (4 <= a10)) && (14 == a4)) && (a12 == 0)) && (0 <= ((long long) 600000 + a1)))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:17:35,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE