./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label14.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 471d591bac756b3641e5eebd3ed64b220338148881b3c7fbab3f4295451226cd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:37:32,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:37:32,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:37:32,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:37:32,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:37:32,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:37:32,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:37:32,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:37:32,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:37:32,665 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:37:32,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:37:32,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:37:32,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:37:32,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:37:32,667 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:37:32,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:37:32,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:37:32,669 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:37:32,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:37:32,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:37:32,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:37:32,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:37:32,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:37:32,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:37:32,674 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:37:32,674 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:37:32,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:37:32,675 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:37:32,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:37:32,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:37:32,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:37:32,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:37:32,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:37:32,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:37:32,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:37:32,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:37:32,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:37:32,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:37:32,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:37:32,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:37:32,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:37:32,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:37:32,678 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 -> 471d591bac756b3641e5eebd3ed64b220338148881b3c7fbab3f4295451226cd [2024-11-09 18:37:32,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:37:32,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:37:32,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:37:32,900 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:37:32,900 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:37:32,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2024-11-09 18:37:34,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:37:34,387 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:37:34,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label14.c [2024-11-09 18:37:34,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae7f4a73/5c3b337da69349a6b2622a6911eaa16f/FLAG2e1251ea5 [2024-11-09 18:37:34,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae7f4a73/5c3b337da69349a6b2622a6911eaa16f [2024-11-09 18:37:34,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:37:34,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:37:34,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:37:34,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:37:34,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:37:34,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:34,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@511c5aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34, skipping insertion in model container [2024-11-09 18:37:34,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:34,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:37:34,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label14.c[18715,18728] [2024-11-09 18:37:34,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:37:34,791 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:37:34,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label14.c[18715,18728] [2024-11-09 18:37:34,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:37:34,878 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:37:34,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34 WrapperNode [2024-11-09 18:37:34,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:37:34,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:37:34,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:37:34,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:37:34,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:34,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:34,938 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-09 18:37:34,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:37:34,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:37:34,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:37:34,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:37:34,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:34,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:34,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:34,985 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-09 18:37:34,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:34,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:35,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:35,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:35,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:35,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:35,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:37:35,014 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:37:35,014 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:37:35,014 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:37:35,015 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (1/1) ... [2024-11-09 18:37:35,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:37:35,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:37:35,049 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-09 18:37:35,052 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-09 18:37:35,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:37:35,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:37:35,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:37:35,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:37:35,156 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:37:35,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:37:35,945 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-09 18:37:35,945 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:37:35,963 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:37:35,964 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:37:35,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:35 BoogieIcfgContainer [2024-11-09 18:37:35,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:37:35,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:37:35,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:37:35,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:37:35,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:37:34" (1/3) ... [2024-11-09 18:37:35,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e845b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:37:35, skipping insertion in model container [2024-11-09 18:37:35,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:34" (2/3) ... [2024-11-09 18:37:35,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e845b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:37:35, skipping insertion in model container [2024-11-09 18:37:35,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:35" (3/3) ... [2024-11-09 18:37:35,973 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label14.c [2024-11-09 18:37:35,987 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:37:35,988 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:37:36,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:37:36,046 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;@1f76bbed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:37:36,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:37:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 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-09 18:37:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 18:37:36,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:36,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:36,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:36,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:36,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1564413899, now seen corresponding path program 1 times [2024-11-09 18:37:36,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:36,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625725727] [2024-11-09 18:37:36,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:36,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:36,494 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-09 18:37:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:36,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625725727] [2024-11-09 18:37:36,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625725727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:36,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:36,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842675833] [2024-11-09 18:37:36,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:36,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:36,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:36,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:36,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:36,530 INFO L87 Difference]: Start difference. First operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 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 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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-09 18:37:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:37,144 INFO L93 Difference]: Finished difference Result 607 states and 1041 transitions. [2024-11-09 18:37:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-09 18:37:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:37,157 INFO L225 Difference]: With dead ends: 607 [2024-11-09 18:37:37,157 INFO L226 Difference]: Without dead ends: 313 [2024-11-09 18:37:37,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:37,163 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 117 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:37,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 121 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:37:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-09 18:37:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-11-09 18:37:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4326923076923077) internal successors, (447), 312 states have internal predecessors, (447), 0 states have call successors, (0), 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-09 18:37:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 447 transitions. [2024-11-09 18:37:37,203 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 447 transitions. Word has length 119 [2024-11-09 18:37:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:37,203 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 447 transitions. [2024-11-09 18:37:37,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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-09 18:37:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 447 transitions. [2024-11-09 18:37:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 18:37:37,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:37,206 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:37:37,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:37:37,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:37,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:37,207 INFO L85 PathProgramCache]: Analyzing trace with hash 802740505, now seen corresponding path program 1 times [2024-11-09 18:37:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:37,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850301418] [2024-11-09 18:37:37,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:37,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:37,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:37,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850301418] [2024-11-09 18:37:37,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850301418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:37,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:37,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:37,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294650339] [2024-11-09 18:37:37,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:37,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:37,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:37,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:37,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:37,455 INFO L87 Difference]: Start difference. First operand 313 states and 447 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:37,818 INFO L93 Difference]: Finished difference Result 922 states and 1323 transitions. [2024-11-09 18:37:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:37,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2024-11-09 18:37:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:37,822 INFO L225 Difference]: With dead ends: 922 [2024-11-09 18:37:37,822 INFO L226 Difference]: Without dead ends: 611 [2024-11-09 18:37:37,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:37,824 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 159 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:37,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 101 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-09 18:37:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 603. [2024-11-09 18:37:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 1.393687707641196) internal successors, (839), 602 states have internal predecessors, (839), 0 states have call successors, (0), 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-09 18:37:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 839 transitions. [2024-11-09 18:37:37,844 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 839 transitions. Word has length 138 [2024-11-09 18:37:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:37,844 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 839 transitions. [2024-11-09 18:37:37,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 839 transitions. [2024-11-09 18:37:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 18:37:37,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:37,847 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:37:37,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:37:37,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:37,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:37,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2116104797, now seen corresponding path program 1 times [2024-11-09 18:37:37,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:37,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871974202] [2024-11-09 18:37:37,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:37,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:37,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871974202] [2024-11-09 18:37:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871974202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:37,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:37,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:37,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44247522] [2024-11-09 18:37:37,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:37,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:37,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:37,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:37,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:37,949 INFO L87 Difference]: Start difference. First operand 603 states and 839 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:38,341 INFO L93 Difference]: Finished difference Result 1785 states and 2491 transitions. [2024-11-09 18:37:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2024-11-09 18:37:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:38,347 INFO L225 Difference]: With dead ends: 1785 [2024-11-09 18:37:38,347 INFO L226 Difference]: Without dead ends: 1184 [2024-11-09 18:37:38,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:38,349 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 185 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:38,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 123 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:38,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2024-11-09 18:37:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1184. [2024-11-09 18:37:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 1.3431952662721893) internal successors, (1589), 1183 states have internal predecessors, (1589), 0 states have call successors, (0), 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-09 18:37:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1589 transitions. [2024-11-09 18:37:38,374 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1589 transitions. Word has length 139 [2024-11-09 18:37:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:38,375 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1589 transitions. [2024-11-09 18:37:38,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1589 transitions. [2024-11-09 18:37:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 18:37:38,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:38,377 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:37:38,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:37:38,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:38,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:38,378 INFO L85 PathProgramCache]: Analyzing trace with hash -653693219, now seen corresponding path program 1 times [2024-11-09 18:37:38,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:38,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929478238] [2024-11-09 18:37:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:38,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:38,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:38,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929478238] [2024-11-09 18:37:38,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929478238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:38,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:38,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:38,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697119617] [2024-11-09 18:37:38,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:38,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:38,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:38,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:38,478 INFO L87 Difference]: Start difference. First operand 1184 states and 1589 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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-09 18:37:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:38,835 INFO L93 Difference]: Finished difference Result 3494 states and 4696 transitions. [2024-11-09 18:37:38,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:38,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2024-11-09 18:37:38,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:38,842 INFO L225 Difference]: With dead ends: 3494 [2024-11-09 18:37:38,842 INFO L226 Difference]: Without dead ends: 2312 [2024-11-09 18:37:38,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:38,845 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 152 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:38,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 91 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:38,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2024-11-09 18:37:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2312. [2024-11-09 18:37:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2312 states, 2311 states have (on average 1.2881869320640416) internal successors, (2977), 2311 states have internal predecessors, (2977), 0 states have call successors, (0), 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-09 18:37:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2977 transitions. [2024-11-09 18:37:38,895 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2977 transitions. Word has length 143 [2024-11-09 18:37:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:38,895 INFO L471 AbstractCegarLoop]: Abstraction has 2312 states and 2977 transitions. [2024-11-09 18:37:38,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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-09 18:37:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2977 transitions. [2024-11-09 18:37:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 18:37:38,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:38,899 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:37:38,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:37:38,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:38,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1202390601, now seen corresponding path program 1 times [2024-11-09 18:37:38,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:38,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040314145] [2024-11-09 18:37:38,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:39,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:39,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040314145] [2024-11-09 18:37:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040314145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:37:39,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413909764] [2024-11-09 18:37:39,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:39,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:37:39,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:37:39,206 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-09 18:37:39,208 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-09 18:37:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:39,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:37:39,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:37:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:37:39,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:37:39,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413909764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:39,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:37:39,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 18:37:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234913099] [2024-11-09 18:37:39,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:39,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:39,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:39,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:39,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:37:39,468 INFO L87 Difference]: Start difference. First operand 2312 states and 2977 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:39,846 INFO L93 Difference]: Finished difference Result 4622 states and 5952 transitions. [2024-11-09 18:37:39,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:39,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2024-11-09 18:37:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:39,853 INFO L225 Difference]: With dead ends: 4622 [2024-11-09 18:37:39,854 INFO L226 Difference]: Without dead ends: 2312 [2024-11-09 18:37:39,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:37:39,857 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 46 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:39,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 252 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2024-11-09 18:37:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2312. [2024-11-09 18:37:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2312 states, 2311 states have (on average 1.1748160969277368) internal successors, (2715), 2311 states have internal predecessors, (2715), 0 states have call successors, (0), 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-09 18:37:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2715 transitions. [2024-11-09 18:37:39,895 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2715 transitions. Word has length 148 [2024-11-09 18:37:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:39,896 INFO L471 AbstractCegarLoop]: Abstraction has 2312 states and 2715 transitions. [2024-11-09 18:37:39,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2715 transitions. [2024-11-09 18:37:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 18:37:39,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:39,900 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:39,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 18:37:40,101 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-09 18:37:40,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:40,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:40,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1031592190, now seen corresponding path program 1 times [2024-11-09 18:37:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:40,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756785068] [2024-11-09 18:37:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:40,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:40,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756785068] [2024-11-09 18:37:40,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756785068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:40,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:40,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:40,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490267779] [2024-11-09 18:37:40,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:40,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:40,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:40,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:40,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:40,213 INFO L87 Difference]: Start difference. First operand 2312 states and 2715 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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-09 18:37:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:40,577 INFO L93 Difference]: Finished difference Result 5187 states and 6044 transitions. [2024-11-09 18:37:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:40,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2024-11-09 18:37:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:40,586 INFO L225 Difference]: With dead ends: 5187 [2024-11-09 18:37:40,587 INFO L226 Difference]: Without dead ends: 2310 [2024-11-09 18:37:40,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:40,593 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 163 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:40,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 63 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2024-11-09 18:37:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2309. [2024-11-09 18:37:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.1213171577123051) internal successors, (2588), 2308 states have internal predecessors, (2588), 0 states have call successors, (0), 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-09 18:37:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2588 transitions. [2024-11-09 18:37:40,630 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2588 transitions. Word has length 150 [2024-11-09 18:37:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:40,630 INFO L471 AbstractCegarLoop]: Abstraction has 2309 states and 2588 transitions. [2024-11-09 18:37:40,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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-09 18:37:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2588 transitions. [2024-11-09 18:37:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 18:37:40,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:40,634 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:40,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:37:40,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:40,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:40,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2027946056, now seen corresponding path program 1 times [2024-11-09 18:37:40,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:40,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586427198] [2024-11-09 18:37:40,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:40,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:40,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586427198] [2024-11-09 18:37:40,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586427198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:40,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:40,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:37:40,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274384386] [2024-11-09 18:37:40,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:40,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:37:40,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:40,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:37:40,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:37:40,860 INFO L87 Difference]: Start difference. First operand 2309 states and 2588 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 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-09 18:37:41,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:41,494 INFO L93 Difference]: Finished difference Result 5885 states and 6561 transitions. [2024-11-09 18:37:41,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:37:41,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 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 154 [2024-11-09 18:37:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:41,505 INFO L225 Difference]: With dead ends: 5885 [2024-11-09 18:37:41,505 INFO L226 Difference]: Without dead ends: 3578 [2024-11-09 18:37:41,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:37:41,509 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 327 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:41,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 154 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 18:37:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2024-11-09 18:37:41,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 2732. [2024-11-09 18:37:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2732 states, 2731 states have (on average 1.113877700476016) internal successors, (3042), 2731 states have internal predecessors, (3042), 0 states have call successors, (0), 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-09 18:37:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3042 transitions. [2024-11-09 18:37:41,550 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3042 transitions. Word has length 154 [2024-11-09 18:37:41,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:41,551 INFO L471 AbstractCegarLoop]: Abstraction has 2732 states and 3042 transitions. [2024-11-09 18:37:41,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 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-09 18:37:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3042 transitions. [2024-11-09 18:37:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 18:37:41,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:41,555 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:37:41,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 18:37:41,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:41,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:41,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1693145405, now seen corresponding path program 1 times [2024-11-09 18:37:41,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:41,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374978641] [2024-11-09 18:37:41,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:41,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:41,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:41,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374978641] [2024-11-09 18:37:41,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374978641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:41,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:41,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:41,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841507466] [2024-11-09 18:37:41,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:41,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:41,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:41,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:41,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:41,630 INFO L87 Difference]: Start difference. First operand 2732 states and 3042 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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-09 18:37:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:41,976 INFO L93 Difference]: Finished difference Result 5302 states and 5909 transitions. [2024-11-09 18:37:41,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:41,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2024-11-09 18:37:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:41,981 INFO L225 Difference]: With dead ends: 5302 [2024-11-09 18:37:41,981 INFO L226 Difference]: Without dead ends: 1723 [2024-11-09 18:37:41,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:41,984 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 118 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:41,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 234 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:41,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2024-11-09 18:37:42,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1723. [2024-11-09 18:37:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1722 states have (on average 1.0830429732868758) internal successors, (1865), 1722 states have internal predecessors, (1865), 0 states have call successors, (0), 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-09 18:37:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 1865 transitions. [2024-11-09 18:37:42,007 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 1865 transitions. Word has length 167 [2024-11-09 18:37:42,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:42,007 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 1865 transitions. [2024-11-09 18:37:42,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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-09 18:37:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 1865 transitions. [2024-11-09 18:37:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-09 18:37:42,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:42,010 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:42,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 18:37:42,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:42,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:42,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2059462440, now seen corresponding path program 1 times [2024-11-09 18:37:42,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:42,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530593621] [2024-11-09 18:37:42,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:42,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:42,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530593621] [2024-11-09 18:37:42,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530593621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:42,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:42,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:42,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724650330] [2024-11-09 18:37:42,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:42,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:37:42,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:42,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:37:42,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:37:42,256 INFO L87 Difference]: Start difference. First operand 1723 states and 1865 transitions. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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-09 18:37:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:42,632 INFO L93 Difference]: Finished difference Result 3589 states and 3883 transitions. [2024-11-09 18:37:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:37:42,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 188 [2024-11-09 18:37:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:42,637 INFO L225 Difference]: With dead ends: 3589 [2024-11-09 18:37:42,637 INFO L226 Difference]: Without dead ends: 1868 [2024-11-09 18:37:42,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:37:42,639 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 104 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:42,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 113 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2024-11-09 18:37:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1864. [2024-11-09 18:37:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1863 states have (on average 1.0783682232957594) internal successors, (2009), 1863 states have internal predecessors, (2009), 0 states have call successors, (0), 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-09 18:37:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2009 transitions. [2024-11-09 18:37:42,663 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2009 transitions. Word has length 188 [2024-11-09 18:37:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:42,663 INFO L471 AbstractCegarLoop]: Abstraction has 1864 states and 2009 transitions. [2024-11-09 18:37:42,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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-09 18:37:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2009 transitions. [2024-11-09 18:37:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-09 18:37:42,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:42,666 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:42,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:37:42,666 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:42,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:42,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1787754662, now seen corresponding path program 1 times [2024-11-09 18:37:42,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:42,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039235016] [2024-11-09 18:37:42,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:42,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 69 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:42,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039235016] [2024-11-09 18:37:42,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039235016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:37:42,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467072262] [2024-11-09 18:37:42,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:42,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:37:42,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:37:42,931 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-09 18:37:42,933 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-09 18:37:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:43,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 18:37:43,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:37:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 18:37:43,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:37:43,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467072262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:43,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:37:43,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 18:37:43,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878630630] [2024-11-09 18:37:43,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:43,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:43,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:43,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:43,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:37:43,135 INFO L87 Difference]: Start difference. First operand 1864 states and 2009 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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-09 18:37:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:43,441 INFO L93 Difference]: Finished difference Result 3727 states and 4017 transitions. [2024-11-09 18:37:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:43,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 219 [2024-11-09 18:37:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:43,445 INFO L225 Difference]: With dead ends: 3727 [2024-11-09 18:37:43,445 INFO L226 Difference]: Without dead ends: 1724 [2024-11-09 18:37:43,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:37:43,447 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 44 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:43,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 233 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2024-11-09 18:37:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1578. [2024-11-09 18:37:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 1.0634115409004439) internal successors, (1677), 1577 states have internal predecessors, (1677), 0 states have call successors, (0), 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-09 18:37:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 1677 transitions. [2024-11-09 18:37:43,469 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 1677 transitions. Word has length 219 [2024-11-09 18:37:43,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:43,469 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 1677 transitions. [2024-11-09 18:37:43,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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-09 18:37:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1677 transitions. [2024-11-09 18:37:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-09 18:37:43,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:43,473 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-09 18:37:43,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 18:37:43,673 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,SelfDestructingSolverStorable9 [2024-11-09 18:37:43,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:43,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash 36755137, now seen corresponding path program 1 times [2024-11-09 18:37:43,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:43,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599210243] [2024-11-09 18:37:43,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:43,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 96 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:44,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:44,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599210243] [2024-11-09 18:37:44,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599210243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:37:44,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274162714] [2024-11-09 18:37:44,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:44,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:37:44,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:37:44,020 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-09 18:37:44,022 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-09 18:37:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:44,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:37:44,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:37:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-09 18:37:44,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:37:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274162714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:44,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:37:44,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-09 18:37:44,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324646778] [2024-11-09 18:37:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:44,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:44,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:44,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:37:44,371 INFO L87 Difference]: Start difference. First operand 1578 states and 1677 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:44,690 INFO L93 Difference]: Finished difference Result 3714 states and 3961 transitions. [2024-11-09 18:37:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:44,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 252 [2024-11-09 18:37:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:44,691 INFO L225 Difference]: With dead ends: 3714 [2024-11-09 18:37:44,691 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:37:44,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-09 18:37:44,694 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:44,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 38 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:37:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:37:44,695 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-09 18:37:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:37:44,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2024-11-09 18:37:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:44,695 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:37:44,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:37:44,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:37:44,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:37:44,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 18:37:44,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:37:44,902 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:44,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:37:45,187 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:37:45,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:37:45 BoogieIcfgContainer [2024-11-09 18:37:45,200 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:37:45,201 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:37:45,201 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:37:45,201 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:37:45,201 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:35" (3/4) ... [2024-11-09 18:37:45,203 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:37:45,222 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 18:37:45,223 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 18:37:45,223 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:37:45,224 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:37:45,346 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:37:45,347 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:37:45,347 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:37:45,348 INFO L158 Benchmark]: Toolchain (without parser) took 10929.09ms. Allocated memory was 188.7MB in the beginning and 346.0MB in the end (delta: 157.3MB). Free memory was 157.4MB in the beginning and 299.6MB in the end (delta: -142.2MB). Peak memory consumption was 212.1MB. Max. memory is 16.1GB. [2024-11-09 18:37:45,348 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 130.0MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:37:45,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.39ms. Allocated memory is still 188.7MB. Free memory was 157.2MB in the beginning and 132.1MB in the end (delta: 25.1MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-11-09 18:37:45,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.12ms. Allocated memory is still 188.7MB. Free memory was 132.1MB in the beginning and 126.6MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:37:45,348 INFO L158 Benchmark]: Boogie Preprocessor took 74.20ms. Allocated memory is still 188.7MB. Free memory was 126.6MB in the beginning and 121.6MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 18:37:45,349 INFO L158 Benchmark]: IcfgBuilder took 950.62ms. Allocated memory is still 188.7MB. Free memory was 121.6MB in the beginning and 102.4MB in the end (delta: 19.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-09 18:37:45,349 INFO L158 Benchmark]: TraceAbstraction took 9234.10ms. Allocated memory was 188.7MB in the beginning and 346.0MB in the end (delta: 157.3MB). Free memory was 101.4MB in the beginning and 107.9MB in the end (delta: -6.6MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB. [2024-11-09 18:37:45,349 INFO L158 Benchmark]: Witness Printer took 146.65ms. Allocated memory is still 346.0MB. Free memory was 107.9MB in the beginning and 299.6MB in the end (delta: -191.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 18:37:45,350 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.26ms. Allocated memory is still 130.0MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.39ms. Allocated memory is still 188.7MB. Free memory was 157.2MB in the beginning and 132.1MB in the end (delta: 25.1MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.12ms. Allocated memory is still 188.7MB. Free memory was 132.1MB in the beginning and 126.6MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.20ms. Allocated memory is still 188.7MB. Free memory was 126.6MB in the beginning and 121.6MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 950.62ms. Allocated memory is still 188.7MB. Free memory was 121.6MB in the beginning and 102.4MB in the end (delta: 19.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9234.10ms. Allocated memory was 188.7MB in the beginning and 346.0MB in the end (delta: 157.3MB). Free memory was 101.4MB in the beginning and 107.9MB in the end (delta: -6.6MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB. * Witness Printer took 146.65ms. Allocated memory is still 346.0MB. Free memory was 107.9MB in the beginning and 299.6MB in the end (delta: -191.6MB). Peak memory consumption was 6.3MB. 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: 533]: 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, 230 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1479 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1479 mSDsluCounter, 1523 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 660 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4720 IncrementalHoareTripleChecker+Invalid, 5380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 660 mSolverCounterUnsat, 1250 mSDtfsCounter, 4720 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 653 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2732occurred in iteration=7, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1005 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2436 NumberOfCodeBlocks, 2436 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2422 ConstructedInterpolants, 0 QuantifiedInterpolants, 11591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1009 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 809/991 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:37:45,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE