./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label19.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b769442af2d950aaf4b68e467259bd2e1d98c5d8ca4dcdd5a740ef956112baf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 22:18:39,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 22:18:39,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 22:18:39,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 22:18:39,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 22:18:39,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 22:18:39,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 22:18:39,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 22:18:39,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 22:18:39,287 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 22:18:39,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 22:18:39,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 22:18:39,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 22:18:39,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 22:18:39,289 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 22:18:39,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 22:18:39,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 22:18:39,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 22:18:39,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 22:18:39,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 22:18:39,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 22:18:39,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 22:18:39,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 22:18:39,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 22:18:39,294 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 22:18:39,294 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 22:18:39,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 22:18:39,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 22:18:39,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 22:18:39,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 22:18:39,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 22:18:39,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 22:18:39,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:18:39,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 22:18:39,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 22:18:39,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 22:18:39,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 22:18:39,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 22:18:39,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 22:18:39,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 22:18:39,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 22:18:39,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 22:18:39,298 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b769442af2d950aaf4b68e467259bd2e1d98c5d8ca4dcdd5a740ef956112baf [2024-11-21 22:18:39,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 22:18:39,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 22:18:39,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 22:18:39,538 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 22:18:39,538 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 22:18:39,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label19.c [2024-11-21 22:18:40,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 22:18:41,033 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 22:18:41,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label19.c [2024-11-21 22:18:41,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cce41a372/bf76cd7f55fb40518d9554eca5a3d160/FLAG1248047ba [2024-11-21 22:18:41,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cce41a372/bf76cd7f55fb40518d9554eca5a3d160 [2024-11-21 22:18:41,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 22:18:41,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 22:18:41,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 22:18:41,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 22:18:41,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 22:18:41,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7316398b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41, skipping insertion in model container [2024-11-21 22:18:41,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 22:18:41,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label19.c[6323,6336] [2024-11-21 22:18:41,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:18:41,445 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 22:18:41,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label19.c[6323,6336] [2024-11-21 22:18:41,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:18:41,551 INFO L204 MainTranslator]: Completed translation [2024-11-21 22:18:41,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41 WrapperNode [2024-11-21 22:18:41,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 22:18:41,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 22:18:41,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 22:18:41,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 22:18:41,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,661 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-11-21 22:18:41,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 22:18:41,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 22:18:41,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 22:18:41,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 22:18:41,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,724 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-21 22:18:41,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 22:18:41,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 22:18:41,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 22:18:41,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 22:18:41,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (1/1) ... [2024-11-21 22:18:41,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:18:41,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:18:41,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 22:18:41,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 22:18:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 22:18:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 22:18:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 22:18:41,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 22:18:41,914 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 22:18:41,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 22:18:42,858 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-21 22:18:42,859 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 22:18:42,878 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 22:18:42,878 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 22:18:42,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:18:42 BoogieIcfgContainer [2024-11-21 22:18:42,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 22:18:42,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 22:18:42,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 22:18:42,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 22:18:42,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:18:41" (1/3) ... [2024-11-21 22:18:42,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abd380f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:18:42, skipping insertion in model container [2024-11-21 22:18:42,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:41" (2/3) ... [2024-11-21 22:18:42,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4abd380f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:18:42, skipping insertion in model container [2024-11-21 22:18:42,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:18:42" (3/3) ... [2024-11-21 22:18:42,886 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label19.c [2024-11-21 22:18:42,899 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 22:18:42,899 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 22:18:42,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 22:18:42,957 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;@78e7da45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 22:18:42,958 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 22:18:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 0 states have call successors, (0), 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-11-21 22:18:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-21 22:18:42,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:18:42,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:42,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:18:42,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:18:42,976 INFO L85 PathProgramCache]: Analyzing trace with hash 531730986, now seen corresponding path program 1 times [2024-11-21 22:18:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:18:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202084669] [2024-11-21 22:18:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:42,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:18:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:18:43,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:18:43,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202084669] [2024-11-21 22:18:43,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202084669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:18:43,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:18:43,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:18:43,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949146723] [2024-11-21 22:18:43,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:18:43,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:18:43,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:18:43,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:18:43,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:18:43,493 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 0 states have call successors, (0), 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 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-11-21 22:18:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:18:44,821 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2024-11-21 22:18:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:18:44,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-21 22:18:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:18:44,833 INFO L225 Difference]: With dead ends: 850 [2024-11-21 22:18:44,833 INFO L226 Difference]: Without dead ends: 538 [2024-11-21 22:18:44,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 22:18:44,838 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 465 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-21 22:18:44,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 194 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-21 22:18:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-21 22:18:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2024-11-21 22:18:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.4487895716945995) internal successors, (778), 537 states have internal predecessors, (778), 0 states have call successors, (0), 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-11-21 22:18:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2024-11-21 22:18:44,898 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 62 [2024-11-21 22:18:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:18:44,898 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2024-11-21 22:18:44,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-11-21 22:18:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2024-11-21 22:18:44,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-21 22:18:44,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:18:44,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:44,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 22:18:44,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:18:44,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:18:44,905 INFO L85 PathProgramCache]: Analyzing trace with hash -56024554, now seen corresponding path program 1 times [2024-11-21 22:18:44,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:18:44,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022080208] [2024-11-21 22:18:44,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:44,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:18:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:18:45,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:18:45,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022080208] [2024-11-21 22:18:45,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022080208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:18:45,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:18:45,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:18:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344917206] [2024-11-21 22:18:45,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:18:45,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:18:45,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:18:45,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:18:45,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:18:45,155 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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-11-21 22:18:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:18:45,825 INFO L93 Difference]: Finished difference Result 1283 states and 1979 transitions. [2024-11-21 22:18:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:18:45,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2024-11-21 22:18:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:18:45,828 INFO L225 Difference]: With dead ends: 1283 [2024-11-21 22:18:45,828 INFO L226 Difference]: Without dead ends: 896 [2024-11-21 22:18:45,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:18:45,830 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 118 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:18:45,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 121 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:18:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-11-21 22:18:45,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 894. [2024-11-21 22:18:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.1836506159014557) internal successors, (1057), 893 states have internal predecessors, (1057), 0 states have call successors, (0), 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-11-21 22:18:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1057 transitions. [2024-11-21 22:18:45,859 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1057 transitions. Word has length 142 [2024-11-21 22:18:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:18:45,859 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1057 transitions. [2024-11-21 22:18:45,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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-11-21 22:18:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1057 transitions. [2024-11-21 22:18:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-21 22:18:45,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:18:45,867 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:45,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 22:18:45,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:18:45,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:18:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1675654197, now seen corresponding path program 1 times [2024-11-21 22:18:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:18:45,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170828710] [2024-11-21 22:18:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:45,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:18:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:18:46,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:18:46,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170828710] [2024-11-21 22:18:46,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170828710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:18:46,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700956290] [2024-11-21 22:18:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:46,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:18:46,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:18:46,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:18:46,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-21 22:18:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:46,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:18:46,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:18:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-21 22:18:46,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:18:46,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700956290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:18:46,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:18:46,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-21 22:18:46,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276480262] [2024-11-21 22:18:46,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:18:46,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:18:46,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:18:46,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:18:46,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-21 22:18:46,619 INFO L87 Difference]: Start difference. First operand 894 states and 1057 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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-11-21 22:18:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:18:47,055 INFO L93 Difference]: Finished difference Result 1964 states and 2439 transitions. [2024-11-21 22:18:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:18:47,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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 233 [2024-11-21 22:18:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:18:47,060 INFO L225 Difference]: With dead ends: 1964 [2024-11-21 22:18:47,060 INFO L226 Difference]: Without dead ends: 1250 [2024-11-21 22:18:47,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-21 22:18:47,063 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:18:47,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 47 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:18:47,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-21 22:18:47,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2024-11-21 22:18:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.188150520416333) internal successors, (1484), 1249 states have internal predecessors, (1484), 0 states have call successors, (0), 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-11-21 22:18:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1484 transitions. [2024-11-21 22:18:47,083 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1484 transitions. Word has length 233 [2024-11-21 22:18:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:18:47,084 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1484 transitions. [2024-11-21 22:18:47,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 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-11-21 22:18:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1484 transitions. [2024-11-21 22:18:47,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-21 22:18:47,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:18:47,087 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:47,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-21 22:18:47,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:18:47,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:18:47,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:18:47,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1903372100, now seen corresponding path program 1 times [2024-11-21 22:18:47,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:18:47,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201789285] [2024-11-21 22:18:47,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:47,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:18:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:18:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:18:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201789285] [2024-11-21 22:18:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201789285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:18:47,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:18:47,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:18:47,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604213189] [2024-11-21 22:18:47,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:18:47,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:18:47,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:18:47,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:18:47,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:18:47,517 INFO L87 Difference]: Start difference. First operand 1250 states and 1484 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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-11-21 22:18:47,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:18:47,950 INFO L93 Difference]: Finished difference Result 2854 states and 3434 transitions. [2024-11-21 22:18:47,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:18:47,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2024-11-21 22:18:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:18:47,956 INFO L225 Difference]: With dead ends: 2854 [2024-11-21 22:18:47,956 INFO L226 Difference]: Without dead ends: 1784 [2024-11-21 22:18:47,959 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-11-21 22:18:47,961 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:18:47,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:18:47,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2024-11-21 22:18:47,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784. [2024-11-21 22:18:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1542344363432417) internal successors, (2058), 1783 states have internal predecessors, (2058), 0 states have call successors, (0), 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-11-21 22:18:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2058 transitions. [2024-11-21 22:18:47,990 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2058 transitions. Word has length 236 [2024-11-21 22:18:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:18:47,991 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2058 transitions. [2024-11-21 22:18:47,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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-11-21 22:18:47,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2058 transitions. [2024-11-21 22:18:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-11-21 22:18:47,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:18:47,994 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:47,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 22:18:47,996 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:18:47,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:18:47,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1408732317, now seen corresponding path program 1 times [2024-11-21 22:18:47,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:18:47,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504401649] [2024-11-21 22:18:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:47,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:18:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-11-21 22:18:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:18:48,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504401649] [2024-11-21 22:18:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504401649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:18:48,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:18:48,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:18:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922755619] [2024-11-21 22:18:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:18:48,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:18:48,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:18:48,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:18:48,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:18:48,332 INFO L87 Difference]: Start difference. First operand 1784 states and 2058 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-11-21 22:18:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:18:48,832 INFO L93 Difference]: Finished difference Result 3417 states and 4000 transitions. [2024-11-21 22:18:48,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:18:48,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 353 [2024-11-21 22:18:48,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:18:48,838 INFO L225 Difference]: With dead ends: 3417 [2024-11-21 22:18:48,839 INFO L226 Difference]: Without dead ends: 1962 [2024-11-21 22:18:48,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:18:48,842 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:18:48,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:18:48,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-21 22:18:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2024-11-21 22:18:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1099270891755468) internal successors, (1979), 1783 states have internal predecessors, (1979), 0 states have call successors, (0), 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-11-21 22:18:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1979 transitions. [2024-11-21 22:18:48,871 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1979 transitions. Word has length 353 [2024-11-21 22:18:48,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:18:48,872 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 1979 transitions. [2024-11-21 22:18:48,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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-11-21 22:18:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1979 transitions. [2024-11-21 22:18:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2024-11-21 22:18:48,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:18:48,904 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:48,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 22:18:48,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:18:48,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:18:48,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1006014571, now seen corresponding path program 1 times [2024-11-21 22:18:48,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:18:48,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986377284] [2024-11-21 22:18:48,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:18:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2024-11-21 22:18:49,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:18:49,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986377284] [2024-11-21 22:18:49,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986377284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:18:49,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55880892] [2024-11-21 22:18:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:49,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:18:49,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:18:49,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:18:49,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 22:18:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:49,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:18:49,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:18:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-11-21 22:18:49,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:18:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55880892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:18:49,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:18:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-21 22:18:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241510733] [2024-11-21 22:18:49,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:18:49,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:18:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:18:49,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:18:49,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 22:18:49,820 INFO L87 Difference]: Start difference. First operand 1784 states and 1979 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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-11-21 22:18:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:18:50,182 INFO L93 Difference]: Finished difference Result 2498 states and 2748 transitions. [2024-11-21 22:18:50,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:18:50,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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 442 [2024-11-21 22:18:50,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:18:50,189 INFO L225 Difference]: With dead ends: 2498 [2024-11-21 22:18:50,189 INFO L226 Difference]: Without dead ends: 2496 [2024-11-21 22:18:50,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 22:18:50,190 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:18:50,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 11 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 22:18:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2024-11-21 22:18:50,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1606. [2024-11-21 22:18:50,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.0859813084112149) internal successors, (1743), 1605 states have internal predecessors, (1743), 0 states have call successors, (0), 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-11-21 22:18:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1743 transitions. [2024-11-21 22:18:50,215 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1743 transitions. Word has length 442 [2024-11-21 22:18:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:18:50,216 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1743 transitions. [2024-11-21 22:18:50,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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-11-21 22:18:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1743 transitions. [2024-11-21 22:18:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2024-11-21 22:18:50,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:18:50,220 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:50,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-21 22:18:50,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-21 22:18:50,424 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:18:50,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:18:50,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1492890716, now seen corresponding path program 1 times [2024-11-21 22:18:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:18:50,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578294052] [2024-11-21 22:18:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:18:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-21 22:18:50,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:18:50,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578294052] [2024-11-21 22:18:50,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578294052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:18:50,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:18:50,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:18:50,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565125614] [2024-11-21 22:18:50,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:18:50,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:18:50,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:18:50,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:18:50,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:18:50,744 INFO L87 Difference]: Start difference. First operand 1606 states and 1743 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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-11-21 22:18:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:18:51,177 INFO L93 Difference]: Finished difference Result 3566 states and 3923 transitions. [2024-11-21 22:18:51,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:18:51,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 448 [2024-11-21 22:18:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:18:51,184 INFO L225 Difference]: With dead ends: 3566 [2024-11-21 22:18:51,185 INFO L226 Difference]: Without dead ends: 2140 [2024-11-21 22:18:51,187 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-11-21 22:18:51,188 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:18:51,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 245 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:18:51,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2024-11-21 22:18:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1784. [2024-11-21 22:18:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.0779584969153113) internal successors, (1922), 1783 states have internal predecessors, (1922), 0 states have call successors, (0), 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-11-21 22:18:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1922 transitions. [2024-11-21 22:18:51,212 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1922 transitions. Word has length 448 [2024-11-21 22:18:51,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:18:51,213 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 1922 transitions. [2024-11-21 22:18:51,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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-11-21 22:18:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1922 transitions. [2024-11-21 22:18:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-21 22:18:51,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:18:51,218 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:51,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 22:18:51,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:18:51,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:18:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2114704159, now seen corresponding path program 1 times [2024-11-21 22:18:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:18:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830204395] [2024-11-21 22:18:51,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:18:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-21 22:18:51,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:18:51,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830204395] [2024-11-21 22:18:51,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830204395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:18:51,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:18:51,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:18:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877266806] [2024-11-21 22:18:51,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:18:51,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:18:51,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:18:51,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:18:51,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:18:51,546 INFO L87 Difference]: Start difference. First operand 1784 states and 1922 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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-11-21 22:18:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:18:51,963 INFO L93 Difference]: Finished difference Result 4100 states and 4485 transitions. [2024-11-21 22:18:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:18:51,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 455 [2024-11-21 22:18:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:18:51,970 INFO L225 Difference]: With dead ends: 4100 [2024-11-21 22:18:51,970 INFO L226 Difference]: Without dead ends: 2496 [2024-11-21 22:18:51,971 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-11-21 22:18:51,973 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 112 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:18:51,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 203 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:18:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2024-11-21 22:18:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2318. [2024-11-21 22:18:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.0845921450151057) internal successors, (2513), 2317 states have internal predecessors, (2513), 0 states have call successors, (0), 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-11-21 22:18:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2513 transitions. [2024-11-21 22:18:52,003 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2513 transitions. Word has length 455 [2024-11-21 22:18:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:18:52,003 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2513 transitions. [2024-11-21 22:18:52,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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-11-21 22:18:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2513 transitions. [2024-11-21 22:18:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2024-11-21 22:18:52,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:18:52,007 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:52,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 22:18:52,007 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:18:52,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:18:52,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1878960350, now seen corresponding path program 1 times [2024-11-21 22:18:52,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:18:52,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190424754] [2024-11-21 22:18:52,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:52,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:18:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-21 22:18:52,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:18:52,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190424754] [2024-11-21 22:18:52,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190424754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:18:52,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:18:52,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:18:52,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147421358] [2024-11-21 22:18:52,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:18:52,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:18:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:18:52,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:18:52,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:18:52,283 INFO L87 Difference]: Start difference. First operand 2318 states and 2513 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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-11-21 22:18:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:18:52,772 INFO L93 Difference]: Finished difference Result 5524 states and 6078 transitions. [2024-11-21 22:18:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:18:52,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 496 [2024-11-21 22:18:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:18:52,780 INFO L225 Difference]: With dead ends: 5524 [2024-11-21 22:18:52,781 INFO L226 Difference]: Without dead ends: 3386 [2024-11-21 22:18:52,783 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-11-21 22:18:52,784 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:18:52,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:18:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2024-11-21 22:18:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3386. [2024-11-21 22:18:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.0800590841949778) internal successors, (3656), 3385 states have internal predecessors, (3656), 0 states have call successors, (0), 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-11-21 22:18:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3656 transitions. [2024-11-21 22:18:52,839 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3656 transitions. Word has length 496 [2024-11-21 22:18:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:18:52,839 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3656 transitions. [2024-11-21 22:18:52,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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-11-21 22:18:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3656 transitions. [2024-11-21 22:18:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2024-11-21 22:18:52,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:18:52,843 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:52,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 22:18:52,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:18:52,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:18:52,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1528926837, now seen corresponding path program 1 times [2024-11-21 22:18:52,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:18:52,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068754867] [2024-11-21 22:18:52,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:52,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:18:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1118 backedges. 735 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2024-11-21 22:18:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:18:53,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068754867] [2024-11-21 22:18:53,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068754867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:18:53,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:18:53,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:18:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956265351] [2024-11-21 22:18:53,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:18:53,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:18:53,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:18:53,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:18:53,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:18:53,229 INFO L87 Difference]: Start difference. First operand 3386 states and 3656 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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-11-21 22:18:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:18:53,677 INFO L93 Difference]: Finished difference Result 6770 states and 7325 transitions. [2024-11-21 22:18:53,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:18:53,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 532 [2024-11-21 22:18:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:18:53,687 INFO L225 Difference]: With dead ends: 6770 [2024-11-21 22:18:53,687 INFO L226 Difference]: Without dead ends: 3564 [2024-11-21 22:18:53,690 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-11-21 22:18:53,691 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 102 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 22:18:53,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 243 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 22:18:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2024-11-21 22:18:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3208. [2024-11-21 22:18:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.076707202993452) internal successors, (3453), 3207 states have internal predecessors, (3453), 0 states have call successors, (0), 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-11-21 22:18:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3453 transitions. [2024-11-21 22:18:53,730 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3453 transitions. Word has length 532 [2024-11-21 22:18:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:18:53,731 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3453 transitions. [2024-11-21 22:18:53,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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-11-21 22:18:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3453 transitions. [2024-11-21 22:18:53,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2024-11-21 22:18:53,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:18:53,735 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:53,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 22:18:53,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:18:53,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:18:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1267287561, now seen corresponding path program 1 times [2024-11-21 22:18:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:18:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225333977] [2024-11-21 22:18:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:18:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1366 backedges. 942 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-21 22:18:54,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:18:54,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225333977] [2024-11-21 22:18:54,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225333977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:18:54,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948338339] [2024-11-21 22:18:54,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:54,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:18:54,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:18:54,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:18:54,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-21 22:18:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:54,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:18:54,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:18:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1366 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-11-21 22:18:54,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:18:54,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948338339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:18:54,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:18:54,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-21 22:18:54,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324090411] [2024-11-21 22:18:54,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:18:54,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:18:54,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:18:54,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:18:54,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 22:18:54,262 INFO L87 Difference]: Start difference. First operand 3208 states and 3453 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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-11-21 22:18:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:18:54,632 INFO L93 Difference]: Finished difference Result 6770 states and 7299 transitions. [2024-11-21 22:18:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:18:54,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 651 [2024-11-21 22:18:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:18:54,641 INFO L225 Difference]: With dead ends: 6770 [2024-11-21 22:18:54,641 INFO L226 Difference]: Without dead ends: 3030 [2024-11-21 22:18:54,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 22:18:54,644 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 119 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:18:54,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 241 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 22:18:54,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2024-11-21 22:18:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2674. [2024-11-21 22:18:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.0695847362514028) internal successors, (2859), 2673 states have internal predecessors, (2859), 0 states have call successors, (0), 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-11-21 22:18:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2859 transitions. [2024-11-21 22:18:54,675 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2859 transitions. Word has length 651 [2024-11-21 22:18:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:18:54,676 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2859 transitions. [2024-11-21 22:18:54,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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-11-21 22:18:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2859 transitions. [2024-11-21 22:18:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2024-11-21 22:18:54,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:18:54,681 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:54,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-21 22:18:54,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:18:54,882 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:18:54,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:18:54,883 INFO L85 PathProgramCache]: Analyzing trace with hash -78197845, now seen corresponding path program 1 times [2024-11-21 22:18:54,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:18:54,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626142591] [2024-11-21 22:18:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:54,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:18:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 1429 proven. 155 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2024-11-21 22:18:55,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:18:55,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626142591] [2024-11-21 22:18:55,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626142591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:18:55,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294984479] [2024-11-21 22:18:55,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:18:55,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:18:55,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:18:55,372 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:18:55,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-21 22:18:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:18:55,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:18:55,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:18:55,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 1599 trivial. 0 not checked. [2024-11-21 22:18:55,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:18:55,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294984479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:18:55,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:18:55,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-21 22:18:55,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779231254] [2024-11-21 22:18:55,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:18:55,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:18:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:18:55,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:18:55,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 22:18:55,647 INFO L87 Difference]: Start difference. First operand 2674 states and 2859 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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-11-21 22:18:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:18:55,986 INFO L93 Difference]: Finished difference Result 3030 states and 3231 transitions. [2024-11-21 22:18:55,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:18:55,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 813 [2024-11-21 22:18:55,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:18:55,988 INFO L225 Difference]: With dead ends: 3030 [2024-11-21 22:18:55,988 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 22:18:55,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 22:18:55,990 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 140 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:18:55,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 13 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 22:18:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 22:18:55,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 22:18:55,991 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-11-21 22:18:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 22:18:55,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 813 [2024-11-21 22:18:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:18:55,991 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 22:18:55,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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-11-21 22:18:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 22:18:55,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 22:18:55,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 22:18:56,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-21 22:18:56,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:18:56,197 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:18:56,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 22:18:56,446 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 22:18:56,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:18:56 BoogieIcfgContainer [2024-11-21 22:18:56,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 22:18:56,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 22:18:56,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 22:18:56,465 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 22:18:56,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:18:42" (3/4) ... [2024-11-21 22:18:56,468 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 22:18:56,480 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 22:18:56,481 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 22:18:56,482 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 22:18:56,483 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 22:18:56,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 22:18:56,611 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 22:18:56,611 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 22:18:56,611 INFO L158 Benchmark]: Toolchain (without parser) took 15538.57ms. Allocated memory was 176.2MB in the beginning and 612.4MB in the end (delta: 436.2MB). Free memory was 116.7MB in the beginning and 225.2MB in the end (delta: -108.5MB). Peak memory consumption was 329.7MB. Max. memory is 16.1GB. [2024-11-21 22:18:56,611 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 22:18:56,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.12ms. Allocated memory is still 176.2MB. Free memory was 116.6MB in the beginning and 81.5MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-21 22:18:56,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.37ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 81.5MB in the beginning and 211.9MB in the end (delta: -130.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-11-21 22:18:56,612 INFO L158 Benchmark]: Boogie Preprocessor took 129.83ms. Allocated memory is still 247.5MB. Free memory was 211.9MB in the beginning and 198.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 22:18:56,612 INFO L158 Benchmark]: RCFGBuilder took 1085.58ms. Allocated memory is still 247.5MB. Free memory was 198.5MB in the beginning and 82.1MB in the end (delta: 116.4MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. [2024-11-21 22:18:56,612 INFO L158 Benchmark]: TraceAbstraction took 13584.19ms. Allocated memory was 247.5MB in the beginning and 612.4MB in the end (delta: 364.9MB). Free memory was 81.0MB in the beginning and 238.8MB in the end (delta: -157.8MB). Peak memory consumption was 208.1MB. Max. memory is 16.1GB. [2024-11-21 22:18:56,612 INFO L158 Benchmark]: Witness Printer took 145.40ms. Allocated memory is still 612.4MB. Free memory was 238.8MB in the beginning and 225.2MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 22:18:56,616 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.16ms. Allocated memory is still 176.2MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.12ms. Allocated memory is still 176.2MB. Free memory was 116.6MB in the beginning and 81.5MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.37ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 81.5MB in the beginning and 211.9MB in the end (delta: -130.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.83ms. Allocated memory is still 247.5MB. Free memory was 211.9MB in the beginning and 198.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1085.58ms. Allocated memory is still 247.5MB. Free memory was 198.5MB in the beginning and 82.1MB in the end (delta: 116.4MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13584.19ms. Allocated memory was 247.5MB in the beginning and 612.4MB in the end (delta: 364.9MB). Free memory was 81.0MB in the beginning and 238.8MB in the end (delta: -157.8MB). Peak memory consumption was 208.1MB. Max. memory is 16.1GB. * Witness Printer took 145.40ms. Allocated memory is still 612.4MB. Free memory was 238.8MB in the beginning and 225.2MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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: 200]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 12, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1586 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1586 mSDsluCounter, 1462 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 959 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6490 IncrementalHoareTripleChecker+Invalid, 7449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 959 mSolverCounterUnsat, 1388 mSDtfsCounter, 6490 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2175 GetRequests, 2150 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3386occurred in iteration=9, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 2316 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 7002 NumberOfCodeBlocks, 7002 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 6986 ConstructedInterpolants, 0 QuantifiedInterpolants, 17920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2690 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 11698/12199 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: 890]: Loop Invariant Derived loop invariant: ((((((((a21 <= 9) && (a15 <= 8)) && (0 <= ((long long) a12 + 42))) || (a15 < 6)) || ((a24 == 1) && (8 <= a15))) || ((7 <= a15) && ((((a24 == 1) && (a15 <= 8)) && (a21 != 6)) || (a15 == 8)))) || (((7 <= a15) && (a24 == 1)) && (((long long) 49 + a12) <= 0))) || ((a12 <= 11) && ((((a24 == 1) && (a15 <= 8)) && (a21 != 6)) || (a15 == 8)))) RESULT: Ultimate proved your program to be correct! [2024-11-21 22:18:56,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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