./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.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/bitvector/s3_srvr_2a.BV.c.cil.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 b8cfead7c1f307a9ba2676fad86c005fa434c5b4bc168c34fe90a644ea9973b2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:29:31,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:29:31,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:29:31,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:29:31,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:29:31,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:29:31,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:29:31,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:29:31,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:29:31,126 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:29:31,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:29:31,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:29:31,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:29:31,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:29:31,128 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:29:31,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:29:31,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:29:31,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:29:31,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:29:31,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:29:31,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:29:31,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:29:31,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:29:31,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:29:31,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:29:31,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:29:31,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:29:31,135 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:29:31,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:29:31,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:29:31,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:29:31,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:29:31,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:29:31,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:29:31,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:29:31,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:29:31,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:29:31,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:29:31,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:29:31,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:29:31,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:29:31,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:29:31,140 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 -> b8cfead7c1f307a9ba2676fad86c005fa434c5b4bc168c34fe90a644ea9973b2 [2024-10-10 22:29:31,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:29:31,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:29:31,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:29:31,440 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:29:31,440 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:29:31,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c [2024-10-10 22:29:32,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:29:33,158 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:29:33,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c [2024-10-10 22:29:33,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/21c0db80b/84627d3aa00546a084340aab3932a667/FLAGc5e6d2945 [2024-10-10 22:29:33,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/21c0db80b/84627d3aa00546a084340aab3932a667 [2024-10-10 22:29:33,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:29:33,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:29:33,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:29:33,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:29:33,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:29:33,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:33,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211a3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33, skipping insertion in model container [2024-10-10 22:29:33,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:33,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:29:33,875 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c[44872,44885] [2024-10-10 22:29:33,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:29:33,900 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:29:33,955 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c[44872,44885] [2024-10-10 22:29:33,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:29:33,974 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:29:33,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33 WrapperNode [2024-10-10 22:29:33,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:29:33,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:29:33,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:29:33,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:29:33,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:33,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:34,044 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 567 [2024-10-10 22:29:34,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:29:34,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:29:34,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:29:34,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:29:34,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:34,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:34,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:34,087 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:29:34,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:34,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:34,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:34,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:34,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:34,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:34,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:29:34,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:29:34,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:29:34,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:29:34,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (1/1) ... [2024-10-10 22:29:34,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:29:34,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:34,165 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 22:29:34,171 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 22:29:34,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:29:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:29:34,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:29:34,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:29:34,330 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:29:34,332 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:29:34,347 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-10 22:29:34,791 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2024-10-10 22:29:34,791 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2024-10-10 22:29:34,859 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-10 22:29:34,859 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:29:34,945 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:29:34,945 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:29:34,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:34 BoogieIcfgContainer [2024-10-10 22:29:34,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:29:34,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:29:34,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:29:34,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:29:34,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:29:33" (1/3) ... [2024-10-10 22:29:34,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37330376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:29:34, skipping insertion in model container [2024-10-10 22:29:34,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:33" (2/3) ... [2024-10-10 22:29:34,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37330376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:29:34, skipping insertion in model container [2024-10-10 22:29:34,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:34" (3/3) ... [2024-10-10 22:29:34,958 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a.BV.c.cil.c [2024-10-10 22:29:34,973 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:29:34,974 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:29:35,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:29:35,045 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;@2052d8dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:29:35,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:29:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.795275590551181) internal successors, (228), 128 states have internal predecessors, (228), 0 states have call successors, (0), 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 22:29:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:29:35,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:35,056 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] [2024-10-10 22:29:35,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:35,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:35,060 INFO L85 PathProgramCache]: Analyzing trace with hash -885659394, now seen corresponding path program 1 times [2024-10-10 22:29:35,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:35,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266600146] [2024-10-10 22:29:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:35,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:35,370 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 22:29:35,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:35,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266600146] [2024-10-10 22:29:35,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266600146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:35,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:35,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:29:35,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538188579] [2024-10-10 22:29:35,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:35,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:35,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:35,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:35,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:35,408 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.795275590551181) internal successors, (228), 128 states have internal predecessors, (228), 0 states have call successors, (0), 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 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:35,614 INFO L93 Difference]: Finished difference Result 256 states and 454 transitions. [2024-10-10 22:29:35,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:35,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-10 22:29:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:35,629 INFO L225 Difference]: With dead ends: 256 [2024-10-10 22:29:35,629 INFO L226 Difference]: Without dead ends: 121 [2024-10-10 22:29:35,632 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 22:29:35,635 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:35,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 302 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:29:35,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-10 22:29:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-10 22:29:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5083333333333333) internal successors, (181), 120 states have internal predecessors, (181), 0 states have call successors, (0), 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 22:29:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 181 transitions. [2024-10-10 22:29:35,674 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 181 transitions. Word has length 42 [2024-10-10 22:29:35,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:35,675 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 181 transitions. [2024-10-10 22:29:35,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:29:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 181 transitions. [2024-10-10 22:29:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-10 22:29:35,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:35,678 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:35,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:29:35,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:35,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1758820122, now seen corresponding path program 1 times [2024-10-10 22:29:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:35,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131691742] [2024-10-10 22:29:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:29:35,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:35,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131691742] [2024-10-10 22:29:35,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131691742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:35,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:35,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:35,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335077337] [2024-10-10 22:29:35,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:35,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:35,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:35,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:35,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:35,879 INFO L87 Difference]: Start difference. First operand 121 states and 181 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 22:29:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:35,943 INFO L93 Difference]: Finished difference Result 323 states and 494 transitions. [2024-10-10 22:29:35,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:35,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-10 22:29:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:35,947 INFO L225 Difference]: With dead ends: 323 [2024-10-10 22:29:35,948 INFO L226 Difference]: Without dead ends: 219 [2024-10-10 22:29:35,948 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 22:29:35,950 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 110 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:35,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 333 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-10 22:29:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-10 22:29:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.5137614678899083) internal successors, (330), 218 states have internal predecessors, (330), 0 states have call successors, (0), 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 22:29:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 330 transitions. [2024-10-10 22:29:35,974 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 330 transitions. Word has length 57 [2024-10-10 22:29:35,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:35,975 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 330 transitions. [2024-10-10 22:29:35,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 22:29:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 330 transitions. [2024-10-10 22:29:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-10 22:29:35,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:35,980 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:35,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:29:35,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:35,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:35,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1335173400, now seen corresponding path program 1 times [2024-10-10 22:29:35,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:35,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567356459] [2024-10-10 22:29:35,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:35,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:29:36,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:36,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567356459] [2024-10-10 22:29:36,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567356459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:36,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:36,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:29:36,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064725509] [2024-10-10 22:29:36,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:36,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:36,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:36,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:36,081 INFO L87 Difference]: Start difference. First operand 219 states and 330 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 22:29:36,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:36,113 INFO L93 Difference]: Finished difference Result 423 states and 642 transitions. [2024-10-10 22:29:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:36,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-10 22:29:36,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:36,115 INFO L225 Difference]: With dead ends: 423 [2024-10-10 22:29:36,116 INFO L226 Difference]: Without dead ends: 221 [2024-10-10 22:29:36,116 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 22:29:36,121 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 6 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:36,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 315 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:36,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-10 22:29:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-10-10 22:29:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.509090909090909) internal successors, (332), 220 states have internal predecessors, (332), 0 states have call successors, (0), 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 22:29:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 332 transitions. [2024-10-10 22:29:36,143 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 332 transitions. Word has length 57 [2024-10-10 22:29:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:36,143 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 332 transitions. [2024-10-10 22:29:36,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 22:29:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 332 transitions. [2024-10-10 22:29:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-10 22:29:36,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:36,150 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:29:36,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:29:36,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:36,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:36,153 INFO L85 PathProgramCache]: Analyzing trace with hash 808134731, now seen corresponding path program 1 times [2024-10-10 22:29:36,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:36,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289473794] [2024-10-10 22:29:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-10 22:29:36,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:36,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289473794] [2024-10-10 22:29:36,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289473794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:36,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:36,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:36,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093118661] [2024-10-10 22:29:36,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:36,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:36,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:36,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:36,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:36,236 INFO L87 Difference]: Start difference. First operand 221 states and 332 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 22:29:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:36,411 INFO L93 Difference]: Finished difference Result 504 states and 784 transitions. [2024-10-10 22:29:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:36,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-10 22:29:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:36,415 INFO L225 Difference]: With dead ends: 504 [2024-10-10 22:29:36,415 INFO L226 Difference]: Without dead ends: 302 [2024-10-10 22:29:36,416 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 22:29:36,421 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:36,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 263 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:29:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-10 22:29:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-10-10 22:29:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.4053156146179402) internal successors, (423), 301 states have internal predecessors, (423), 0 states have call successors, (0), 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 22:29:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 423 transitions. [2024-10-10 22:29:36,444 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 423 transitions. Word has length 77 [2024-10-10 22:29:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:36,446 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 423 transitions. [2024-10-10 22:29:36,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 22:29:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 423 transitions. [2024-10-10 22:29:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-10 22:29:36,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:36,449 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:29:36,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:29:36,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:36,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:36,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1231781453, now seen corresponding path program 1 times [2024-10-10 22:29:36,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:36,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557509720] [2024-10-10 22:29:36,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:36,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-10 22:29:36,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:36,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557509720] [2024-10-10 22:29:36,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557509720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:36,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:36,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:36,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362953144] [2024-10-10 22:29:36,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:36,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:36,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:36,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:36,523 INFO L87 Difference]: Start difference. First operand 302 states and 423 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 22:29:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:36,678 INFO L93 Difference]: Finished difference Result 607 states and 859 transitions. [2024-10-10 22:29:36,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:36,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-10 22:29:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:36,680 INFO L225 Difference]: With dead ends: 607 [2024-10-10 22:29:36,680 INFO L226 Difference]: Without dead ends: 324 [2024-10-10 22:29:36,681 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 22:29:36,683 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:36,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 264 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:36,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-10 22:29:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-10-10 22:29:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.3931888544891642) internal successors, (450), 323 states have internal predecessors, (450), 0 states have call successors, (0), 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 22:29:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 450 transitions. [2024-10-10 22:29:36,703 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 450 transitions. Word has length 77 [2024-10-10 22:29:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:36,704 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 450 transitions. [2024-10-10 22:29:36,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 22:29:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 450 transitions. [2024-10-10 22:29:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-10 22:29:36,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:36,709 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:36,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:29:36,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:36,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:36,710 INFO L85 PathProgramCache]: Analyzing trace with hash -382395928, now seen corresponding path program 1 times [2024-10-10 22:29:36,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:36,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384478958] [2024-10-10 22:29:36,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:36,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-10 22:29:36,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:36,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384478958] [2024-10-10 22:29:36,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384478958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:36,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:36,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758783729] [2024-10-10 22:29:36,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:36,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:36,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:36,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:36,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:36,807 INFO L87 Difference]: Start difference. First operand 324 states and 450 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 22:29:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:36,930 INFO L93 Difference]: Finished difference Result 677 states and 957 transitions. [2024-10-10 22:29:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:36,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 96 [2024-10-10 22:29:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:36,934 INFO L225 Difference]: With dead ends: 677 [2024-10-10 22:29:36,934 INFO L226 Difference]: Without dead ends: 372 [2024-10-10 22:29:36,935 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 22:29:36,936 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:36,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 263 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-10 22:29:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2024-10-10 22:29:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.3692722371967656) internal successors, (508), 371 states have internal predecessors, (508), 0 states have call successors, (0), 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 22:29:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 508 transitions. [2024-10-10 22:29:36,953 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 508 transitions. Word has length 96 [2024-10-10 22:29:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:36,954 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 508 transitions. [2024-10-10 22:29:36,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 22:29:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 508 transitions. [2024-10-10 22:29:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-10 22:29:36,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:36,958 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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 22:29:36,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:29:36,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:36,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash -376941569, now seen corresponding path program 1 times [2024-10-10 22:29:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:36,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743018144] [2024-10-10 22:29:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-10 22:29:37,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:37,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743018144] [2024-10-10 22:29:37,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743018144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:37,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:37,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:37,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461577344] [2024-10-10 22:29:37,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:37,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:37,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:37,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:37,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:37,050 INFO L87 Difference]: Start difference. First operand 372 states and 508 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 22:29:37,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:37,088 INFO L93 Difference]: Finished difference Result 888 states and 1222 transitions. [2024-10-10 22:29:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:37,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 116 [2024-10-10 22:29:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:37,091 INFO L225 Difference]: With dead ends: 888 [2024-10-10 22:29:37,091 INFO L226 Difference]: Without dead ends: 535 [2024-10-10 22:29:37,092 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 22:29:37,093 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 110 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:37,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 467 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-10 22:29:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2024-10-10 22:29:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.3707865168539326) internal successors, (732), 534 states have internal predecessors, (732), 0 states have call successors, (0), 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 22:29:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 732 transitions. [2024-10-10 22:29:37,106 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 732 transitions. Word has length 116 [2024-10-10 22:29:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:37,107 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 732 transitions. [2024-10-10 22:29:37,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 22:29:37,108 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 732 transitions. [2024-10-10 22:29:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-10 22:29:37,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:37,109 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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 22:29:37,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:29:37,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:37,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:37,110 INFO L85 PathProgramCache]: Analyzing trace with hash -128795075, now seen corresponding path program 1 times [2024-10-10 22:29:37,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:37,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919836952] [2024-10-10 22:29:37,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:37,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-10 22:29:37,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:37,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919836952] [2024-10-10 22:29:37,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919836952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:37,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:37,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:37,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4134711] [2024-10-10 22:29:37,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:37,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:37,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:37,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:37,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:37,185 INFO L87 Difference]: Start difference. First operand 535 states and 732 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 22:29:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:37,227 INFO L93 Difference]: Finished difference Result 1238 states and 1700 transitions. [2024-10-10 22:29:37,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:37,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 116 [2024-10-10 22:29:37,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:37,231 INFO L225 Difference]: With dead ends: 1238 [2024-10-10 22:29:37,232 INFO L226 Difference]: Without dead ends: 722 [2024-10-10 22:29:37,232 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 22:29:37,234 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 112 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:37,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 465 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-10-10 22:29:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2024-10-10 22:29:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 1.3675450762829404) internal successors, (986), 721 states have internal predecessors, (986), 0 states have call successors, (0), 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 22:29:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 986 transitions. [2024-10-10 22:29:37,256 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 986 transitions. Word has length 116 [2024-10-10 22:29:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:37,256 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 986 transitions. [2024-10-10 22:29:37,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 22:29:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 986 transitions. [2024-10-10 22:29:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-10 22:29:37,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:37,259 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:37,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:29:37,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:37,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:37,261 INFO L85 PathProgramCache]: Analyzing trace with hash 864017877, now seen corresponding path program 1 times [2024-10-10 22:29:37,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:37,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676687483] [2024-10-10 22:29:37,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:37,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-10 22:29:37,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:37,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676687483] [2024-10-10 22:29:37,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676687483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:37,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151312335] [2024-10-10 22:29:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:37,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:37,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:37,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:37,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:37,352 INFO L87 Difference]: Start difference. First operand 722 states and 986 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 22:29:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:37,511 INFO L93 Difference]: Finished difference Result 1551 states and 2174 transitions. [2024-10-10 22:29:37,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:37,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 176 [2024-10-10 22:29:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:37,514 INFO L225 Difference]: With dead ends: 1551 [2024-10-10 22:29:37,514 INFO L226 Difference]: Without dead ends: 848 [2024-10-10 22:29:37,517 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 22:29:37,519 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 31 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:37,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 262 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-10-10 22:29:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 842. [2024-10-10 22:29:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.3329369797859691) internal successors, (1121), 841 states have internal predecessors, (1121), 0 states have call successors, (0), 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 22:29:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1121 transitions. [2024-10-10 22:29:37,536 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1121 transitions. Word has length 176 [2024-10-10 22:29:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:37,536 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1121 transitions. [2024-10-10 22:29:37,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 22:29:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1121 transitions. [2024-10-10 22:29:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-10 22:29:37,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:37,540 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:37,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:29:37,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:37,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash -405478866, now seen corresponding path program 1 times [2024-10-10 22:29:37,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:37,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587447799] [2024-10-10 22:29:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:37,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-10 22:29:37,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:37,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587447799] [2024-10-10 22:29:37,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587447799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:37,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:37,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:37,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359269570] [2024-10-10 22:29:37,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:37,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:37,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:37,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:37,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:37,624 INFO L87 Difference]: Start difference. First operand 842 states and 1121 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 22:29:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:37,789 INFO L93 Difference]: Finished difference Result 1833 states and 2519 transitions. [2024-10-10 22:29:37,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:37,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 217 [2024-10-10 22:29:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:37,793 INFO L225 Difference]: With dead ends: 1833 [2024-10-10 22:29:37,793 INFO L226 Difference]: Without dead ends: 962 [2024-10-10 22:29:37,794 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 22:29:37,795 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 33 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:37,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 261 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-10 22:29:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2024-10-10 22:29:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3121748178980228) internal successors, (1261), 961 states have internal predecessors, (1261), 0 states have call successors, (0), 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 22:29:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1261 transitions. [2024-10-10 22:29:37,811 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1261 transitions. Word has length 217 [2024-10-10 22:29:37,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:37,811 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1261 transitions. [2024-10-10 22:29:37,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 22:29:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1261 transitions. [2024-10-10 22:29:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-10 22:29:37,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:37,815 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-10 22:29:37,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:29:37,815 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:37,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:37,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1242759366, now seen corresponding path program 1 times [2024-10-10 22:29:37,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:37,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992963776] [2024-10-10 22:29:37,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:37,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 410 proven. 15 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-10 22:29:37,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:37,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992963776] [2024-10-10 22:29:37,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992963776] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:37,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918262404] [2024-10-10 22:29:37,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:37,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:37,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:37,930 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 22:29:37,932 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 22:29:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:38,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:29:38,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 410 proven. 15 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-10 22:29:38,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 410 proven. 15 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-10 22:29:38,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918262404] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:38,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:38,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-10 22:29:38,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583257084] [2024-10-10 22:29:38,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:38,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:29:38,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:38,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:29:38,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:29:38,280 INFO L87 Difference]: Start difference. First operand 962 states and 1261 transitions. Second operand has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 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 22:29:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:38,962 INFO L93 Difference]: Finished difference Result 4152 states and 5769 transitions. [2024-10-10 22:29:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:29:38,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 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 244 [2024-10-10 22:29:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:38,973 INFO L225 Difference]: With dead ends: 4152 [2024-10-10 22:29:38,974 INFO L226 Difference]: Without dead ends: 3209 [2024-10-10 22:29:38,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:29:38,976 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 295 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:38,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1091 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:29:38,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2024-10-10 22:29:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 2375. [2024-10-10 22:29:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2374 states have (on average 1.3163437236731255) internal successors, (3125), 2374 states have internal predecessors, (3125), 0 states have call successors, (0), 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 22:29:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3125 transitions. [2024-10-10 22:29:39,025 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3125 transitions. Word has length 244 [2024-10-10 22:29:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:39,026 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 3125 transitions. [2024-10-10 22:29:39,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 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 22:29:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3125 transitions. [2024-10-10 22:29:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-10 22:29:39,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:39,030 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-10 22:29:39,048 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 22:29:39,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 22:29:39,232 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:39,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:39,233 INFO L85 PathProgramCache]: Analyzing trace with hash 657987716, now seen corresponding path program 1 times [2024-10-10 22:29:39,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:39,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438375213] [2024-10-10 22:29:39,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:39,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-10-10 22:29:39,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:39,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438375213] [2024-10-10 22:29:39,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438375213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:39,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:39,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:39,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149829129] [2024-10-10 22:29:39,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:39,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:39,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:39,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:39,315 INFO L87 Difference]: Start difference. First operand 2375 states and 3125 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 22:29:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:39,387 INFO L93 Difference]: Finished difference Result 6595 states and 8751 transitions. [2024-10-10 22:29:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:39,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 244 [2024-10-10 22:29:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:39,399 INFO L225 Difference]: With dead ends: 6595 [2024-10-10 22:29:39,399 INFO L226 Difference]: Without dead ends: 3044 [2024-10-10 22:29:39,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:39,405 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 108 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:39,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 477 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2024-10-10 22:29:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2944. [2024-10-10 22:29:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2943 states have (on average 1.3377505946313286) internal successors, (3937), 2943 states have internal predecessors, (3937), 0 states have call successors, (0), 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 22:29:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 3937 transitions. [2024-10-10 22:29:39,487 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 3937 transitions. Word has length 244 [2024-10-10 22:29:39,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:39,488 INFO L471 AbstractCegarLoop]: Abstraction has 2944 states and 3937 transitions. [2024-10-10 22:29:39,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 22:29:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 3937 transitions. [2024-10-10 22:29:39,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-10-10 22:29:39,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:39,495 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-10 22:29:39,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:29:39,495 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:39,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash 557502408, now seen corresponding path program 1 times [2024-10-10 22:29:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:39,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463895534] [2024-10-10 22:29:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:39,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-10-10 22:29:39,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:39,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463895534] [2024-10-10 22:29:39,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463895534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:39,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:39,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:39,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252315497] [2024-10-10 22:29:39,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:39,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:39,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:39,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:39,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:39,572 INFO L87 Difference]: Start difference. First operand 2944 states and 3937 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 22:29:39,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:39,714 INFO L93 Difference]: Finished difference Result 6181 states and 8295 transitions. [2024-10-10 22:29:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:39,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 288 [2024-10-10 22:29:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:39,725 INFO L225 Difference]: With dead ends: 6181 [2024-10-10 22:29:39,726 INFO L226 Difference]: Without dead ends: 3256 [2024-10-10 22:29:39,730 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 22:29:39,731 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:39,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 263 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2024-10-10 22:29:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 3256. [2024-10-10 22:29:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3256 states, 3255 states have (on average 1.3238095238095238) internal successors, (4309), 3255 states have internal predecessors, (4309), 0 states have call successors, (0), 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 22:29:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3256 states to 3256 states and 4309 transitions. [2024-10-10 22:29:39,796 INFO L78 Accepts]: Start accepts. Automaton has 3256 states and 4309 transitions. Word has length 288 [2024-10-10 22:29:39,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:39,797 INFO L471 AbstractCegarLoop]: Abstraction has 3256 states and 4309 transitions. [2024-10-10 22:29:39,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 22:29:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 4309 transitions. [2024-10-10 22:29:39,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-10-10 22:29:39,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:39,803 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-10 22:29:39,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:29:39,803 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:39,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:39,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1731457442, now seen corresponding path program 1 times [2024-10-10 22:29:39,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:39,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507208726] [2024-10-10 22:29:39,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:39,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2024-10-10 22:29:39,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:39,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507208726] [2024-10-10 22:29:39,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507208726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:39,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:39,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:39,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237088173] [2024-10-10 22:29:39,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:39,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:39,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:39,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:39,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:39,910 INFO L87 Difference]: Start difference. First operand 3256 states and 4309 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 22:29:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:40,042 INFO L93 Difference]: Finished difference Result 6829 states and 9087 transitions. [2024-10-10 22:29:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:40,043 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 310 [2024-10-10 22:29:40,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:40,054 INFO L225 Difference]: With dead ends: 6829 [2024-10-10 22:29:40,054 INFO L226 Difference]: Without dead ends: 3592 [2024-10-10 22:29:40,058 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 22:29:40,062 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:40,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 263 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:40,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2024-10-10 22:29:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 2943. [2024-10-10 22:29:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2943 states, 2942 states have (on average 1.3150917743031951) internal successors, (3869), 2942 states have internal predecessors, (3869), 0 states have call successors, (0), 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 22:29:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 3869 transitions. [2024-10-10 22:29:40,121 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 3869 transitions. Word has length 310 [2024-10-10 22:29:40,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:40,121 INFO L471 AbstractCegarLoop]: Abstraction has 2943 states and 3869 transitions. [2024-10-10 22:29:40,121 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 22:29:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 3869 transitions. [2024-10-10 22:29:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-10-10 22:29:40,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:40,127 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:40,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:29:40,127 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:40,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:40,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1462364412, now seen corresponding path program 1 times [2024-10-10 22:29:40,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:40,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727858398] [2024-10-10 22:29:40,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 651 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2024-10-10 22:29:40,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:40,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727858398] [2024-10-10 22:29:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727858398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:40,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:40,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:40,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321689355] [2024-10-10 22:29:40,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:40,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:40,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:40,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:40,224 INFO L87 Difference]: Start difference. First operand 2943 states and 3869 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 22:29:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:40,328 INFO L93 Difference]: Finished difference Result 8779 states and 11543 transitions. [2024-10-10 22:29:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:40,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 341 [2024-10-10 22:29:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:40,349 INFO L225 Difference]: With dead ends: 8779 [2024-10-10 22:29:40,350 INFO L226 Difference]: Without dead ends: 5855 [2024-10-10 22:29:40,355 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 22:29:40,356 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 124 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:40,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 469 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2024-10-10 22:29:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 5676. [2024-10-10 22:29:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5676 states, 5675 states have (on average 1.317885462555066) internal successors, (7479), 5675 states have internal predecessors, (7479), 0 states have call successors, (0), 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 22:29:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 7479 transitions. [2024-10-10 22:29:40,495 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 7479 transitions. Word has length 341 [2024-10-10 22:29:40,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:40,495 INFO L471 AbstractCegarLoop]: Abstraction has 5676 states and 7479 transitions. [2024-10-10 22:29:40,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 22:29:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 7479 transitions. [2024-10-10 22:29:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-10 22:29:40,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:40,506 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:40,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:29:40,506 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:40,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1398457759, now seen corresponding path program 1 times [2024-10-10 22:29:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:40,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385690531] [2024-10-10 22:29:40,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:40,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 826 proven. 25 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-10-10 22:29:40,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:40,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385690531] [2024-10-10 22:29:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385690531] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:40,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275601432] [2024-10-10 22:29:40,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:40,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:40,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:40,647 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 22:29:40,649 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 22:29:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:40,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:29:40,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2024-10-10 22:29:41,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:41,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275601432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:41,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:41,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 22:29:41,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185106980] [2024-10-10 22:29:41,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:41,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:41,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:41,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:41,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:29:41,097 INFO L87 Difference]: Start difference. First operand 5676 states and 7479 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 22:29:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:41,150 INFO L93 Difference]: Finished difference Result 6512 states and 8591 transitions. [2024-10-10 22:29:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:41,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 342 [2024-10-10 22:29:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:41,166 INFO L225 Difference]: With dead ends: 6512 [2024-10-10 22:29:41,166 INFO L226 Difference]: Without dead ends: 4705 [2024-10-10 22:29:41,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:29:41,169 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 82 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:41,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 461 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4705 states. [2024-10-10 22:29:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4705 to 3691. [2024-10-10 22:29:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 3690 states have (on average 1.3181571815718158) internal successors, (4864), 3690 states have internal predecessors, (4864), 0 states have call successors, (0), 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 22:29:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 4864 transitions. [2024-10-10 22:29:41,320 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 4864 transitions. Word has length 342 [2024-10-10 22:29:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:41,321 INFO L471 AbstractCegarLoop]: Abstraction has 3691 states and 4864 transitions. [2024-10-10 22:29:41,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 22:29:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 4864 transitions. [2024-10-10 22:29:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-10-10 22:29:41,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:41,333 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 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, 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 22:29:41,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 22:29:41,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 22:29:41,534 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:41,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:41,534 INFO L85 PathProgramCache]: Analyzing trace with hash 924929642, now seen corresponding path program 1 times [2024-10-10 22:29:41,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:41,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809642679] [2024-10-10 22:29:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:41,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 1185 proven. 25 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2024-10-10 22:29:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809642679] [2024-10-10 22:29:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809642679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408417688] [2024-10-10 22:29:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:41,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:41,698 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 22:29:41,699 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 22:29:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:41,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:29:41,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 1185 proven. 25 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2024-10-10 22:29:41,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 1185 proven. 25 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2024-10-10 22:29:42,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408417688] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:42,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:42,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-10 22:29:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060065541] [2024-10-10 22:29:42,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:42,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:29:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:42,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:29:42,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:29:42,038 INFO L87 Difference]: Start difference. First operand 3691 states and 4864 transitions. Second operand has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 0 states have call successors, (0), 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 22:29:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:42,591 INFO L93 Difference]: Finished difference Result 9068 states and 12342 transitions. [2024-10-10 22:29:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:29:42,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 0 states have call successors, (0), 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 401 [2024-10-10 22:29:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:42,607 INFO L225 Difference]: With dead ends: 9068 [2024-10-10 22:29:42,607 INFO L226 Difference]: Without dead ends: 5237 [2024-10-10 22:29:42,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:29:42,614 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 378 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:42,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 697 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:29:42,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5237 states. [2024-10-10 22:29:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5237 to 4664. [2024-10-10 22:29:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4664 states, 4663 states have (on average 1.3858031310315249) internal successors, (6462), 4663 states have internal predecessors, (6462), 0 states have call successors, (0), 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 22:29:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 6462 transitions. [2024-10-10 22:29:42,702 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 6462 transitions. Word has length 401 [2024-10-10 22:29:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:42,702 INFO L471 AbstractCegarLoop]: Abstraction has 4664 states and 6462 transitions. [2024-10-10 22:29:42,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 0 states have call successors, (0), 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 22:29:42,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 6462 transitions. [2024-10-10 22:29:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2024-10-10 22:29:42,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:42,714 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:42,731 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 22:29:42,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:42,915 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:42,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:42,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1391389276, now seen corresponding path program 1 times [2024-10-10 22:29:42,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:42,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211693329] [2024-10-10 22:29:42,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:42,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2967 backedges. 1576 proven. 0 refuted. 0 times theorem prover too weak. 1391 trivial. 0 not checked. [2024-10-10 22:29:43,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:43,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211693329] [2024-10-10 22:29:43,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211693329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:43,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:43,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:43,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362866456] [2024-10-10 22:29:43,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:43,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:43,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:43,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:43,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:43,078 INFO L87 Difference]: Start difference. First operand 4664 states and 6462 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 22:29:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:43,216 INFO L93 Difference]: Finished difference Result 9361 states and 12942 transitions. [2024-10-10 22:29:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:43,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 489 [2024-10-10 22:29:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:43,225 INFO L225 Difference]: With dead ends: 9361 [2024-10-10 22:29:43,226 INFO L226 Difference]: Without dead ends: 4716 [2024-10-10 22:29:43,230 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 22:29:43,231 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 11 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:43,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 259 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2024-10-10 22:29:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 4716. [2024-10-10 22:29:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4716 states, 4715 states have (on average 1.3575821845174973) internal successors, (6401), 4715 states have internal predecessors, (6401), 0 states have call successors, (0), 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 22:29:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 6401 transitions. [2024-10-10 22:29:43,311 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 6401 transitions. Word has length 489 [2024-10-10 22:29:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:43,311 INFO L471 AbstractCegarLoop]: Abstraction has 4716 states and 6401 transitions. [2024-10-10 22:29:43,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 22:29:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 6401 transitions. [2024-10-10 22:29:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2024-10-10 22:29:43,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:43,320 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 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 22:29:43,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 22:29:43,320 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:43,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2120440082, now seen corresponding path program 1 times [2024-10-10 22:29:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:43,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043803604] [2024-10-10 22:29:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3033 backedges. 1646 proven. 193 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2024-10-10 22:29:43,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:43,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043803604] [2024-10-10 22:29:43,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043803604] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:43,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963026744] [2024-10-10 22:29:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:43,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:43,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:43,686 INFO L229 MonitoredProcess]: Starting monitored process 5 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 22:29:43,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:29:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:43,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:29:43,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3033 backedges. 1694 proven. 226 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2024-10-10 22:29:45,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3033 backedges. 1783 proven. 137 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2024-10-10 22:29:46,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963026744] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:46,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:46,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-10 22:29:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498379786] [2024-10-10 22:29:46,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:46,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:29:46,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:46,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:29:46,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:29:46,318 INFO L87 Difference]: Start difference. First operand 4716 states and 6401 transitions. Second operand has 11 states, 11 states have (on average 36.90909090909091) internal successors, (406), 11 states have internal predecessors, (406), 0 states have call successors, (0), 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 22:29:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:48,110 INFO L93 Difference]: Finished difference Result 21612 states and 29237 transitions. [2024-10-10 22:29:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-10 22:29:48,111 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 36.90909090909091) internal successors, (406), 11 states have internal predecessors, (406), 0 states have call successors, (0), 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 493 [2024-10-10 22:29:48,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:48,140 INFO L225 Difference]: With dead ends: 21612 [2024-10-10 22:29:48,140 INFO L226 Difference]: Without dead ends: 16735 [2024-10-10 22:29:48,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 993 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2024-10-10 22:29:48,150 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 836 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:48,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 1259 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 22:29:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16735 states. [2024-10-10 22:29:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16735 to 16165. [2024-10-10 22:29:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16165 states, 16164 states have (on average 1.3097624350408315) internal successors, (21171), 16164 states have internal predecessors, (21171), 0 states have call successors, (0), 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 22:29:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16165 states to 16165 states and 21171 transitions. [2024-10-10 22:29:48,606 INFO L78 Accepts]: Start accepts. Automaton has 16165 states and 21171 transitions. Word has length 493 [2024-10-10 22:29:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:48,606 INFO L471 AbstractCegarLoop]: Abstraction has 16165 states and 21171 transitions. [2024-10-10 22:29:48,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 36.90909090909091) internal successors, (406), 11 states have internal predecessors, (406), 0 states have call successors, (0), 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 22:29:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 16165 states and 21171 transitions. [2024-10-10 22:29:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2024-10-10 22:29:48,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:48,649 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:48,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 22:29:48,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:48,850 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:48,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:48,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2129564387, now seen corresponding path program 2 times [2024-10-10 22:29:48,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:48,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013401551] [2024-10-10 22:29:48,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:48,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3868 backedges. 1249 proven. 15 refuted. 0 times theorem prover too weak. 2604 trivial. 0 not checked. [2024-10-10 22:29:49,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:49,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013401551] [2024-10-10 22:29:49,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013401551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:49,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250771118] [2024-10-10 22:29:49,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:29:49,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:49,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:49,074 INFO L229 MonitoredProcess]: Starting monitored process 6 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 22:29:49,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:29:49,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:29:49,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:29:49,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:29:49,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3868 backedges. 1249 proven. 15 refuted. 0 times theorem prover too weak. 2604 trivial. 0 not checked. [2024-10-10 22:29:49,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3868 backedges. 1249 proven. 15 refuted. 0 times theorem prover too weak. 2604 trivial. 0 not checked. [2024-10-10 22:29:49,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250771118] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:49,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:49,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-10 22:29:49,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790481377] [2024-10-10 22:29:49,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:49,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 22:29:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 22:29:49,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:29:49,412 INFO L87 Difference]: Start difference. First operand 16165 states and 21171 transitions. Second operand has 8 states, 8 states have (on average 33.125) internal successors, (265), 8 states have internal predecessors, (265), 0 states have call successors, (0), 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 22:29:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:49,922 INFO L93 Difference]: Finished difference Result 22128 states and 28837 transitions. [2024-10-10 22:29:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:29:49,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.125) internal successors, (265), 8 states have internal predecessors, (265), 0 states have call successors, (0), 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 561 [2024-10-10 22:29:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:49,925 INFO L225 Difference]: With dead ends: 22128 [2024-10-10 22:29:49,925 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:29:49,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1132 GetRequests, 1122 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:29:49,943 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 224 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:49,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 653 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:29:49,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:29:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:29:49,948 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 22:29:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:29:49,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 561 [2024-10-10 22:29:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:49,950 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:29:49,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.125) internal successors, (265), 8 states have internal predecessors, (265), 0 states have call successors, (0), 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 22:29:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:29:49,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:29:49,954 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:29:49,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 22:29:50,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:50,159 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:50,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:29:57,773 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:29:57,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:29:57 BoogieIcfgContainer [2024-10-10 22:29:57,820 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:29:57,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:29:57,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:29:57,825 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:29:57,825 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:34" (3/4) ... [2024-10-10 22:29:57,830 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:29:57,847 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-10 22:29:57,847 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-10 22:29:57,848 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:29:57,849 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:29:57,997 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:29:57,998 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:29:57,998 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:29:57,998 INFO L158 Benchmark]: Toolchain (without parser) took 24497.30ms. Allocated memory was 146.8MB in the beginning and 1.1GB in the end (delta: 968.9MB). Free memory was 95.0MB in the beginning and 517.5MB in the end (delta: -422.5MB). Peak memory consumption was 545.8MB. Max. memory is 16.1GB. [2024-10-10 22:29:57,999 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 50.6MB in the beginning and 50.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:29:58,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.65ms. Allocated memory is still 146.8MB. Free memory was 94.6MB in the beginning and 110.7MB in the end (delta: -16.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:29:58,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.46ms. Allocated memory is still 146.8MB. Free memory was 110.7MB in the beginning and 107.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-10 22:29:58,003 INFO L158 Benchmark]: Boogie Preprocessor took 78.36ms. Allocated memory is still 146.8MB. Free memory was 107.6MB in the beginning and 104.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:29:58,003 INFO L158 Benchmark]: RCFGBuilder took 819.53ms. Allocated memory is still 146.8MB. Free memory was 104.5MB in the beginning and 110.4MB in the end (delta: -5.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-10 22:29:58,003 INFO L158 Benchmark]: TraceAbstraction took 22875.40ms. Allocated memory was 146.8MB in the beginning and 1.1GB in the end (delta: 968.9MB). Free memory was 109.6MB in the beginning and 528.0MB in the end (delta: -418.4MB). Peak memory consumption was 589.5MB. Max. memory is 16.1GB. [2024-10-10 22:29:58,003 INFO L158 Benchmark]: Witness Printer took 173.38ms. Allocated memory is still 1.1GB. Free memory was 528.0MB in the beginning and 517.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 22:29:58,005 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.17ms. Allocated memory is still 96.5MB. Free memory was 50.6MB in the beginning and 50.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.65ms. Allocated memory is still 146.8MB. Free memory was 94.6MB in the beginning and 110.7MB in the end (delta: -16.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.46ms. Allocated memory is still 146.8MB. Free memory was 110.7MB in the beginning and 107.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.36ms. Allocated memory is still 146.8MB. Free memory was 107.6MB in the beginning and 104.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 819.53ms. Allocated memory is still 146.8MB. Free memory was 104.5MB in the beginning and 110.4MB in the end (delta: -5.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22875.40ms. Allocated memory was 146.8MB in the beginning and 1.1GB in the end (delta: 968.9MB). Free memory was 109.6MB in the beginning and 528.0MB in the end (delta: -418.4MB). Peak memory consumption was 589.5MB. Max. memory is 16.1GB. * Witness Printer took 173.38ms. Allocated memory is still 1.1GB. Free memory was 528.0MB in the beginning and 517.5MB in the end (delta: 10.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: 680]: 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, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 20, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2513 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2513 mSDsluCounter, 9087 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4363 mSDsCounter, 427 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4602 IncrementalHoareTripleChecker+Invalid, 5029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 427 mSolverCounterUnsat, 4724 mSDtfsCounter, 4602 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3839 GetRequests, 3776 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16165occurred in iteration=19, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 3925 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 6785 NumberOfCodeBlocks, 6785 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 8455 ConstructedInterpolants, 0 QuantifiedInterpolants, 19097 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3226 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 29 InterpolantComputations, 16 PerfectInterpolantSequences, 37414/38160 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: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (8466 == s__state)) && (2 == blastFlag)) && (8497 <= s__s3__tmp__next_state___0)) && (s__s3__tmp__next_state___0 <= 8576)) || ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (blastFlag == 1)) && (s__state <= 8448)) && (8497 <= s__s3__tmp__next_state___0)) && (s__s3__tmp__next_state___0 <= 8576))) || ((8464 == s__state) && (blastFlag == 0))) || (((((2 == blastFlag) && (8497 <= s__s3__tmp__next_state___0)) && (s__s3__tmp__next_state___0 <= 8576)) && ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y))) || (((1073741824 + (((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 2147483648)) <= ((long long) ag_X + ag_Y)) && ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) + 4294967296) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y)))))) && (s__state <= 8655))) || ((blastFlag == 1) && ((1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648))) || (((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4249)))) || ((((3 == blastFlag) && (8640 <= s__s3__tmp__next_state___0)) && (8640 <= s__state)) && (0 != s__hit))) || ((2 == blastFlag) && (0 != s__hit))) || (((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (s__state == 8656)) && (2 == blastFlag)) && (s__s3__tmp__next_state___0 <= 8576))) || ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8640 <= s__state)) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8655))) || ((8672 <= s__state) && (blastFlag == 1))) || ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (s__state <= 8448)) && (8497 <= s__s3__tmp__next_state___0)) && (s__s3__tmp__next_state___0 <= 8576))) || ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8544 == s__state))) || (((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (blastFlag == 1)) && (8497 <= s__state)) && (s__state <= 8655))) || (((blastFlag == 1) && (s__state <= 8448)) && (3 == s__s3__tmp__next_state___0))) || ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (8466 == s__state)) && (blastFlag == 1))) || (((8672 <= s__state) && (3 == blastFlag)) && (0 != s__hit))) || ((((s__s3__tmp__next_state___0 <= 8495) && (s__state <= 8496)) && (2 == blastFlag)) && ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y))) || (((1073741824 + (((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 2147483648)) <= ((long long) ag_X + ag_Y)) && ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) + 4294967296) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y))))))) || (((s__state == 8528) && ((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648))))) && (2 == blastFlag))) || ((((s__s3__tmp__next_state___0 <= 8495) && (2 == blastFlag)) && (s__state <= 8495)) && ((1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648))) || (((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4249)))) || ((((3 == blastFlag) && (8640 <= s__s3__tmp__next_state___0)) && (s__state <= 8448)) && (0 != s__hit))) || ((((2 * ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648))) < ((long long) s__state + 1)) && (s__state == 8656)) && (blastFlag == 1))) || ((blastFlag == 1) && (((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y))))) || ((((8672 <= s__state) && ((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648))))) && (3 == blastFlag)) && (s__s3__tmp__next_state___0 <= 8576))) || ((blastFlag == 1) && (0 != s__hit))) || ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8560 == s__state))) || ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (s__state == 8512))) || (((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8497 <= s__s3__tmp__next_state___0)) && (8497 <= s__state)) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8655))) || ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (3 == blastFlag)) && (s__state <= 8448)) && (3 == s__s3__tmp__next_state___0)) && (0 == s__hit))) RESULT: Ultimate proved your program to be correct! [2024-10-10 22:29:58,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE