./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label07.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 56a04ed46850e605182228c8e81c7d165207799703ed3ae3590996aae38bb805 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:03:29,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:03:29,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:03:29,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:03:29,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:03:29,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:03:29,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:03:29,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:03:29,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:03:29,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:03:29,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:03:29,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:03:29,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:03:29,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:03:29,993 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:03:29,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:03:29,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:03:29,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:03:29,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:03:29,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:03:29,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:03:29,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:03:29,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:03:29,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:03:29,996 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:03:29,997 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:03:29,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:03:29,997 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:03:29,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:03:29,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:03:29,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:03:29,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:03:29,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:03:29,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:03:30,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:03:30,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:03:30,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:03:30,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:03:30,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:03:30,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:03:30,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:03:30,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:03:30,003 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 -> 56a04ed46850e605182228c8e81c7d165207799703ed3ae3590996aae38bb805 [2024-11-11 17:03:30,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:03:30,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:03:30,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:03:30,290 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:03:30,290 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:03:30,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label07.c [2024-11-11 17:03:31,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:03:31,905 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:03:31,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label07.c [2024-11-11 17:03:31,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13af0d4c/377be135286f435eb1fe634931ea23fc/FLAGe792ae5de [2024-11-11 17:03:31,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13af0d4c/377be135286f435eb1fe634931ea23fc [2024-11-11 17:03:31,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:03:31,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:03:31,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:03:31,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:03:31,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:03:31,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:03:31" (1/1) ... [2024-11-11 17:03:31,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61dd96c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:31, skipping insertion in model container [2024-11-11 17:03:31,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:03:31" (1/1) ... [2024-11-11 17:03:32,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:03:32,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label07.c[4912,4925] [2024-11-11 17:03:32,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:03:32,406 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:03:32,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label07.c[4912,4925] [2024-11-11 17:03:32,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:03:32,554 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:03:32,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32 WrapperNode [2024-11-11 17:03:32,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:03:32,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:03:32,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:03:32,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:03:32,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (1/1) ... [2024-11-11 17:03:32,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (1/1) ... [2024-11-11 17:03:32,670 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-11-11 17:03:32,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:03:32,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:03:32,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:03:32,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:03:32,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (1/1) ... [2024-11-11 17:03:32,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (1/1) ... [2024-11-11 17:03:32,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (1/1) ... [2024-11-11 17:03:32,767 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 17:03:32,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (1/1) ... [2024-11-11 17:03:32,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (1/1) ... [2024-11-11 17:03:32,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (1/1) ... [2024-11-11 17:03:32,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (1/1) ... [2024-11-11 17:03:32,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (1/1) ... [2024-11-11 17:03:32,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (1/1) ... [2024-11-11 17:03:32,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:03:32,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:03:32,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:03:32,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:03:32,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (1/1) ... [2024-11-11 17:03:32,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:03:32,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:03:32,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 17:03:32,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 17:03:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:03:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:03:32,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:03:32,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:03:33,004 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:03:33,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:03:34,166 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-11 17:03:34,167 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:03:34,203 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:03:34,203 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:03:34,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:03:34 BoogieIcfgContainer [2024-11-11 17:03:34,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:03:34,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:03:34,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:03:34,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:03:34,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:03:31" (1/3) ... [2024-11-11 17:03:34,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799e14b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:03:34, skipping insertion in model container [2024-11-11 17:03:34,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:03:32" (2/3) ... [2024-11-11 17:03:34,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799e14b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:03:34, skipping insertion in model container [2024-11-11 17:03:34,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:03:34" (3/3) ... [2024-11-11 17:03:34,213 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label07.c [2024-11-11 17:03:34,229 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:03:34,229 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:03:34,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:03:34,312 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;@3c3926fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:03:34,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:03:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 17:03:34,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:34,330 INFO L218 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] [2024-11-11 17:03:34,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:34,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:34,336 INFO L85 PathProgramCache]: Analyzing trace with hash 433832817, now seen corresponding path program 1 times [2024-11-11 17:03:34,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:34,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973736157] [2024-11-11 17:03:34,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:34,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:03:34,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:34,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973736157] [2024-11-11 17:03:34,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973736157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:34,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:34,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:03:34,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011259655] [2024-11-11 17:03:34,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:34,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:34,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:34,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:34,755 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:35,582 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2024-11-11 17:03:35,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:35,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-11 17:03:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:35,600 INFO L225 Difference]: With dead ends: 669 [2024-11-11 17:03:35,600 INFO L226 Difference]: Without dead ends: 360 [2024-11-11 17:03:35,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:35,608 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 159 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:35,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 77 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:03:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-11 17:03:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-11-11 17:03:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.6378830083565459) internal successors, (588), 359 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 588 transitions. [2024-11-11 17:03:35,692 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 588 transitions. Word has length 47 [2024-11-11 17:03:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:35,692 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 588 transitions. [2024-11-11 17:03:35,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 588 transitions. [2024-11-11 17:03:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 17:03:35,697 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:35,697 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:35,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:03:35,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:35,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:35,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1967938748, now seen corresponding path program 1 times [2024-11-11 17:03:35,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:35,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711713408] [2024-11-11 17:03:35,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:35,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:03:35,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:35,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711713408] [2024-11-11 17:03:35,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711713408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:35,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:35,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:03:35,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000486352] [2024-11-11 17:03:35,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:35,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:35,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:35,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:35,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:35,951 INFO L87 Difference]: Start difference. First operand 360 states and 588 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:36,626 INFO L93 Difference]: Finished difference Result 1074 states and 1759 transitions. [2024-11-11 17:03:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:36,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-11-11 17:03:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:36,632 INFO L225 Difference]: With dead ends: 1074 [2024-11-11 17:03:36,632 INFO L226 Difference]: Without dead ends: 716 [2024-11-11 17:03:36,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:36,635 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:36,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 89 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:03:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-11 17:03:36,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 538. [2024-11-11 17:03:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.4934823091247673) internal successors, (802), 537 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 802 transitions. [2024-11-11 17:03:36,672 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 802 transitions. Word has length 112 [2024-11-11 17:03:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:36,672 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 802 transitions. [2024-11-11 17:03:36,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 802 transitions. [2024-11-11 17:03:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-11 17:03:36,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:36,676 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:36,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:03:36,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:36,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1697201153, now seen corresponding path program 1 times [2024-11-11 17:03:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418005798] [2024-11-11 17:03:36,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:03:37,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418005798] [2024-11-11 17:03:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418005798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:37,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:37,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:03:37,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175286450] [2024-11-11 17:03:37,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:37,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:03:37,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:37,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:03:37,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:03:37,076 INFO L87 Difference]: Start difference. First operand 538 states and 802 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:37,940 INFO L93 Difference]: Finished difference Result 1430 states and 2030 transitions. [2024-11-11 17:03:37,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:03:37,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-11 17:03:37,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:37,944 INFO L225 Difference]: With dead ends: 1430 [2024-11-11 17:03:37,945 INFO L226 Difference]: Without dead ends: 894 [2024-11-11 17:03:37,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:03:37,946 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:37,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 121 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 17:03:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-11 17:03:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2024-11-11 17:03:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.3370660694288914) internal successors, (1194), 893 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1194 transitions. [2024-11-11 17:03:37,975 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1194 transitions. Word has length 126 [2024-11-11 17:03:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:37,977 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1194 transitions. [2024-11-11 17:03:37,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1194 transitions. [2024-11-11 17:03:37,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-11 17:03:37,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:37,987 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:03:37,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:03:37,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:37,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash 18940108, now seen corresponding path program 1 times [2024-11-11 17:03:37,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:37,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331236293] [2024-11-11 17:03:37,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 17:03:38,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:38,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331236293] [2024-11-11 17:03:38,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331236293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:38,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:38,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:03:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139822606] [2024-11-11 17:03:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:38,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:03:38,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:38,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:03:38,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:03:38,354 INFO L87 Difference]: Start difference. First operand 894 states and 1194 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:38,996 INFO L93 Difference]: Finished difference Result 1993 states and 2629 transitions. [2024-11-11 17:03:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:03:38,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2024-11-11 17:03:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:39,001 INFO L225 Difference]: With dead ends: 1993 [2024-11-11 17:03:39,001 INFO L226 Difference]: Without dead ends: 1072 [2024-11-11 17:03:39,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:03:39,004 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 116 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:39,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 119 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:03:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-11 17:03:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2024-11-11 17:03:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.1802054154995332) internal successors, (1264), 1071 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2024-11-11 17:03:39,023 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 206 [2024-11-11 17:03:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:39,024 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2024-11-11 17:03:39,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2024-11-11 17:03:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-11 17:03:39,029 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:39,029 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:39,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:03:39,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:39,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash 721063632, now seen corresponding path program 1 times [2024-11-11 17:03:39,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:39,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313760759] [2024-11-11 17:03:39,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:39,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 89 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:03:39,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:39,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313760759] [2024-11-11 17:03:39,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313760759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:03:39,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485041429] [2024-11-11 17:03:39,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:39,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:03:39,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:03:39,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:03:39,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 17:03:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:39,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:03:39,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:03:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-11 17:03:39,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:03:39,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485041429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:39,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:03:39,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-11 17:03:39,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621447938] [2024-11-11 17:03:39,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:39,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:39,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:39,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:39,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:03:39,628 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:40,217 INFO L93 Difference]: Finished difference Result 2498 states and 3033 transitions. [2024-11-11 17:03:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:40,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 218 [2024-11-11 17:03:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:40,223 INFO L225 Difference]: With dead ends: 2498 [2024-11-11 17:03:40,224 INFO L226 Difference]: Without dead ends: 1428 [2024-11-11 17:03:40,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:03:40,226 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:40,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 85 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:03:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-11-11 17:03:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1072. [2024-11-11 17:03:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.1802054154995332) internal successors, (1264), 1071 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2024-11-11 17:03:40,288 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 218 [2024-11-11 17:03:40,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:40,288 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2024-11-11 17:03:40,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2024-11-11 17:03:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-11 17:03:40,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:40,291 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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-11-11 17:03:40,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 17:03:40,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:03:40,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:40,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash -138953033, now seen corresponding path program 1 times [2024-11-11 17:03:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:40,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165258893] [2024-11-11 17:03:40,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:03:40,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:40,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165258893] [2024-11-11 17:03:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165258893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:40,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:40,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:03:40,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620334196] [2024-11-11 17:03:40,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:40,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:40,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:40,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:40,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:40,724 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:41,264 INFO L93 Difference]: Finished difference Result 2676 states and 3213 transitions. [2024-11-11 17:03:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:41,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2024-11-11 17:03:41,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:41,272 INFO L225 Difference]: With dead ends: 2676 [2024-11-11 17:03:41,273 INFO L226 Difference]: Without dead ends: 1606 [2024-11-11 17:03:41,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:41,277 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:41,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 58 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:03:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2024-11-11 17:03:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2024-11-11 17:03:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.156271899088998) internal successors, (1650), 1427 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1650 transitions. [2024-11-11 17:03:41,304 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1650 transitions. Word has length 221 [2024-11-11 17:03:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:41,304 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1650 transitions. [2024-11-11 17:03:41,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1650 transitions. [2024-11-11 17:03:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-11 17:03:41,309 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:41,309 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:41,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:03:41,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:41,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:41,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1874831652, now seen corresponding path program 1 times [2024-11-11 17:03:41,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:41,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796418265] [2024-11-11 17:03:41,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:41,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 189 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-11 17:03:41,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:41,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796418265] [2024-11-11 17:03:41,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796418265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:03:41,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727987867] [2024-11-11 17:03:41,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:41,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:03:41,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:03:41,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:03:41,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 17:03:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:42,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:03:42,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:03:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2024-11-11 17:03:42,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:03:42,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727987867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:42,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:03:42,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-11 17:03:42,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382164838] [2024-11-11 17:03:42,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:42,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:42,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:42,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:42,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:03:42,451 INFO L87 Difference]: Start difference. First operand 1428 states and 1650 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:42,990 INFO L93 Difference]: Finished difference Result 3210 states and 3788 transitions. [2024-11-11 17:03:42,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:42,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 340 [2024-11-11 17:03:42,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:42,997 INFO L225 Difference]: With dead ends: 3210 [2024-11-11 17:03:42,998 INFO L226 Difference]: Without dead ends: 1962 [2024-11-11 17:03:42,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:03:43,000 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:43,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:03:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-11 17:03:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2024-11-11 17:03:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1402131239484015) internal successors, (2033), 1783 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2033 transitions. [2024-11-11 17:03:43,029 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2033 transitions. Word has length 340 [2024-11-11 17:03:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:43,030 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2033 transitions. [2024-11-11 17:03:43,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2033 transitions. [2024-11-11 17:03:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2024-11-11 17:03:43,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:43,036 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 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] [2024-11-11 17:03:43,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 17:03:43,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-11 17:03:43,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:43,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash -532753135, now seen corresponding path program 1 times [2024-11-11 17:03:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685634794] [2024-11-11 17:03:43,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-11 17:03:43,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:43,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685634794] [2024-11-11 17:03:43,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685634794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:43,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:43,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:03:43,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316058633] [2024-11-11 17:03:43,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:43,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:03:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:43,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:03:43,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:03:43,629 INFO L87 Difference]: Start difference. First operand 1784 states and 2033 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:44,234 INFO L93 Difference]: Finished difference Result 3595 states and 4116 transitions. [2024-11-11 17:03:44,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:03:44,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 417 [2024-11-11 17:03:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:44,241 INFO L225 Difference]: With dead ends: 3595 [2024-11-11 17:03:44,241 INFO L226 Difference]: Without dead ends: 1962 [2024-11-11 17:03:44,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:03:44,244 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:44,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:03:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-11 17:03:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2024-11-11 17:03:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.089736399326977) internal successors, (1943), 1783 states have internal predecessors, (1943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1943 transitions. [2024-11-11 17:03:44,271 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1943 transitions. Word has length 417 [2024-11-11 17:03:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:44,271 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 1943 transitions. [2024-11-11 17:03:44,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1943 transitions. [2024-11-11 17:03:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2024-11-11 17:03:44,278 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:44,279 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:44,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:03:44,279 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:44,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1190620738, now seen corresponding path program 1 times [2024-11-11 17:03:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:44,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620962752] [2024-11-11 17:03:44,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:44,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-11 17:03:44,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:44,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620962752] [2024-11-11 17:03:44,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620962752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:44,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:44,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:03:44,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932385500] [2024-11-11 17:03:44,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:44,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:44,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:44,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:44,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:44,680 INFO L87 Difference]: Start difference. First operand 1784 states and 1943 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:45,215 INFO L93 Difference]: Finished difference Result 4100 states and 4527 transitions. [2024-11-11 17:03:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:45,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 440 [2024-11-11 17:03:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:45,223 INFO L225 Difference]: With dead ends: 4100 [2024-11-11 17:03:45,223 INFO L226 Difference]: Without dead ends: 2496 [2024-11-11 17:03:45,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:45,226 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:45,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 202 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:03:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2024-11-11 17:03:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2496. [2024-11-11 17:03:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.092184368737475) internal successors, (2725), 2495 states have internal predecessors, (2725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2725 transitions. [2024-11-11 17:03:45,266 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2725 transitions. Word has length 440 [2024-11-11 17:03:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:45,267 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2725 transitions. [2024-11-11 17:03:45,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:45,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2725 transitions. [2024-11-11 17:03:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2024-11-11 17:03:45,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:45,274 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:45,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 17:03:45,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:45,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:45,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1892789993, now seen corresponding path program 1 times [2024-11-11 17:03:45,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:45,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54163844] [2024-11-11 17:03:45,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:45,584 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-11 17:03:45,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:45,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54163844] [2024-11-11 17:03:45,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54163844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:45,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:45,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:03:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750056371] [2024-11-11 17:03:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:45,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:45,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:45,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:45,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:45,587 INFO L87 Difference]: Start difference. First operand 2496 states and 2725 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:46,156 INFO L93 Difference]: Finished difference Result 6058 states and 6693 transitions. [2024-11-11 17:03:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:46,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 481 [2024-11-11 17:03:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:46,169 INFO L225 Difference]: With dead ends: 6058 [2024-11-11 17:03:46,169 INFO L226 Difference]: Without dead ends: 3742 [2024-11-11 17:03:46,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:46,174 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:46,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:03:46,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2024-11-11 17:03:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2024-11-11 17:03:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.0828655439722) internal successors, (4051), 3741 states have internal predecessors, (4051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4051 transitions. [2024-11-11 17:03:46,252 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4051 transitions. Word has length 481 [2024-11-11 17:03:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:46,253 INFO L471 AbstractCegarLoop]: Abstraction has 3742 states and 4051 transitions. [2024-11-11 17:03:46,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4051 transitions. [2024-11-11 17:03:46,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2024-11-11 17:03:46,259 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:46,260 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:46,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 17:03:46,261 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:46,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:46,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2029932731, now seen corresponding path program 1 times [2024-11-11 17:03:46,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:46,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503996906] [2024-11-11 17:03:46,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:46,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2024-11-11 17:03:46,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503996906] [2024-11-11 17:03:46,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503996906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:46,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:03:46,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:03:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839860017] [2024-11-11 17:03:46,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:46,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:46,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:46,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:46,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:46,755 INFO L87 Difference]: Start difference. First operand 3742 states and 4051 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:47,220 INFO L93 Difference]: Finished difference Result 7304 states and 7921 transitions. [2024-11-11 17:03:47,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 517 [2024-11-11 17:03:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:47,233 INFO L225 Difference]: With dead ends: 7304 [2024-11-11 17:03:47,234 INFO L226 Difference]: Without dead ends: 3742 [2024-11-11 17:03:47,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:03:47,238 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 103 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:47,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 242 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:03:47,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2024-11-11 17:03:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3208. [2024-11-11 17:03:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.078578110383536) internal successors, (3459), 3207 states have internal predecessors, (3459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3459 transitions. [2024-11-11 17:03:47,288 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3459 transitions. Word has length 517 [2024-11-11 17:03:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:47,289 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3459 transitions. [2024-11-11 17:03:47,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3459 transitions. [2024-11-11 17:03:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2024-11-11 17:03:47,293 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:47,294 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:47,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 17:03:47,295 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:47,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1737325549, now seen corresponding path program 1 times [2024-11-11 17:03:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:47,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772882372] [2024-11-11 17:03:47,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:47,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 867 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-11 17:03:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:47,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772882372] [2024-11-11 17:03:47,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772882372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:03:47,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548448496] [2024-11-11 17:03:47,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:47,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:03:47,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:03:47,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:03:47,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 17:03:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:47,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:03:47,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:03:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1291 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-11-11 17:03:48,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:03:48,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548448496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:48,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:03:48,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-11 17:03:48,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428104927] [2024-11-11 17:03:48,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:48,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:48,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:48,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:48,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:03:48,029 INFO L87 Difference]: Start difference. First operand 3208 states and 3459 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:48,468 INFO L93 Difference]: Finished difference Result 7304 states and 7916 transitions. [2024-11-11 17:03:48,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:48,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 636 [2024-11-11 17:03:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:48,480 INFO L225 Difference]: With dead ends: 7304 [2024-11-11 17:03:48,481 INFO L226 Difference]: Without dead ends: 4276 [2024-11-11 17:03:48,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:03:48,484 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 134 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:48,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 237 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:03:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2024-11-11 17:03:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2024-11-11 17:03:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.0717598242616548) internal successors, (4391), 4097 states have internal predecessors, (4391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4391 transitions. [2024-11-11 17:03:48,569 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4391 transitions. Word has length 636 [2024-11-11 17:03:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:48,571 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4391 transitions. [2024-11-11 17:03:48,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4391 transitions. [2024-11-11 17:03:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2024-11-11 17:03:48,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:48,586 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:48,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 17:03:48,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:03:48,787 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:48,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:48,788 INFO L85 PathProgramCache]: Analyzing trace with hash 233732893, now seen corresponding path program 1 times [2024-11-11 17:03:48,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:48,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531641695] [2024-11-11 17:03:48,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:48,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1730 backedges. 1261 proven. 110 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-11-11 17:03:49,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:49,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531641695] [2024-11-11 17:03:49,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531641695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:03:49,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678658921] [2024-11-11 17:03:49,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:49,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:03:49,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:03:49,290 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:03:49,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 17:03:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:49,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:03:49,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:03:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1730 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 1461 trivial. 0 not checked. [2024-11-11 17:03:49,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:03:49,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678658921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:49,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:03:49,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-11 17:03:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670236356] [2024-11-11 17:03:49,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:49,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:49,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:49,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:49,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:03:49,630 INFO L87 Difference]: Start difference. First operand 4098 states and 4391 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:50,008 INFO L93 Difference]: Finished difference Result 4990 states and 5330 transitions. [2024-11-11 17:03:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:50,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 715 [2024-11-11 17:03:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:50,023 INFO L225 Difference]: With dead ends: 4990 [2024-11-11 17:03:50,023 INFO L226 Difference]: Without dead ends: 4988 [2024-11-11 17:03:50,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:03:50,025 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 155 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:50,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 21 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:03:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2024-11-11 17:03:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4098. [2024-11-11 17:03:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.0717598242616548) internal successors, (4391), 4097 states have internal predecessors, (4391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4391 transitions. [2024-11-11 17:03:50,086 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4391 transitions. Word has length 715 [2024-11-11 17:03:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:50,087 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4391 transitions. [2024-11-11 17:03:50,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4391 transitions. [2024-11-11 17:03:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2024-11-11 17:03:50,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:50,094 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:50,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 17:03:50,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:03:50,295 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:50,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:50,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1864267949, now seen corresponding path program 1 times [2024-11-11 17:03:50,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:50,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386066571] [2024-11-11 17:03:50,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:50,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1858 backedges. 1344 proven. 155 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-11-11 17:03:50,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:50,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386066571] [2024-11-11 17:03:50,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386066571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:03:50,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93782780] [2024-11-11 17:03:50,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:50,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:03:50,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:03:50,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:03:50,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 17:03:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:51,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:03:51,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:03:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1858 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 1589 trivial. 0 not checked. [2024-11-11 17:03:51,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:03:51,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93782780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:51,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:03:51,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-11 17:03:51,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795407122] [2024-11-11 17:03:51,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:51,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:51,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:51,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:03:51,156 INFO L87 Difference]: Start difference. First operand 4098 states and 4391 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:51,551 INFO L93 Difference]: Finished difference Result 8372 states and 9038 transitions. [2024-11-11 17:03:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:51,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 796 [2024-11-11 17:03:51,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:51,564 INFO L225 Difference]: With dead ends: 8372 [2024-11-11 17:03:51,564 INFO L226 Difference]: Without dead ends: 4454 [2024-11-11 17:03:51,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:03:51,569 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 134 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:51,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 239 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:03:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2024-11-11 17:03:51,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4098. [2024-11-11 17:03:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.0727361484012692) internal successors, (4395), 4097 states have internal predecessors, (4395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4395 transitions. [2024-11-11 17:03:51,617 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4395 transitions. Word has length 796 [2024-11-11 17:03:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:51,617 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4395 transitions. [2024-11-11 17:03:51,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4395 transitions. [2024-11-11 17:03:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2024-11-11 17:03:51,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:03:51,626 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:51,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 17:03:51,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 17:03:51,827 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:03:51,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:03:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1858999144, now seen corresponding path program 1 times [2024-11-11 17:03:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:03:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767353338] [2024-11-11 17:03:51,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:03:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 1443 proven. 155 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2024-11-11 17:03:52,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:03:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767353338] [2024-11-11 17:03:52,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767353338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:03:52,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970450524] [2024-11-11 17:03:52,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:03:52,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:03:52,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:03:52,397 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:03:52,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 17:03:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:03:52,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:03:52,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:03:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1957 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 1688 trivial. 0 not checked. [2024-11-11 17:03:52,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:03:52,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970450524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:03:52,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:03:52,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-11 17:03:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139818457] [2024-11-11 17:03:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:03:52,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:03:52,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:03:52,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:03:52,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:03:52,684 INFO L87 Difference]: Start difference. First operand 4098 states and 4395 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:03:53,105 INFO L93 Difference]: Finished difference Result 8904 states and 9552 transitions. [2024-11-11 17:03:53,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:03:53,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 826 [2024-11-11 17:03:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:03:53,107 INFO L225 Difference]: With dead ends: 8904 [2024-11-11 17:03:53,107 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 17:03:53,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 826 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:03:53,114 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:03:53,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 242 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:03:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 17:03:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 17:03:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 17:03:53,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 826 [2024-11-11 17:03:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:03:53,116 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 17:03:53,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:03:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 17:03:53,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 17:03:53,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 17:03:53,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 17:03:53,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 17:03:53,323 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:03:53,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 17:03:53,737 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 17:03:53,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:03:53 BoogieIcfgContainer [2024-11-11 17:03:53,756 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 17:03:53,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 17:03:53,757 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 17:03:53,757 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 17:03:53,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:03:34" (3/4) ... [2024-11-11 17:03:53,760 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 17:03:53,777 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 17:03:53,778 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 17:03:53,779 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 17:03:53,780 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 17:03:53,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 17:03:53,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 17:03:53,963 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 17:03:53,964 INFO L158 Benchmark]: Toolchain (without parser) took 22009.63ms. Allocated memory was 184.5MB in the beginning and 675.3MB in the end (delta: 490.7MB). Free memory was 123.5MB in the beginning and 612.8MB in the end (delta: -489.2MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2024-11-11 17:03:53,964 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 17:03:53,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.67ms. Allocated memory is still 184.5MB. Free memory was 123.5MB in the beginning and 88.2MB in the end (delta: 35.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-11 17:03:53,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.00ms. Allocated memory is still 184.5MB. Free memory was 88.2MB in the beginning and 78.4MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 17:03:53,966 INFO L158 Benchmark]: Boogie Preprocessor took 176.65ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 78.4MB in the beginning and 196.6MB in the end (delta: -118.2MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-11 17:03:53,967 INFO L158 Benchmark]: RCFGBuilder took 1354.83ms. Allocated memory is still 243.3MB. Free memory was 196.6MB in the beginning and 186.3MB in the end (delta: 10.3MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2024-11-11 17:03:53,967 INFO L158 Benchmark]: TraceAbstraction took 19550.74ms. Allocated memory was 243.3MB in the beginning and 675.3MB in the end (delta: 432.0MB). Free memory was 185.8MB in the beginning and 626.4MB in the end (delta: -440.6MB). Peak memory consumption was 322.8MB. Max. memory is 16.1GB. [2024-11-11 17:03:53,967 INFO L158 Benchmark]: Witness Printer took 206.49ms. Allocated memory is still 675.3MB. Free memory was 626.4MB in the beginning and 612.8MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 17:03:53,972 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 598.67ms. Allocated memory is still 184.5MB. Free memory was 123.5MB in the beginning and 88.2MB in the end (delta: 35.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.00ms. Allocated memory is still 184.5MB. Free memory was 88.2MB in the beginning and 78.4MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 176.65ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 78.4MB in the beginning and 196.6MB in the end (delta: -118.2MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1354.83ms. Allocated memory is still 243.3MB. Free memory was 196.6MB in the beginning and 186.3MB in the end (delta: 10.3MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19550.74ms. Allocated memory was 243.3MB in the beginning and 675.3MB in the end (delta: 432.0MB). Free memory was 185.8MB in the beginning and 626.4MB in the end (delta: -440.6MB). Peak memory consumption was 322.8MB. Max. memory is 16.1GB. * Witness Printer took 206.49ms. Allocated memory is still 675.3MB. Free memory was 626.4MB in the beginning and 612.8MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. 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: 155]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2143 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2143 mSDsluCounter, 1846 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 984 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7687 IncrementalHoareTripleChecker+Invalid, 8671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 984 mSolverCounterUnsat, 1768 mSDtfsCounter, 7687 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3575 GetRequests, 3542 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4098occurred in iteration=12, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 3026 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 9629 NumberOfCodeBlocks, 9629 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 9608 ConstructedInterpolants, 0 QuantifiedInterpolants, 21320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4448 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 17702/18427 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((((6 <= a15) && (((long long) a12 + 43) <= 0)) && (a15 <= 8)) || ((a24 == 1) && (12 <= a12))) || (((a24 == 1) && (10 <= a21)) && (0 <= ((long long) a12 + 42)))) || ((6 <= a15) && (a24 == 1))) || ((a24 == 1) && (((long long) 49 + a12) <= 0))) || ((a24 == 1) && (a21 <= 6))) || (((((long long) a12 + 43) <= 0) && (a15 <= 8)) && (a21 <= 6))) RESULT: Ultimate proved your program to be correct! [2024-11-11 17:03:54,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE