./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/Problem02_label04.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 dfc7a2daf16de8ab0ea0e11c62b30033c40981748d5071b1cd9dbc5bcc0c3347 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:27:32,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:27:32,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:27:32,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:27:32,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:27:32,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:27:32,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:27:32,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:27:32,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:27:32,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:27:32,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:27:32,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:27:32,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:27:32,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:27:32,138 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:27:32,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:27:32,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:27:32,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:27:32,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:27:32,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:27:32,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:27:32,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:27:32,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:27:32,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:27:32,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:27:32,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:27:32,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:27:32,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:27:32,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:27:32,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:27:32,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:27:32,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:27:32,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:27:32,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:27:32,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:27:32,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:27:32,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:27:32,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:27:32,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:27:32,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:27:32,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:27:32,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:27:32,146 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 -> dfc7a2daf16de8ab0ea0e11c62b30033c40981748d5071b1cd9dbc5bcc0c3347 [2024-11-08 10:27:32,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:27:32,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:27:32,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:27:32,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:27:32,391 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:27:32,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label04.c [2024-11-08 10:27:33,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:27:33,945 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:27:33,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label04.c [2024-11-08 10:27:33,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4367756c9/71146e849aa24e09bf8c6b9a1a2dddb3/FLAG536b01111 [2024-11-08 10:27:34,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4367756c9/71146e849aa24e09bf8c6b9a1a2dddb3 [2024-11-08 10:27:34,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:27:34,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:27:34,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:27:34,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:27:34,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:27:34,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d1541b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34, skipping insertion in model container [2024-11-08 10:27:34,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:27:34,693 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/Problem02_label04.c[17470,17483] [2024-11-08 10:27:34,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:27:34,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:27:34,779 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/Problem02_label04.c[17470,17483] [2024-11-08 10:27:34,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:27:34,804 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:27:34,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34 WrapperNode [2024-11-08 10:27:34,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:27:34,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:27:34,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:27:34,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:27:34,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,888 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-08 10:27:34,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:27:34,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:27:34,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:27:34,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:27:34,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,924 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-08 10:27:34,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:27:34,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:27:34,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:27:34,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:27:34,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (1/1) ... [2024-11-08 10:27:34,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:27:34,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:27:34,993 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-08 10:27:34,995 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-08 10:27:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:27:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:27:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:27:35,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:27:35,079 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:27:35,081 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:27:35,803 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 10:27:35,803 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:27:35,822 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:27:35,824 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:27:35,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:35 BoogieIcfgContainer [2024-11-08 10:27:35,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:27:35,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:27:35,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:27:35,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:27:35,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:27:34" (1/3) ... [2024-11-08 10:27:35,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a1fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:35, skipping insertion in model container [2024-11-08 10:27:35,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:34" (2/3) ... [2024-11-08 10:27:35,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a1fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:35, skipping insertion in model container [2024-11-08 10:27:35,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:35" (3/3) ... [2024-11-08 10:27:35,833 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label04.c [2024-11-08 10:27:35,846 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:27:35,846 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:27:35,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:27:35,910 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;@7868efa2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:27:35,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:27:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 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-08 10:27:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 10:27:35,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:35,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:35,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:35,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash 585738029, now seen corresponding path program 1 times [2024-11-08 10:27:35,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:35,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271877487] [2024-11-08 10:27:35,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:35,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:36,425 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-08 10:27:36,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:36,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271877487] [2024-11-08 10:27:36,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271877487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:36,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:36,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082321179] [2024-11-08 10:27:36,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:36,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:36,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:36,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:36,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:36,462 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-08 10:27:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:37,042 INFO L93 Difference]: Finished difference Result 600 states and 1037 transitions. [2024-11-08 10:27:37,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:37,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-11-08 10:27:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:37,055 INFO L225 Difference]: With dead ends: 600 [2024-11-08 10:27:37,055 INFO L226 Difference]: Without dead ends: 309 [2024-11-08 10:27:37,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:37,062 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 60 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:37,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:27:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-08 10:27:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-08 10:27:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 0 states have call successors, (0), 0 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-08 10:27:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2024-11-08 10:27:37,113 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 106 [2024-11-08 10:27:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:37,114 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2024-11-08 10:27:37,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-08 10:27:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2024-11-08 10:27:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 10:27:37,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:37,119 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:37,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:27:37,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:37,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:37,121 INFO L85 PathProgramCache]: Analyzing trace with hash 318496888, now seen corresponding path program 1 times [2024-11-08 10:27:37,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:37,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874741653] [2024-11-08 10:27:37,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:37,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:37,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:37,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874741653] [2024-11-08 10:27:37,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874741653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:37,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:37,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:37,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971943382] [2024-11-08 10:27:37,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:37,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:37,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:37,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:37,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:37,265 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-08 10:27:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:37,634 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2024-11-08 10:27:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:37,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-08 10:27:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:37,637 INFO L225 Difference]: With dead ends: 758 [2024-11-08 10:27:37,637 INFO L226 Difference]: Without dead ends: 453 [2024-11-08 10:27:37,638 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-08 10:27:37,639 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 58 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:37,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 248 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:37,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-08 10:27:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2024-11-08 10:27:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 0 states have call successors, (0), 0 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-08 10:27:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions. [2024-11-08 10:27:37,655 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 111 [2024-11-08 10:27:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:37,655 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 578 transitions. [2024-11-08 10:27:37,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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-08 10:27:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2024-11-08 10:27:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 10:27:37,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:37,658 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:37,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:27:37,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:37,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:37,659 INFO L85 PathProgramCache]: Analyzing trace with hash 924088573, now seen corresponding path program 1 times [2024-11-08 10:27:37,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:37,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116002260] [2024-11-08 10:27:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:37,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:37,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:37,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116002260] [2024-11-08 10:27:37,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116002260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:37,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:37,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:37,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313198410] [2024-11-08 10:27:37,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:37,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:37,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:37,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:37,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:37,728 INFO L87 Difference]: Start difference. First operand 453 states and 578 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-08 10:27:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:38,178 INFO L93 Difference]: Finished difference Result 1325 states and 1691 transitions. [2024-11-08 10:27:38,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:38,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-11-08 10:27:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:38,181 INFO L225 Difference]: With dead ends: 1325 [2024-11-08 10:27:38,182 INFO L226 Difference]: Without dead ends: 874 [2024-11-08 10:27:38,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:38,183 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 185 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:38,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:27:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-08 10:27:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-08 10:27:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.2302405498281788) internal successors, (1074), 873 states have internal predecessors, (1074), 0 states have call successors, (0), 0 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-08 10:27:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1074 transitions. [2024-11-08 10:27:38,216 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1074 transitions. Word has length 123 [2024-11-08 10:27:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:38,216 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1074 transitions. [2024-11-08 10:27:38,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-08 10:27:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1074 transitions. [2024-11-08 10:27:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 10:27:38,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:38,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:38,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:27:38,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:38,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:38,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1386859920, now seen corresponding path program 1 times [2024-11-08 10:27:38,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:38,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198908465] [2024-11-08 10:27:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:38,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198908465] [2024-11-08 10:27:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198908465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:38,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:38,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:38,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492801176] [2024-11-08 10:27:38,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:38,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:38,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:38,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:38,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:38,395 INFO L87 Difference]: Start difference. First operand 874 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-08 10:27:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:38,750 INFO L93 Difference]: Finished difference Result 2594 states and 3192 transitions. [2024-11-08 10:27:38,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:38,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-08 10:27:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:38,755 INFO L225 Difference]: With dead ends: 2594 [2024-11-08 10:27:38,755 INFO L226 Difference]: Without dead ends: 1722 [2024-11-08 10:27:38,756 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-08 10:27:38,757 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 57 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:38,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 290 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:38,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2024-11-08 10:27:38,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1716. [2024-11-08 10:27:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1715 states have (on average 1.1900874635568512) internal successors, (2041), 1715 states have internal predecessors, (2041), 0 states have call successors, (0), 0 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-08 10:27:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2041 transitions. [2024-11-08 10:27:38,780 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2041 transitions. Word has length 136 [2024-11-08 10:27:38,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:38,780 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2041 transitions. [2024-11-08 10:27:38,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-08 10:27:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2041 transitions. [2024-11-08 10:27:38,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 10:27:38,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:38,783 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:38,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:27:38,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:38,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:38,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1212192576, now seen corresponding path program 1 times [2024-11-08 10:27:38,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:38,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933602725] [2024-11-08 10:27:38,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:38,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:27:38,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:38,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933602725] [2024-11-08 10:27:38,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933602725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:38,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:38,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:38,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156447326] [2024-11-08 10:27:38,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:38,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:38,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:38,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:38,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:38,911 INFO L87 Difference]: Start difference. First operand 1716 states and 2041 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 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-08 10:27:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:39,244 INFO L93 Difference]: Finished difference Result 3852 states and 4554 transitions. [2024-11-08 10:27:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 152 [2024-11-08 10:27:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:39,253 INFO L225 Difference]: With dead ends: 3852 [2024-11-08 10:27:39,254 INFO L226 Difference]: Without dead ends: 1856 [2024-11-08 10:27:39,255 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-08 10:27:39,260 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 158 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:39,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 66 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2024-11-08 10:27:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1854. [2024-11-08 10:27:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.119805720453319) internal successors, (2075), 1853 states have internal predecessors, (2075), 0 states have call successors, (0), 0 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-08 10:27:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2075 transitions. [2024-11-08 10:27:39,318 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2075 transitions. Word has length 152 [2024-11-08 10:27:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:39,319 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2075 transitions. [2024-11-08 10:27:39,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 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-08 10:27:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2075 transitions. [2024-11-08 10:27:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 10:27:39,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:39,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:39,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:27:39,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:39,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash -145608568, now seen corresponding path program 1 times [2024-11-08 10:27:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:39,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708167796] [2024-11-08 10:27:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:39,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:39,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708167796] [2024-11-08 10:27:39,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708167796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:39,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:39,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:39,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982913035] [2024-11-08 10:27:39,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:39,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:39,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:39,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:39,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:39,511 INFO L87 Difference]: Start difference. First operand 1854 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-08 10:27:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:39,883 INFO L93 Difference]: Finished difference Result 4404 states and 4920 transitions. [2024-11-08 10:27:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:39,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2024-11-08 10:27:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:39,890 INFO L225 Difference]: With dead ends: 4404 [2024-11-08 10:27:39,891 INFO L226 Difference]: Without dead ends: 2412 [2024-11-08 10:27:39,893 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-08 10:27:39,894 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:39,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 70 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:39,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2024-11-08 10:27:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2272. [2024-11-08 10:27:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.095112285336856) internal successors, (2487), 2271 states have internal predecessors, (2487), 0 states have call successors, (0), 0 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-08 10:27:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2487 transitions. [2024-11-08 10:27:39,932 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2487 transitions. Word has length 153 [2024-11-08 10:27:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:39,933 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 2487 transitions. [2024-11-08 10:27:39,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-08 10:27:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2487 transitions. [2024-11-08 10:27:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 10:27:39,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:39,937 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:39,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:27:39,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:39,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1045227919, now seen corresponding path program 1 times [2024-11-08 10:27:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:39,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914019426] [2024-11-08 10:27:39,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 10:27:40,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914019426] [2024-11-08 10:27:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914019426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:40,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:40,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034146818] [2024-11-08 10:27:40,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:40,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:40,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:40,042 INFO L87 Difference]: Start difference. First operand 2272 states and 2487 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 10:27:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:40,198 INFO L93 Difference]: Finished difference Result 4248 states and 4654 transitions. [2024-11-08 10:27:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:40,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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 165 [2024-11-08 10:27:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:40,203 INFO L225 Difference]: With dead ends: 4248 [2024-11-08 10:27:40,203 INFO L226 Difference]: Without dead ends: 1836 [2024-11-08 10:27:40,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:40,206 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 154 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:40,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 18 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:27:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-11-08 10:27:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1556. [2024-11-08 10:27:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1555 states have (on average 1.0771704180064308) internal successors, (1675), 1555 states have internal predecessors, (1675), 0 states have call successors, (0), 0 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-08 10:27:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1675 transitions. [2024-11-08 10:27:40,225 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1675 transitions. Word has length 165 [2024-11-08 10:27:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:40,225 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1675 transitions. [2024-11-08 10:27:40,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 10:27:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1675 transitions. [2024-11-08 10:27:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 10:27:40,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:40,227 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:40,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:27:40,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:40,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:40,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1306375099, now seen corresponding path program 1 times [2024-11-08 10:27:40,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:40,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37635304] [2024-11-08 10:27:40,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:40,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 10:27:40,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:40,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37635304] [2024-11-08 10:27:40,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37635304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:40,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:40,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:27:40,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435410861] [2024-11-08 10:27:40,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:40,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:27:40,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:40,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:27:40,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:27:40,484 INFO L87 Difference]: Start difference. First operand 1556 states and 1675 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:40,984 INFO L93 Difference]: Finished difference Result 3140 states and 3388 transitions. [2024-11-08 10:27:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:27:40,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2024-11-08 10:27:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:40,985 INFO L225 Difference]: With dead ends: 3140 [2024-11-08 10:27:40,985 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:27:40,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:27:40,987 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 172 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:40,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 62 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:27:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:27:40,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:27:40,988 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-08 10:27:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:27:40,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2024-11-08 10:27:40,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:40,989 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:27:40,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:40,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:27:40,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:27:40,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:27:40,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:27:40,994 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:40,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:27:41,117 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:27:41,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:27:41 BoogieIcfgContainer [2024-11-08 10:27:41,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:27:41,130 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:27:41,130 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:27:41,130 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:27:41,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:35" (3/4) ... [2024-11-08 10:27:41,132 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:27:41,143 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:27:41,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:27:41,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:27:41,145 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:27:41,236 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:27:41,239 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:27:41,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:27:41,240 INFO L158 Benchmark]: Toolchain (without parser) took 6914.90ms. Allocated memory was 167.8MB in the beginning and 316.7MB in the end (delta: 148.9MB). Free memory was 89.3MB in the beginning and 93.1MB in the end (delta: -3.8MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,240 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:27:41,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.57ms. Allocated memory is still 167.8MB. Free memory was 89.0MB in the beginning and 120.3MB in the end (delta: -31.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.49ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 115.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,241 INFO L158 Benchmark]: Boogie Preprocessor took 59.90ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 109.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,241 INFO L158 Benchmark]: RCFGBuilder took 874.94ms. Allocated memory was 167.8MB in the beginning and 249.6MB in the end (delta: 81.8MB). Free memory was 109.7MB in the beginning and 192.9MB in the end (delta: -83.2MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,241 INFO L158 Benchmark]: TraceAbstraction took 5302.91ms. Allocated memory was 249.6MB in the beginning and 316.7MB in the end (delta: 67.1MB). Free memory was 191.9MB in the beginning and 105.7MB in the end (delta: 86.2MB). Peak memory consumption was 155.4MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,241 INFO L158 Benchmark]: Witness Printer took 109.35ms. Allocated memory is still 316.7MB. Free memory was 105.7MB in the beginning and 93.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:27:41,242 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.18ms. Allocated memory is still 167.8MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.57ms. Allocated memory is still 167.8MB. Free memory was 89.0MB in the beginning and 120.3MB in the end (delta: -31.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.49ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 115.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.90ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 109.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 874.94ms. Allocated memory was 167.8MB in the beginning and 249.6MB in the end (delta: 81.8MB). Free memory was 109.7MB in the beginning and 192.9MB in the end (delta: -83.2MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5302.91ms. Allocated memory was 249.6MB in the beginning and 316.7MB in the end (delta: 67.1MB). Free memory was 191.9MB in the beginning and 105.7MB in the end (delta: 86.2MB). Peak memory consumption was 155.4MB. Max. memory is 16.1GB. * Witness Printer took 109.35ms. Allocated memory is still 316.7MB. Free memory was 105.7MB in the beginning and 93.1MB in the end (delta: 12.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: 500]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 918 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 918 mSDsluCounter, 1004 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 576 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3079 IncrementalHoareTripleChecker+Invalid, 3655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 576 mSolverCounterUnsat, 883 mSDtfsCounter, 3079 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2272occurred in iteration=6, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 430 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1126 NumberOfCodeBlocks, 1126 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1118 ConstructedInterpolants, 0 QuantifiedInterpolants, 4218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 329/329 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: 616]: Loop Invariant Derived loop invariant: (((((((((a28 == 10) && (a17 <= 8)) || (((a17 <= 8) && (a28 <= 10)) && (a11 != 1))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || ((a28 == 10) && (a19 == 1))) || ((a17 <= 8) && (a28 <= 7))) || (((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (((a25 == 1) && (a17 <= 8)) && (a28 <= 10))) || ((((a25 == 1) && (a19 == 1)) && (a11 != 1)) && (a28 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:27:41,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE