./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label35.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d3e3930727d0c60d79f1b553922b6ffa9dda0949b70cfe091b5b493dd5b1378e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:35:08,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:35:08,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:35:08,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:35:08,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:35:08,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:35:08,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:35:08,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:35:08,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:35:08,805 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:35:08,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:35:08,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:35:08,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:35:08,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:35:08,808 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:35:08,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:35:08,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:35:08,812 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:35:08,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:35:08,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:35:08,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:35:08,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:35:08,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:35:08,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:35:08,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:35:08,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:35:08,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:35:08,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:35:08,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:35:08,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:35:08,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:35:08,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:35:08,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:35:08,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:35:08,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:35:08,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:35:08,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:35:08,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:35:08,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:35:08,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:35:08,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:35:08,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:35:08,821 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-clean/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-clean/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 -> d3e3930727d0c60d79f1b553922b6ffa9dda0949b70cfe091b5b493dd5b1378e [2024-10-10 22:35:09,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:35:09,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:35:09,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:35:09,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:35:09,156 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:35:09,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label35.c [2024-10-10 22:35:10,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:35:10,887 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:35:10,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label35.c [2024-10-10 22:35:10,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/315814223/33be24c2ed8441899f08826de905bcf0/FLAG332046bca [2024-10-10 22:35:10,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/315814223/33be24c2ed8441899f08826de905bcf0 [2024-10-10 22:35:10,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:35:10,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:35:10,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:35:10,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:35:10,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:35:10,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:35:10" (1/1) ... [2024-10-10 22:35:10,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75980395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:10, skipping insertion in model container [2024-10-10 22:35:10,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:35:10" (1/1) ... [2024-10-10 22:35:10,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:35:11,318 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label35.c[16104,16117] [2024-10-10 22:35:11,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:35:11,376 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:35:11,442 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label35.c[16104,16117] [2024-10-10 22:35:11,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:35:11,493 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:35:11,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11 WrapperNode [2024-10-10 22:35:11,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:35:11,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:35:11,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:35:11,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:35:11,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (1/1) ... [2024-10-10 22:35:11,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (1/1) ... [2024-10-10 22:35:11,612 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-10 22:35:11,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:35:11,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:35:11,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:35:11,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:35:11,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (1/1) ... [2024-10-10 22:35:11,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (1/1) ... [2024-10-10 22:35:11,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (1/1) ... [2024-10-10 22:35:11,665 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-10 22:35:11,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (1/1) ... [2024-10-10 22:35:11,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (1/1) ... [2024-10-10 22:35:11,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (1/1) ... [2024-10-10 22:35:11,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (1/1) ... [2024-10-10 22:35:11,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (1/1) ... [2024-10-10 22:35:11,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (1/1) ... [2024-10-10 22:35:11,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:35:11,699 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:35:11,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:35:11,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:35:11,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (1/1) ... [2024-10-10 22:35:11,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:35:11,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:35:11,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:35:11,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:35:11,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:35:11,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:35:11,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:35:11,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:35:11,865 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:35:11,867 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:35:12,830 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 22:35:12,830 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:35:12,898 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:35:12,900 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:35:12,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:12 BoogieIcfgContainer [2024-10-10 22:35:12,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:35:12,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:35:12,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:35:12,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:35:12,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:35:10" (1/3) ... [2024-10-10 22:35:12,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9596c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:35:12, skipping insertion in model container [2024-10-10 22:35:12,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:11" (2/3) ... [2024-10-10 22:35:12,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a9596c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:35:12, skipping insertion in model container [2024-10-10 22:35:12,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:12" (3/3) ... [2024-10-10 22:35:12,912 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label35.c [2024-10-10 22:35:12,929 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:35:12,930 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:35:13,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:35:13,014 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;@3dba4498, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:35:13,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:35:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-10 22:35:13,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:13,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:13,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:13,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:13,039 INFO L85 PathProgramCache]: Analyzing trace with hash -722152847, now seen corresponding path program 1 times [2024-10-10 22:35:13,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:13,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802083887] [2024-10-10 22:35:13,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:13,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:13,449 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-10 22:35:13,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:13,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802083887] [2024-10-10 22:35:13,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802083887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:13,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:13,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:13,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120891612] [2024-10-10 22:35:13,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:13,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:35:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:13,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:35:13,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:35:13,488 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 states have internal predecessors, (93), 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-10 22:35:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:13,542 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2024-10-10 22:35:13,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:35:13,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 states have internal predecessors, (93), 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 93 [2024-10-10 22:35:13,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:13,554 INFO L225 Difference]: With dead ends: 329 [2024-10-10 22:35:13,555 INFO L226 Difference]: Without dead ends: 163 [2024-10-10 22:35:13,558 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-10 22:35:13,560 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:13,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:35:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-10 22:35:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-10 22:35:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-10 22:35:13,603 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 93 [2024-10-10 22:35:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:13,603 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-10 22:35:13,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 states have internal predecessors, (93), 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-10 22:35:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-10 22:35:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-10 22:35:13,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:13,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:13,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:35:13,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:13,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:13,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1108430026, now seen corresponding path program 1 times [2024-10-10 22:35:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:13,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234805637] [2024-10-10 22:35:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:13,846 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-10 22:35:13,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:13,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234805637] [2024-10-10 22:35:13,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234805637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:13,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:13,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:13,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243893469] [2024-10-10 22:35:13,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:13,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:13,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:13,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:13,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:13,854 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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-10 22:35:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:14,443 INFO L93 Difference]: Finished difference Result 466 states and 712 transitions. [2024-10-10 22:35:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:14,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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 93 [2024-10-10 22:35:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:14,447 INFO L225 Difference]: With dead ends: 466 [2024-10-10 22:35:14,447 INFO L226 Difference]: Without dead ends: 304 [2024-10-10 22:35:14,448 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-10 22:35:14,449 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 126 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:14,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 42 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:35:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-10 22:35:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-10-10 22:35:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.528052805280528) internal successors, (463), 303 states have internal predecessors, (463), 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-10 22:35:14,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 463 transitions. [2024-10-10 22:35:14,478 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 463 transitions. Word has length 93 [2024-10-10 22:35:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:14,479 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 463 transitions. [2024-10-10 22:35:14,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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-10 22:35:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 463 transitions. [2024-10-10 22:35:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-10 22:35:14,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:14,482 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:35:14,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:35:14,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:14,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1589426592, now seen corresponding path program 1 times [2024-10-10 22:35:14,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:14,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519621512] [2024-10-10 22:35:14,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:14,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:14,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:14,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519621512] [2024-10-10 22:35:14,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519621512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:14,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:14,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:14,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217987057] [2024-10-10 22:35:14,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:14,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:14,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:14,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:14,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:14,724 INFO L87 Difference]: Start difference. First operand 304 states and 463 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 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-10 22:35:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:15,208 INFO L93 Difference]: Finished difference Result 901 states and 1374 transitions. [2024-10-10 22:35:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:15,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 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-10 22:35:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:15,212 INFO L225 Difference]: With dead ends: 901 [2024-10-10 22:35:15,213 INFO L226 Difference]: Without dead ends: 598 [2024-10-10 22:35:15,214 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-10 22:35:15,215 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 193 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:15,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 69 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:35:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-10-10 22:35:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2024-10-10 22:35:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4781144781144782) internal successors, (878), 594 states have internal predecessors, (878), 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-10 22:35:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 878 transitions. [2024-10-10 22:35:15,248 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 878 transitions. Word has length 104 [2024-10-10 22:35:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:15,248 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 878 transitions. [2024-10-10 22:35:15,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 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-10 22:35:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 878 transitions. [2024-10-10 22:35:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-10 22:35:15,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:15,252 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-10 22:35:15,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:35:15,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:15,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:15,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1507930069, now seen corresponding path program 1 times [2024-10-10 22:35:15,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:15,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361288842] [2024-10-10 22:35:15,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:15,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:35:15,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:15,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361288842] [2024-10-10 22:35:15,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361288842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:15,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:15,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:15,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94927592] [2024-10-10 22:35:15,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:15,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:15,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:15,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:15,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:15,522 INFO L87 Difference]: Start difference. First operand 595 states and 878 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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-10 22:35:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:15,977 INFO L93 Difference]: Finished difference Result 1614 states and 2395 transitions. [2024-10-10 22:35:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:15,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-10-10 22:35:15,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:15,983 INFO L225 Difference]: With dead ends: 1614 [2024-10-10 22:35:15,984 INFO L226 Difference]: Without dead ends: 1020 [2024-10-10 22:35:15,985 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-10 22:35:15,986 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 143 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:15,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 119 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:35:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2024-10-10 22:35:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 878. [2024-10-10 22:35:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 1.3523375142531358) internal successors, (1186), 877 states have internal predecessors, (1186), 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-10 22:35:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1186 transitions. [2024-10-10 22:35:16,010 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1186 transitions. Word has length 108 [2024-10-10 22:35:16,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:16,011 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1186 transitions. [2024-10-10 22:35:16,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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-10 22:35:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1186 transitions. [2024-10-10 22:35:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-10 22:35:16,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:16,019 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2024-10-10 22:35:16,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:35:16,020 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:16,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:16,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1066356036, now seen corresponding path program 1 times [2024-10-10 22:35:16,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:16,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670560771] [2024-10-10 22:35:16,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:16,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:35:16,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:16,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670560771] [2024-10-10 22:35:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670560771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:16,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:16,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:16,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121552119] [2024-10-10 22:35:16,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:16,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:16,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:16,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:16,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:16,216 INFO L87 Difference]: Start difference. First operand 878 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-10 22:35:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:16,738 INFO L93 Difference]: Finished difference Result 2179 states and 3008 transitions. [2024-10-10 22:35:16,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:16,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-10 22:35:16,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:16,743 INFO L225 Difference]: With dead ends: 2179 [2024-10-10 22:35:16,744 INFO L226 Difference]: Without dead ends: 1302 [2024-10-10 22:35:16,745 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-10 22:35:16,747 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 144 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:16,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 249 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:35:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2024-10-10 22:35:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1161. [2024-10-10 22:35:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1160 states have (on average 1.2922413793103449) internal successors, (1499), 1160 states have internal predecessors, (1499), 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-10 22:35:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1499 transitions. [2024-10-10 22:35:16,776 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1499 transitions. Word has length 113 [2024-10-10 22:35:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:16,777 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1499 transitions. [2024-10-10 22:35:16,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-10 22:35:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1499 transitions. [2024-10-10 22:35:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-10 22:35:16,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:16,781 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:35:16,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:35:16,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:16,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:16,783 INFO L85 PathProgramCache]: Analyzing trace with hash 916005796, now seen corresponding path program 1 times [2024-10-10 22:35:16,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:16,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989216124] [2024-10-10 22:35:16,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:16,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:35:16,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:16,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989216124] [2024-10-10 22:35:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989216124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:16,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:16,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155108002] [2024-10-10 22:35:16,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:16,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:16,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:16,876 INFO L87 Difference]: Start difference. First operand 1161 states and 1499 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 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-10 22:35:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:17,334 INFO L93 Difference]: Finished difference Result 3302 states and 4290 transitions. [2024-10-10 22:35:17,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:17,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 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 114 [2024-10-10 22:35:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:17,342 INFO L225 Difference]: With dead ends: 3302 [2024-10-10 22:35:17,342 INFO L226 Difference]: Without dead ends: 2142 [2024-10-10 22:35:17,344 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-10 22:35:17,345 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 188 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:17,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 75 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:35:17,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2024-10-10 22:35:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1862. [2024-10-10 22:35:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1861 states have (on average 1.2380440623320794) internal successors, (2304), 1861 states have internal predecessors, (2304), 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-10 22:35:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2304 transitions. [2024-10-10 22:35:17,386 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2304 transitions. Word has length 114 [2024-10-10 22:35:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:17,390 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 2304 transitions. [2024-10-10 22:35:17,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 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-10 22:35:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2304 transitions. [2024-10-10 22:35:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-10 22:35:17,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:17,394 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:35:17,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:35:17,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:17,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1458126702, now seen corresponding path program 1 times [2024-10-10 22:35:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:17,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448918341] [2024-10-10 22:35:17,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:17,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-10 22:35:17,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:17,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448918341] [2024-10-10 22:35:17,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448918341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:17,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:17,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:17,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852015195] [2024-10-10 22:35:17,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:17,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:17,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:17,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:17,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:17,540 INFO L87 Difference]: Start difference. First operand 1862 states and 2304 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:17,976 INFO L93 Difference]: Finished difference Result 4284 states and 5273 transitions. [2024-10-10 22:35:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:17,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2024-10-10 22:35:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:17,985 INFO L225 Difference]: With dead ends: 4284 [2024-10-10 22:35:17,985 INFO L226 Difference]: Without dead ends: 2423 [2024-10-10 22:35:17,988 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-10 22:35:17,992 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:17,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 64 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:35:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2024-10-10 22:35:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2422. [2024-10-10 22:35:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 2421 states have (on average 1.1953738124741842) internal successors, (2894), 2421 states have internal predecessors, (2894), 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-10 22:35:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 2894 transitions. [2024-10-10 22:35:18,037 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 2894 transitions. Word has length 148 [2024-10-10 22:35:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:18,038 INFO L471 AbstractCegarLoop]: Abstraction has 2422 states and 2894 transitions. [2024-10-10 22:35:18,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 2894 transitions. [2024-10-10 22:35:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-10 22:35:18,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:18,043 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:35:18,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:35:18,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:18,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1718607516, now seen corresponding path program 1 times [2024-10-10 22:35:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:18,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047265803] [2024-10-10 22:35:18,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-10 22:35:18,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:18,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047265803] [2024-10-10 22:35:18,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047265803] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:35:18,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408517910] [2024-10-10 22:35:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:18,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:18,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:35:18,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:35:18,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:35:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:18,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:35:18,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:35:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-10 22:35:18,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:35:18,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408517910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:18,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:35:18,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:35:18,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960974964] [2024-10-10 22:35:18,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:18,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:18,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:18,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:18,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:35:18,656 INFO L87 Difference]: Start difference. First operand 2422 states and 2894 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-10 22:35:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:19,128 INFO L93 Difference]: Finished difference Result 5403 states and 6528 transitions. [2024-10-10 22:35:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:19,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-10-10 22:35:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:19,130 INFO L225 Difference]: With dead ends: 5403 [2024-10-10 22:35:19,130 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:35:19,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:35:19,135 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 70 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:19,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 85 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:35:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:35:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:35:19,137 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-10 22:35:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:35:19,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 152 [2024-10-10 22:35:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:19,138 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:35:19,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-10 22:35:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:35:19,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:35:19,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:35:19,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 22:35:19,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:19,349 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:19,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:35:19,438 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:35:19,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:35:19 BoogieIcfgContainer [2024-10-10 22:35:19,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:35:19,460 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:35:19,460 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:35:19,460 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:35:19,460 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:12" (3/4) ... [2024-10-10 22:35:19,462 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:35:19,487 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 22:35:19,491 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:35:19,492 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:35:19,493 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:35:19,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:35:19,649 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:35:19,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:35:19,649 INFO L158 Benchmark]: Toolchain (without parser) took 8713.61ms. Allocated memory was 146.8MB in the beginning and 260.0MB in the end (delta: 113.2MB). Free memory was 90.6MB in the beginning and 203.6MB in the end (delta: -113.0MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2024-10-10 22:35:19,650 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 146.8MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:35:19,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.76ms. Allocated memory is still 146.8MB. Free memory was 90.6MB in the beginning and 114.9MB in the end (delta: -24.4MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-10-10 22:35:19,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.52ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 114.9MB in the beginning and 176.5MB in the end (delta: -61.6MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-10-10 22:35:19,650 INFO L158 Benchmark]: Boogie Preprocessor took 85.09ms. Allocated memory is still 209.7MB. Free memory was 176.5MB in the beginning and 171.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:35:19,650 INFO L158 Benchmark]: RCFGBuilder took 1201.26ms. Allocated memory is still 209.7MB. Free memory was 171.3MB in the beginning and 84.3MB in the end (delta: 87.0MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-10-10 22:35:19,651 INFO L158 Benchmark]: TraceAbstraction took 6556.55ms. Allocated memory was 209.7MB in the beginning and 260.0MB in the end (delta: 50.3MB). Free memory was 84.3MB in the beginning and 216.2MB in the end (delta: -131.9MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2024-10-10 22:35:19,651 INFO L158 Benchmark]: Witness Printer took 189.33ms. Allocated memory is still 260.0MB. Free memory was 216.2MB in the beginning and 203.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:35:19,653 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.20ms. Allocated memory is still 146.8MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.76ms. Allocated memory is still 146.8MB. Free memory was 90.6MB in the beginning and 114.9MB in the end (delta: -24.4MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.52ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 114.9MB in the beginning and 176.5MB in the end (delta: -61.6MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.09ms. Allocated memory is still 209.7MB. Free memory was 176.5MB in the beginning and 171.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1201.26ms. Allocated memory is still 209.7MB. Free memory was 171.3MB in the beginning and 84.3MB in the end (delta: 87.0MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6556.55ms. Allocated memory was 209.7MB in the beginning and 260.0MB in the end (delta: 50.3MB). Free memory was 84.3MB in the beginning and 216.2MB in the end (delta: -131.9MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. * Witness Printer took 189.33ms. Allocated memory is still 260.0MB. Free memory was 216.2MB in the beginning and 203.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 464]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1018 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1018 mSDsluCounter, 951 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 518 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2597 IncrementalHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 518 mSolverCounterUnsat, 860 mSDtfsCounter, 2597 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2422occurred in iteration=7, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 567 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1068 ConstructedInterpolants, 0 QuantifiedInterpolants, 2022 SizeOfPredicates, 0 NumberOfNonLiveVariables, 298 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 360/368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((a28 < 10) || ((8 <= a17) && (a28 == 10))) || (((8 <= a17) && (a11 == 0)) && (a25 != 1))) || ((a28 == 10) && (a25 != 1))) || (a19 == 1)) RESULT: Ultimate proved your program to be correct! [2024-10-10 22:35:19,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE