./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label32.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 dfcc0c3466e0ad99a1193d0083cedd3fc450234fcd184acb12bef00501b42460 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:16:41,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:16:41,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:16:41,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:16:41,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:16:41,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:16:41,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:16:41,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:16:41,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:16:41,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:16:41,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:16:41,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:16:41,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:16:41,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:16:41,729 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:16:41,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:16:41,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:16:41,730 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:16:41,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:16:41,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:16:41,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:16:41,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:16:41,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:16:41,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:16:41,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:16:41,732 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:16:41,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:16:41,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:16:41,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:16:41,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:16:41,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:16:41,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:16:41,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:16:41,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:16:41,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:16:41,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:16:41,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:16:41,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:16:41,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:16:41,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:16:41,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:16:41,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:16:41,736 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 -> dfcc0c3466e0ad99a1193d0083cedd3fc450234fcd184acb12bef00501b42460 [2024-10-12 15:16:41,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:16:41,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:16:41,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:16:41,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:16:41,936 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:16:41,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label32.c [2024-10-12 15:16:43,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:16:43,381 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:16:43,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label32.c [2024-10-12 15:16:43,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb4592b1/a1b36ca0b7504a63b198aead9e7d6731/FLAG55af0ab0a [2024-10-12 15:16:43,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb4592b1/a1b36ca0b7504a63b198aead9e7d6731 [2024-10-12 15:16:43,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:16:43,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:16:43,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:16:43,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:16:43,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:16:43,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49cbf123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43, skipping insertion in model container [2024-10-12 15:16:43,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:16:43,686 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label32.c[17811,17824] [2024-10-12 15:16:43,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:16:43,723 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:16:43,795 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label32.c[17811,17824] [2024-10-12 15:16:43,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:16:43,830 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:16:43,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43 WrapperNode [2024-10-12 15:16:43,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:16:43,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:16:43,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:16:43,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:16:43,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,886 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-12 15:16:43,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:16:43,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:16:43,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:16:43,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:16:43,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,920 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:16:43,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:16:43,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:16:43,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:16:43,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:16:43,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (1/1) ... [2024-10-12 15:16:43,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:16:43,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:16:44,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:16:44,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:16:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:16:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:16:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:16:44,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:16:44,110 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:16:44,111 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:16:44,836 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-12 15:16:44,836 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:16:44,883 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:16:44,885 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:16:44,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:16:44 BoogieIcfgContainer [2024-10-12 15:16:44,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:16:44,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:16:44,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:16:44,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:16:44,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:16:43" (1/3) ... [2024-10-12 15:16:44,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382deeaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:16:44, skipping insertion in model container [2024-10-12 15:16:44,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:43" (2/3) ... [2024-10-12 15:16:44,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382deeaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:16:44, skipping insertion in model container [2024-10-12 15:16:44,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:16:44" (3/3) ... [2024-10-12 15:16:44,893 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label32.c [2024-10-12 15:16:44,904 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:16:44,905 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:16:44,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:16:44,965 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;@6ad14927, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:16:44,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:16:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 15:16:44,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:44,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:16:44,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:44,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:44,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1514540400, now seen corresponding path program 1 times [2024-10-12 15:16:44,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:44,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645050777] [2024-10-12 15:16:44,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:45,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:45,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645050777] [2024-10-12 15:16:45,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645050777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:45,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:45,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:45,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129111006] [2024-10-12 15:16:45,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:45,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:16:45,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:45,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:16:45,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:16:45,292 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:45,325 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2024-10-12 15:16:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:16:45,327 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-10-12 15:16:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:45,337 INFO L225 Difference]: With dead ends: 329 [2024-10-12 15:16:45,337 INFO L226 Difference]: Without dead ends: 163 [2024-10-12 15:16:45,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:16:45,343 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:45,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:16:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-12 15:16:45,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-12 15:16:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-12 15:16:45,372 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 108 [2024-10-12 15:16:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:45,373 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-12 15:16:45,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-12 15:16:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 15:16:45,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:45,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:16:45,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:16:45,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:45,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash -139886109, now seen corresponding path program 1 times [2024-10-12 15:16:45,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:45,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402627160] [2024-10-12 15:16:45,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:45,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:45,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:45,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402627160] [2024-10-12 15:16:45,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402627160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:45,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:45,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:45,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458183695] [2024-10-12 15:16:45,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:45,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:45,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:45,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:45,575 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:46,030 INFO L93 Difference]: Finished difference Result 470 states and 719 transitions. [2024-10-12 15:16:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:46,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-10-12 15:16:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:46,035 INFO L225 Difference]: With dead ends: 470 [2024-10-12 15:16:46,035 INFO L226 Difference]: Without dead ends: 308 [2024-10-12 15:16:46,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:46,039 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 41 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:46,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 116 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:16:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-12 15:16:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2024-10-12 15:16:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.3311475409836067) internal successors, (406), 305 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 406 transitions. [2024-10-12 15:16:46,067 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 406 transitions. Word has length 108 [2024-10-12 15:16:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:46,068 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 406 transitions. [2024-10-12 15:16:46,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 406 transitions. [2024-10-12 15:16:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 15:16:46,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:46,075 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:16:46,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:16:46,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:46,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:46,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1878123560, now seen corresponding path program 1 times [2024-10-12 15:16:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:46,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377799434] [2024-10-12 15:16:46,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:46,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:46,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377799434] [2024-10-12 15:16:46,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377799434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:46,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:46,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:16:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173536104] [2024-10-12 15:16:46,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:46,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:46,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:46,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:46,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:46,261 INFO L87 Difference]: Start difference. First operand 306 states and 406 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:46,660 INFO L93 Difference]: Finished difference Result 757 states and 1033 transitions. [2024-10-12 15:16:46,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:46,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-12 15:16:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:46,663 INFO L225 Difference]: With dead ends: 757 [2024-10-12 15:16:46,663 INFO L226 Difference]: Without dead ends: 452 [2024-10-12 15:16:46,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:46,664 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 55 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:46,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 245 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:16:46,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-12 15:16:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2024-10-12 15:16:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.2793791574279378) internal successors, (577), 451 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 577 transitions. [2024-10-12 15:16:46,688 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 577 transitions. Word has length 113 [2024-10-12 15:16:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:46,701 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 577 transitions. [2024-10-12 15:16:46,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 577 transitions. [2024-10-12 15:16:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 15:16:46,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:46,703 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, 1, 1] [2024-10-12 15:16:46,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:16:46,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:46,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash 477113731, now seen corresponding path program 1 times [2024-10-12 15:16:46,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:46,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988918034] [2024-10-12 15:16:46,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:46,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:46,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:46,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988918034] [2024-10-12 15:16:46,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988918034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:46,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:46,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:46,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733479502] [2024-10-12 15:16:46,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:46,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:46,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:46,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:46,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:46,764 INFO L87 Difference]: Start difference. First operand 452 states and 577 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:47,094 INFO L93 Difference]: Finished difference Result 1324 states and 1690 transitions. [2024-10-12 15:16:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:47,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-10-12 15:16:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:47,096 INFO L225 Difference]: With dead ends: 1324 [2024-10-12 15:16:47,097 INFO L226 Difference]: Without dead ends: 873 [2024-10-12 15:16:47,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:47,101 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 183 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:47,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 79 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:16:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-10-12 15:16:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-10-12 15:16:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.2293577981651376) internal successors, (1072), 872 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1072 transitions. [2024-10-12 15:16:47,115 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1072 transitions. Word has length 125 [2024-10-12 15:16:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:47,115 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1072 transitions. [2024-10-12 15:16:47,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1072 transitions. [2024-10-12 15:16:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-12 15:16:47,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:47,119 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, 1, 1] [2024-10-12 15:16:47,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:16:47,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:47,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:47,119 INFO L85 PathProgramCache]: Analyzing trace with hash -274999952, now seen corresponding path program 1 times [2024-10-12 15:16:47,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:47,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329008265] [2024-10-12 15:16:47,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:47,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 15:16:47,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:47,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329008265] [2024-10-12 15:16:47,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329008265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:47,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:47,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:16:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668486010] [2024-10-12 15:16:47,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:47,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:47,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:47,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:47,272 INFO L87 Difference]: Start difference. First operand 873 states and 1072 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:47,606 INFO L93 Difference]: Finished difference Result 2027 states and 2467 transitions. [2024-10-12 15:16:47,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:47,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 154 [2024-10-12 15:16:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:47,610 INFO L225 Difference]: With dead ends: 2027 [2024-10-12 15:16:47,611 INFO L226 Difference]: Without dead ends: 1013 [2024-10-12 15:16:47,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:47,615 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:47,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 64 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:16:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2024-10-12 15:16:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1011. [2024-10-12 15:16:47,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.1425742574257425) internal successors, (1154), 1010 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1154 transitions. [2024-10-12 15:16:47,633 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1154 transitions. Word has length 154 [2024-10-12 15:16:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:47,633 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1154 transitions. [2024-10-12 15:16:47,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1154 transitions. [2024-10-12 15:16:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-12 15:16:47,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:47,636 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2024-10-12 15:16:47,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:16:47,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:47,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:47,637 INFO L85 PathProgramCache]: Analyzing trace with hash -62419354, now seen corresponding path program 1 times [2024-10-12 15:16:47,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:47,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932933296] [2024-10-12 15:16:47,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:47,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 15:16:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:47,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932933296] [2024-10-12 15:16:47,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932933296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:47,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:47,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:16:47,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353922969] [2024-10-12 15:16:47,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:47,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:47,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:47,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:47,751 INFO L87 Difference]: Start difference. First operand 1011 states and 1154 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:48,073 INFO L93 Difference]: Finished difference Result 2869 states and 3281 transitions. [2024-10-12 15:16:48,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:48,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 158 [2024-10-12 15:16:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:48,080 INFO L225 Difference]: With dead ends: 2869 [2024-10-12 15:16:48,080 INFO L226 Difference]: Without dead ends: 1859 [2024-10-12 15:16:48,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:48,083 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 136 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:48,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 261 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:16:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2024-10-12 15:16:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1853. [2024-10-12 15:16:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1852 states have (on average 1.119330453563715) internal successors, (2073), 1852 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2073 transitions. [2024-10-12 15:16:48,117 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2073 transitions. Word has length 158 [2024-10-12 15:16:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:48,117 INFO L471 AbstractCegarLoop]: Abstraction has 1853 states and 2073 transitions. [2024-10-12 15:16:48,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2073 transitions. [2024-10-12 15:16:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 15:16:48,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:48,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:16:48,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:16:48,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:48,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:48,122 INFO L85 PathProgramCache]: Analyzing trace with hash 763397289, now seen corresponding path program 1 times [2024-10-12 15:16:48,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:48,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784678755] [2024-10-12 15:16:48,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:48,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:48,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784678755] [2024-10-12 15:16:48,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784678755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:48,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:48,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:48,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403096656] [2024-10-12 15:16:48,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:48,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:48,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:48,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:48,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:48,218 INFO L87 Difference]: Start difference. First operand 1853 states and 2073 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:48,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:48,385 INFO L93 Difference]: Finished difference Result 3410 states and 3823 transitions. [2024-10-12 15:16:48,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:48,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-10-12 15:16:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:48,389 INFO L225 Difference]: With dead ends: 3410 [2024-10-12 15:16:48,389 INFO L226 Difference]: Without dead ends: 1416 [2024-10-12 15:16:48,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:48,391 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:48,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 17 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:16:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2024-10-12 15:16:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1416. [2024-10-12 15:16:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.0742049469964665) internal successors, (1520), 1415 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1520 transitions. [2024-10-12 15:16:48,408 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1520 transitions. Word has length 162 [2024-10-12 15:16:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:48,408 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 1520 transitions. [2024-10-12 15:16:48,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1520 transitions. [2024-10-12 15:16:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-12 15:16:48,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:48,411 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:16:48,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:16:48,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:48,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash -194166854, now seen corresponding path program 1 times [2024-10-12 15:16:48,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515949273] [2024-10-12 15:16:48,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:48,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:48,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515949273] [2024-10-12 15:16:48,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515949273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:48,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:48,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:16:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140201320] [2024-10-12 15:16:48,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:48,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:48,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:48,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:48,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:48,499 INFO L87 Difference]: Start difference. First operand 1416 states and 1520 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:48,767 INFO L93 Difference]: Finished difference Result 3110 states and 3343 transitions. [2024-10-12 15:16:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:48,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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-10-12 15:16:48,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:48,773 INFO L225 Difference]: With dead ends: 3110 [2024-10-12 15:16:48,773 INFO L226 Difference]: Without dead ends: 1835 [2024-10-12 15:16:48,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:48,775 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 130 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:48,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 27 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:16:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2024-10-12 15:16:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1415. [2024-10-12 15:16:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1414 states have (on average 1.0735502121640736) internal successors, (1518), 1414 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1518 transitions. [2024-10-12 15:16:48,793 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1518 transitions. Word has length 180 [2024-10-12 15:16:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:48,794 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1518 transitions. [2024-10-12 15:16:48,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1518 transitions. [2024-10-12 15:16:48,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-12 15:16:48,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:48,796 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:16:48,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:16:48,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:48,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:48,797 INFO L85 PathProgramCache]: Analyzing trace with hash -300422788, now seen corresponding path program 1 times [2024-10-12 15:16:48,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:48,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482576655] [2024-10-12 15:16:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:48,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:16:48,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482576655] [2024-10-12 15:16:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482576655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:48,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:48,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:16:48,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693802335] [2024-10-12 15:16:48,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:48,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:48,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:48,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:48,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:48,913 INFO L87 Difference]: Start difference. First operand 1415 states and 1518 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:49,206 INFO L93 Difference]: Finished difference Result 2829 states and 3063 transitions. [2024-10-12 15:16:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:49,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 201 [2024-10-12 15:16:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:49,213 INFO L225 Difference]: With dead ends: 2829 [2024-10-12 15:16:49,213 INFO L226 Difference]: Without dead ends: 1275 [2024-10-12 15:16:49,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:49,216 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 80 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:49,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 203 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:16:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2024-10-12 15:16:49,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2024-10-12 15:16:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.0580847723704867) internal successors, (1348), 1274 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1348 transitions. [2024-10-12 15:16:49,233 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1348 transitions. Word has length 201 [2024-10-12 15:16:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:49,234 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1348 transitions. [2024-10-12 15:16:49,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1348 transitions. [2024-10-12 15:16:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-12 15:16:49,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:49,237 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:16:49,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:16:49,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:49,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash -25867059, now seen corresponding path program 1 times [2024-10-12 15:16:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:49,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201525873] [2024-10-12 15:16:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:49,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 15:16:49,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:49,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201525873] [2024-10-12 15:16:49,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201525873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:49,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:49,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:16:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560192125] [2024-10-12 15:16:49,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:49,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:49,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:49,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:49,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:49,350 INFO L87 Difference]: Start difference. First operand 1275 states and 1348 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:49,650 INFO L93 Difference]: Finished difference Result 2690 states and 2868 transitions. [2024-10-12 15:16:49,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:49,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-12 15:16:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:49,653 INFO L225 Difference]: With dead ends: 2690 [2024-10-12 15:16:49,653 INFO L226 Difference]: Without dead ends: 1271 [2024-10-12 15:16:49,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:49,655 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 121 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:49,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 179 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:16:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2024-10-12 15:16:49,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1271. [2024-10-12 15:16:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 1.0535433070866143) internal successors, (1338), 1270 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1338 transitions. [2024-10-12 15:16:49,673 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1338 transitions. Word has length 236 [2024-10-12 15:16:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:49,674 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1338 transitions. [2024-10-12 15:16:49,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1338 transitions. [2024-10-12 15:16:49,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-12 15:16:49,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:49,687 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 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] [2024-10-12 15:16:49,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:16:49,687 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:49,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:49,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1653861478, now seen corresponding path program 1 times [2024-10-12 15:16:49,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:49,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190532279] [2024-10-12 15:16:49,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:49,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-10-12 15:16:49,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:49,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190532279] [2024-10-12 15:16:49,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190532279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:49,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:49,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:49,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100249530] [2024-10-12 15:16:49,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:49,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:49,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:49,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:49,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:49,825 INFO L87 Difference]: Start difference. First operand 1271 states and 1338 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:49,959 INFO L93 Difference]: Finished difference Result 1271 states and 1338 transitions. [2024-10-12 15:16:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:49,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 245 [2024-10-12 15:16:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:49,960 INFO L225 Difference]: With dead ends: 1271 [2024-10-12 15:16:49,960 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:16:49,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:49,962 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:49,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 11 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:16:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:16:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:16:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:16:49,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 245 [2024-10-12 15:16:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:49,963 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:16:49,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:16:49,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:16:49,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:16:49,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:16:49,968 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:16:49,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:16:50,112 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:16:50,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:16:50 BoogieIcfgContainer [2024-10-12 15:16:50,131 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:16:50,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:16:50,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:16:50,131 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:16:50,132 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:16:44" (3/4) ... [2024-10-12 15:16:50,133 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:16:50,157 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:16:50,158 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:16:50,159 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:16:50,160 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:16:50,286 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:16:50,286 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:16:50,287 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:16:50,287 INFO L158 Benchmark]: Toolchain (without parser) took 6874.72ms. Allocated memory was 138.4MB in the beginning and 281.0MB in the end (delta: 142.6MB). Free memory was 84.1MB in the beginning and 232.7MB in the end (delta: -148.7MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2024-10-12 15:16:50,287 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:16:50,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.02ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 83.7MB in the beginning and 162.0MB in the end (delta: -78.3MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2024-10-12 15:16:50,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.77ms. Allocated memory is still 192.9MB. Free memory was 162.0MB in the beginning and 155.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 15:16:50,288 INFO L158 Benchmark]: Boogie Preprocessor took 87.93ms. Allocated memory is still 192.9MB. Free memory was 155.7MB in the beginning and 150.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 15:16:50,289 INFO L158 Benchmark]: RCFGBuilder took 910.01ms. Allocated memory is still 192.9MB. Free memory was 150.5MB in the beginning and 62.4MB in the end (delta: 88.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-10-12 15:16:50,289 INFO L158 Benchmark]: TraceAbstraction took 5243.41ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 61.3MB in the beginning and 61.2MB in the end (delta: 173.5kB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-10-12 15:16:50,289 INFO L158 Benchmark]: Witness Printer took 155.61ms. Allocated memory was 232.8MB in the beginning and 281.0MB in the end (delta: 48.2MB). Free memory was 61.2MB in the beginning and 232.7MB in the end (delta: -171.6MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-10-12 15:16:50,291 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.14ms. Allocated memory is still 138.4MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.02ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 83.7MB in the beginning and 162.0MB in the end (delta: -78.3MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.77ms. Allocated memory is still 192.9MB. Free memory was 162.0MB in the beginning and 155.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.93ms. Allocated memory is still 192.9MB. Free memory was 155.7MB in the beginning and 150.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 910.01ms. Allocated memory is still 192.9MB. Free memory was 150.5MB in the beginning and 62.4MB in the end (delta: 88.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5243.41ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 61.3MB in the beginning and 61.2MB in the end (delta: 173.5kB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 155.61ms. Allocated memory was 232.8MB in the beginning and 281.0MB in the end (delta: 48.2MB). Free memory was 61.2MB in the beginning and 232.7MB in the end (delta: -171.6MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 509]: 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, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1103 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1103 mSDsluCounter, 1450 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3029 IncrementalHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 508 mSolverCounterUnsat, 1341 mSDtfsCounter, 3029 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1853occurred in iteration=6, InterpolantAutomatonStates: 32, 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, 11 MinimizatonAttempts, 430 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1790 NumberOfCodeBlocks, 1790 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1779 ConstructedInterpolants, 0 QuantifiedInterpolants, 3232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 859/859 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: ((((((((((a17 <= 7) && (a28 == 10)) || ((((a17 == 8) && (9 <= a28)) && (a28 <= 10)) && (a19 == 1))) || (((a25 == 1) && (a17 <= 7)) && (a28 <= 10))) || ((a17 == 8) && (a28 <= 7))) || ((((a17 == 8) && (a25 == 1)) && (a19 == 1)) && (a11 != 1))) || ((a28 == 10) && (a19 == 1))) || ((((a17 == 8) && (a25 == 1)) && (a28 <= 10)) && (a19 == 1))) || (((a17 == 8) && (a28 <= 10)) && (a11 != 1))) || ((((9 <= a28) && (a17 <= 7)) && (a28 <= 10)) && (a11 != 1))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:16:50,317 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