./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label17.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 c12284a0b0818e5553c135263b83926be59cee67b7fc82977d08837b834dc791 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:57:54,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:57:54,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:57:54,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:57:54,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:57:54,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:57:54,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:57:54,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:57:54,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:57:54,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:57:54,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:57:54,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:57:54,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:57:54,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:57:54,462 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:57:54,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:57:54,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:57:54,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:57:54,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:57:54,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:57:54,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:57:54,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:57:54,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:57:54,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:57:54,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:57:54,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:57:54,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:57:54,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:57:54,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:57:54,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:57:54,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:57:54,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:57:54,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:57:54,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:57:54,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:57:54,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:57:54,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:57:54,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:57:54,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:57:54,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:57:54,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:57:54,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:57:54,471 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 -> c12284a0b0818e5553c135263b83926be59cee67b7fc82977d08837b834dc791 [2024-10-12 15:57:54,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:57:54,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:57:54,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:57:54,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:57:54,680 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:57:54,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label17.c [2024-10-12 15:57:55,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:57:56,047 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:57:56,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label17.c [2024-10-12 15:57:56,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1abf8ac/12c3232ab07c44b3bcdcdf4a85c6344d/FLAG1f2f8e7a2 [2024-10-12 15:57:56,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1abf8ac/12c3232ab07c44b3bcdcdf4a85c6344d [2024-10-12 15:57:56,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:57:56,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:57:56,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:57:56,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:57:56,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:57:56,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:56,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d6ff54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56, skipping insertion in model container [2024-10-12 15:57:56,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:56,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:57:56,666 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label17.c[3604,3617] [2024-10-12 15:57:56,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:57:56,776 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:57:56,793 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label17.c[3604,3617] [2024-10-12 15:57:56,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:57:56,849 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:57:56,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56 WrapperNode [2024-10-12 15:57:56,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:57:56,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:57:56,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:57:56,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:57:56,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:56,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:56,916 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-12 15:57:56,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:57:56,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:57:56,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:57:56,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:57:56,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:56,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:56,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:56,959 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 15:57:56,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:56,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:56,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:56,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:56,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:56,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:57,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:57:57,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:57:57,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:57:57,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:57:57,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (1/1) ... [2024-10-12 15:57:57,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:57:57,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:57:57,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:57:57,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:57:57,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:57:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:57:57,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:57:57,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:57:57,126 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:57:57,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:57:57,902 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-12 15:57:57,903 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:57:57,952 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:57:57,953 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:57:57,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:57:57 BoogieIcfgContainer [2024-10-12 15:57:57,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:57:57,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:57:57,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:57:57,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:57:57,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:57:56" (1/3) ... [2024-10-12 15:57:57,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a586ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:57:57, skipping insertion in model container [2024-10-12 15:57:57,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:57:56" (2/3) ... [2024-10-12 15:57:57,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a586ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:57:57, skipping insertion in model container [2024-10-12 15:57:57,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:57:57" (3/3) ... [2024-10-12 15:57:57,961 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label17.c [2024-10-12 15:57:57,973 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:57:57,973 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:57:58,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:57:58,029 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;@35d8e574, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:57:58,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:57:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 15:57:58,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:58,039 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] [2024-10-12 15:57:58,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:58,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:58,044 INFO L85 PathProgramCache]: Analyzing trace with hash -921546806, now seen corresponding path program 1 times [2024-10-12 15:57:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:58,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853831811] [2024-10-12 15:57:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:57:58,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:58,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853831811] [2024-10-12 15:57:58,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853831811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:58,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:57:58,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:57:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058124304] [2024-10-12 15:57:58,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:58,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:57:58,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:58,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:57:58,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:57:58,221 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:58,257 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-12 15:57:58,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:57:58,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 29 [2024-10-12 15:57:58,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:58,268 INFO L225 Difference]: With dead ends: 287 [2024-10-12 15:57:58,268 INFO L226 Difference]: Without dead ends: 142 [2024-10-12 15:57:58,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:57:58,276 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:57:58,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:57:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-12 15:57:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-12 15:57:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-12 15:57:58,317 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 29 [2024-10-12 15:57:58,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:58,318 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-12 15:57:58,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-12 15:57:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 15:57:58,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:58,319 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] [2024-10-12 15:57:58,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:57:58,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:58,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:58,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1607111989, now seen corresponding path program 1 times [2024-10-12 15:57:58,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:58,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193091199] [2024-10-12 15:57:58,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:58,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:57:58,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:58,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193091199] [2024-10-12 15:57:58,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193091199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:58,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:57:58,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:57:58,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871155130] [2024-10-12 15:57:58,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:58,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:57:58,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:58,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:57:58,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:57:58,464 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:58,945 INFO L93 Difference]: Finished difference Result 422 states and 648 transitions. [2024-10-12 15:57:58,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:57:58,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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 29 [2024-10-12 15:57:58,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:58,948 INFO L225 Difference]: With dead ends: 422 [2024-10-12 15:57:58,949 INFO L226 Difference]: Without dead ends: 281 [2024-10-12 15:57:58,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:57:58,951 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 114 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:57:58,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 29 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:57:58,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-12 15:57:58,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-12 15:57:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.4678571428571427) internal successors, (411), 280 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 411 transitions. [2024-10-12 15:57:58,966 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 411 transitions. Word has length 29 [2024-10-12 15:57:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:58,966 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 411 transitions. [2024-10-12 15:57:58,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 411 transitions. [2024-10-12 15:57:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 15:57:58,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:58,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:57:58,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:57:58,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:58,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:58,969 INFO L85 PathProgramCache]: Analyzing trace with hash 870956247, now seen corresponding path program 1 times [2024-10-12 15:57:58,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:58,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106480636] [2024-10-12 15:57:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:58,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:57:59,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:59,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106480636] [2024-10-12 15:57:59,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106480636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:59,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:57:59,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:57:59,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072762398] [2024-10-12 15:57:59,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:59,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:57:59,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:59,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:57:59,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:57:59,151 INFO L87 Difference]: Start difference. First operand 281 states and 411 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:57:59,548 INFO L93 Difference]: Finished difference Result 839 states and 1230 transitions. [2024-10-12 15:57:59,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:57:59,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 99 [2024-10-12 15:57:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:57:59,551 INFO L225 Difference]: With dead ends: 839 [2024-10-12 15:57:59,551 INFO L226 Difference]: Without dead ends: 559 [2024-10-12 15:57:59,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:57:59,553 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:57:59,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 65 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:57:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-12 15:57:59,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-12 15:57:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3064516129032258) internal successors, (729), 558 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 729 transitions. [2024-10-12 15:57:59,571 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 729 transitions. Word has length 99 [2024-10-12 15:57:59,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:57:59,571 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 729 transitions. [2024-10-12 15:57:59,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:57:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 729 transitions. [2024-10-12 15:57:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 15:57:59,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:57:59,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:57:59,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:57:59,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:57:59,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:57:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash 282927417, now seen corresponding path program 1 times [2024-10-12 15:57:59,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:57:59,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400894704] [2024-10-12 15:57:59,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:57:59,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:57:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:57:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:57:59,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:57:59,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400894704] [2024-10-12 15:57:59,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400894704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:57:59,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:57:59,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:57:59,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245652107] [2024-10-12 15:57:59,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:57:59,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:57:59,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:57:59,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:57:59,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:57:59,691 INFO L87 Difference]: Start difference. First operand 559 states and 729 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:00,077 INFO L93 Difference]: Finished difference Result 978 states and 1298 transitions. [2024-10-12 15:58:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:00,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2024-10-12 15:58:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:00,081 INFO L225 Difference]: With dead ends: 978 [2024-10-12 15:58:00,081 INFO L226 Difference]: Without dead ends: 976 [2024-10-12 15:58:00,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:00,083 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 153 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:00,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 9 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-12 15:58:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 698. [2024-10-12 15:58:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.3529411764705883) internal successors, (943), 697 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 943 transitions. [2024-10-12 15:58:00,099 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 943 transitions. Word has length 104 [2024-10-12 15:58:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:00,100 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 943 transitions. [2024-10-12 15:58:00,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 943 transitions. [2024-10-12 15:58:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-12 15:58:00,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:00,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:00,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:58:00,104 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:00,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:00,105 INFO L85 PathProgramCache]: Analyzing trace with hash -761502881, now seen corresponding path program 1 times [2024-10-12 15:58:00,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:00,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535486769] [2024-10-12 15:58:00,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:00,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:00,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535486769] [2024-10-12 15:58:00,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535486769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:00,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:58:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318064478] [2024-10-12 15:58:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:00,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:58:00,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:00,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:58:00,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:58:00,401 INFO L87 Difference]: Start difference. First operand 698 states and 943 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:00,824 INFO L93 Difference]: Finished difference Result 1534 states and 2044 transitions. [2024-10-12 15:58:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:58:00,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 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 147 [2024-10-12 15:58:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:00,828 INFO L225 Difference]: With dead ends: 1534 [2024-10-12 15:58:00,828 INFO L226 Difference]: Without dead ends: 837 [2024-10-12 15:58:00,829 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-10-12 15:58:00,830 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:00,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 83 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-12 15:58:00,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-12 15:58:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.3002392344497609) internal successors, (1087), 836 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1087 transitions. [2024-10-12 15:58:00,844 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1087 transitions. Word has length 147 [2024-10-12 15:58:00,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:00,845 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1087 transitions. [2024-10-12 15:58:00,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1087 transitions. [2024-10-12 15:58:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-12 15:58:00,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:00,855 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:00,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:58:00,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:00,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2035894201, now seen corresponding path program 1 times [2024-10-12 15:58:00,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:00,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659708488] [2024-10-12 15:58:00,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:00,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:01,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:01,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659708488] [2024-10-12 15:58:01,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659708488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:01,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:01,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 15:58:01,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438393213] [2024-10-12 15:58:01,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:01,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 15:58:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:01,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 15:58:01,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:58:01,184 INFO L87 Difference]: Start difference. First operand 837 states and 1087 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:01,546 INFO L93 Difference]: Finished difference Result 1589 states and 2084 transitions. [2024-10-12 15:58:01,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:58:01,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 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 182 [2024-10-12 15:58:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:01,549 INFO L225 Difference]: With dead ends: 1589 [2024-10-12 15:58:01,549 INFO L226 Difference]: Without dead ends: 837 [2024-10-12 15:58:01,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 15:58:01,551 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:01,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 20 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 15:58:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-12 15:58:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-12 15:58:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2930622009569377) internal successors, (1081), 836 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1081 transitions. [2024-10-12 15:58:01,562 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1081 transitions. Word has length 182 [2024-10-12 15:58:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:01,562 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1081 transitions. [2024-10-12 15:58:01,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1081 transitions. [2024-10-12 15:58:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-12 15:58:01,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:01,564 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:58:01,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:58:01,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:01,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash -7125113, now seen corresponding path program 1 times [2024-10-12 15:58:01,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:01,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617765955] [2024-10-12 15:58:01,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:01,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:01,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617765955] [2024-10-12 15:58:01,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617765955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:01,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:01,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:58:01,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304314754] [2024-10-12 15:58:01,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:01,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:01,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:01,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:01,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:01,685 INFO L87 Difference]: Start difference. First operand 837 states and 1081 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:02,079 INFO L93 Difference]: Finished difference Result 1951 states and 2638 transitions. [2024-10-12 15:58:02,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:02,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 189 [2024-10-12 15:58:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:02,083 INFO L225 Difference]: With dead ends: 1951 [2024-10-12 15:58:02,083 INFO L226 Difference]: Without dead ends: 1254 [2024-10-12 15:58:02,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:02,085 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:02,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 211 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:02,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-12 15:58:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 837. [2024-10-12 15:58:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2822966507177034) internal successors, (1072), 836 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1072 transitions. [2024-10-12 15:58:02,101 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1072 transitions. Word has length 189 [2024-10-12 15:58:02,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:02,102 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1072 transitions. [2024-10-12 15:58:02,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1072 transitions. [2024-10-12 15:58:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-12 15:58:02,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:02,106 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:58:02,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:58:02,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:02,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:02,107 INFO L85 PathProgramCache]: Analyzing trace with hash -900181651, now seen corresponding path program 1 times [2024-10-12 15:58:02,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:02,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221633061] [2024-10-12 15:58:02,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:02,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:58:02,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:02,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221633061] [2024-10-12 15:58:02,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221633061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:02,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:58:02,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:58:02,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237562296] [2024-10-12 15:58:02,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:02,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:02,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:02,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:02,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:02,241 INFO L87 Difference]: Start difference. First operand 837 states and 1072 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:02,620 INFO L93 Difference]: Finished difference Result 1951 states and 2620 transitions. [2024-10-12 15:58:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:02,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2024-10-12 15:58:02,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:02,624 INFO L225 Difference]: With dead ends: 1951 [2024-10-12 15:58:02,624 INFO L226 Difference]: Without dead ends: 1254 [2024-10-12 15:58:02,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:58:02,625 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:02,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 187 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-12 15:58:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1115. [2024-10-12 15:58:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2612208258527828) internal successors, (1405), 1114 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1405 transitions. [2024-10-12 15:58:02,639 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1405 transitions. Word has length 218 [2024-10-12 15:58:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:02,640 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1405 transitions. [2024-10-12 15:58:02,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1405 transitions. [2024-10-12 15:58:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-12 15:58:02,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:58:02,643 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:58:02,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:58:02,643 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:58:02,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:58:02,643 INFO L85 PathProgramCache]: Analyzing trace with hash 102685398, now seen corresponding path program 1 times [2024-10-12 15:58:02,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:58:02,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108265475] [2024-10-12 15:58:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:02,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:58:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 56 proven. 209 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-12 15:58:03,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:58:03,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108265475] [2024-10-12 15:58:03,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108265475] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:58:03,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744974887] [2024-10-12 15:58:03,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:58:03,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:03,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:58:03,107 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-10-12 15:58:03,108 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-10-12 15:58:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:58:03,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:58:03,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:58:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-12 15:58:03,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:58:03,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744974887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:58:03,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:58:03,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 15:58:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375571049] [2024-10-12 15:58:03,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:58:03,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:58:03,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:58:03,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:58:03,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:58:03,289 INFO L87 Difference]: Start difference. First operand 1115 states and 1405 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:58:03,673 INFO L93 Difference]: Finished difference Result 2366 states and 3071 transitions. [2024-10-12 15:58:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:58:03,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 328 [2024-10-12 15:58:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:58:03,674 INFO L225 Difference]: With dead ends: 2366 [2024-10-12 15:58:03,674 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:58:03,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:58:03,676 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 134 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:58:03,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 16 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:58:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:58:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:58:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:58:03,678 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 328 [2024-10-12 15:58:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:58:03,678 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:58:03,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:58:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:58:03,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:58:03,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:58:03,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 15:58:03,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:58:03,885 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:58:03,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:58:03,962 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:58:03,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:58:03 BoogieIcfgContainer [2024-10-12 15:58:03,975 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:58:03,976 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:58:03,976 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:58:03,976 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:58:03,976 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:57:57" (3/4) ... [2024-10-12 15:58:03,978 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:58:03,991 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:58:03,992 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:58:03,993 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:58:03,993 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:58:04,107 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:58:04,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:58:04,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:58:04,110 INFO L158 Benchmark]: Toolchain (without parser) took 7685.90ms. Allocated memory was 155.2MB in the beginning and 272.6MB in the end (delta: 117.4MB). Free memory was 82.4MB in the beginning and 100.2MB in the end (delta: -17.7MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. [2024-10-12 15:58:04,110 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 110.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:58:04,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.40ms. Allocated memory is still 155.2MB. Free memory was 82.2MB in the beginning and 102.8MB in the end (delta: -20.6MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-10-12 15:58:04,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.76ms. Allocated memory is still 155.2MB. Free memory was 102.8MB in the beginning and 94.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 15:58:04,111 INFO L158 Benchmark]: Boogie Preprocessor took 85.42ms. Allocated memory is still 155.2MB. Free memory was 94.5MB in the beginning and 84.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 15:58:04,111 INFO L158 Benchmark]: RCFGBuilder took 951.43ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 84.5MB in the beginning and 132.2MB in the end (delta: -47.6MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2024-10-12 15:58:04,111 INFO L158 Benchmark]: TraceAbstraction took 6020.03ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 131.1MB in the beginning and 111.7MB in the end (delta: 19.4MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2024-10-12 15:58:04,111 INFO L158 Benchmark]: Witness Printer took 133.70ms. Allocated memory is still 272.6MB. Free memory was 111.7MB in the beginning and 100.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 15:58:04,112 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.13ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 110.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.40ms. Allocated memory is still 155.2MB. Free memory was 82.2MB in the beginning and 102.8MB in the end (delta: -20.6MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.76ms. Allocated memory is still 155.2MB. Free memory was 102.8MB in the beginning and 94.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.42ms. Allocated memory is still 155.2MB. Free memory was 94.5MB in the beginning and 84.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 951.43ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 84.5MB in the beginning and 132.2MB in the end (delta: -47.6MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6020.03ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 131.1MB in the beginning and 111.7MB in the end (delta: 19.4MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Witness Printer took 133.70ms. Allocated memory is still 272.6MB. Free memory was 111.7MB in the beginning and 100.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 104]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 830 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 830 mSDsluCounter, 837 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 496 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3267 IncrementalHoareTripleChecker+Invalid, 3763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 496 mSolverCounterUnsat, 794 mSDtfsCounter, 3267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1115occurred in iteration=8, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 834 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1653 NumberOfCodeBlocks, 1653 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1643 ConstructedInterpolants, 0 QuantifiedInterpolants, 6046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 929/1138 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: 592]: Loop Invariant Derived loop invariant: (((((8 <= a19) && (14 == a4)) && (a12 == 0)) || (((a1 <= 23) && (14 == a4)) && (a12 == 0))) || (((a10 <= 3) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:58:04,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE