./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label43.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 409e906c97fdb83aebfefc37fd10289c280112661b5f3b33ba432f9c10381db1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:27:05,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:27:05,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:27:05,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:27:05,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:27:05,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:27:05,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:27:05,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:27:05,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:27:05,991 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:27:05,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:27:05,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:27:05,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:27:05,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:27:05,992 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:27:05,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:27:05,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:27:05,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:27:05,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:27:05,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:27:05,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:27:05,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:27:05,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:27:05,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:27:05,995 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:27:05,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:27:05,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:27:05,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:27:05,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:27:05,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:27:05,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:27:05,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:27:05,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:27:05,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:27:05,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:27:05,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:27:05,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:27:05,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:27:05,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:27:05,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:27:05,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:27:05,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:27:05,999 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 409e906c97fdb83aebfefc37fd10289c280112661b5f3b33ba432f9c10381db1 [2024-11-08 10:27:06,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:27:06,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:27:06,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:27:06,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:27:06,234 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:27:06,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label43.c [2024-11-08 10:27:07,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:27:07,722 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:27:07,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label43.c [2024-11-08 10:27:07,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d4cd877/14c0f41f33784308ae43b8d1e5bd003e/FLAG7c35310c3 [2024-11-08 10:27:08,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43d4cd877/14c0f41f33784308ae43b8d1e5bd003e [2024-11-08 10:27:08,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:27:08,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:27:08,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:27:08,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:27:08,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:27:08,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b8cd247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08, skipping insertion in model container [2024-11-08 10:27:08,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:27:08,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label43.c[21463,21476] [2024-11-08 10:27:08,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:27:08,405 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:27:08,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label43.c[21463,21476] [2024-11-08 10:27:08,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:27:08,496 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:27:08,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08 WrapperNode [2024-11-08 10:27:08,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:27:08,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:27:08,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:27:08,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:27:08,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,588 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-11-08 10:27:08,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:27:08,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:27:08,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:27:08,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:27:08,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,634 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:27:08,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:27:08,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:27:08,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:27:08,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:27:08,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (1/1) ... [2024-11-08 10:27:08,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:27:08,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:27:08,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:27:08,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:27:08,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:27:08,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:27:08,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:27:08,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:27:08,811 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:27:08,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:27:09,569 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 10:27:09,570 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:27:09,585 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:27:09,586 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:27:09,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:09 BoogieIcfgContainer [2024-11-08 10:27:09,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:27:09,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:27:09,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:27:09,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:27:09,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:27:08" (1/3) ... [2024-11-08 10:27:09,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536edeab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:09, skipping insertion in model container [2024-11-08 10:27:09,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:08" (2/3) ... [2024-11-08 10:27:09,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536edeab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:09, skipping insertion in model container [2024-11-08 10:27:09,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:09" (3/3) ... [2024-11-08 10:27:09,594 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label43.c [2024-11-08 10:27:09,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:27:09,607 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:27:09,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:27:09,665 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;@5cd124f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:27:09,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:27:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 10:27:09,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:09,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:09,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:09,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash -46355601, now seen corresponding path program 1 times [2024-11-08 10:27:09,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:09,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906222054] [2024-11-08 10:27:09,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:09,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:27:10,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:10,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906222054] [2024-11-08 10:27:10,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906222054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:10,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:10,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:10,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698342649] [2024-11-08 10:27:10,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:10,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:10,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:10,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:10,213 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:10,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:10,749 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2024-11-08 10:27:10,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:10,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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 128 [2024-11-08 10:27:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:10,758 INFO L225 Difference]: With dead ends: 528 [2024-11-08 10:27:10,759 INFO L226 Difference]: Without dead ends: 266 [2024-11-08 10:27:10,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:10,763 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 54 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:10,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 73 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:27:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-08 10:27:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-08 10:27:10,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.411320754716981) internal successors, (374), 265 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2024-11-08 10:27:10,802 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 128 [2024-11-08 10:27:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:10,802 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2024-11-08 10:27:10,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2024-11-08 10:27:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 10:27:10,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:10,805 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:10,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:27:10,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:10,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:10,806 INFO L85 PathProgramCache]: Analyzing trace with hash 140870055, now seen corresponding path program 1 times [2024-11-08 10:27:10,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:10,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79877954] [2024-11-08 10:27:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:10,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:27:11,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:11,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79877954] [2024-11-08 10:27:11,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79877954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:11,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183993773] [2024-11-08 10:27:11,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:11,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:11,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:11,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:11,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:11,047 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:11,361 INFO L93 Difference]: Finished difference Result 792 states and 1117 transitions. [2024-11-08 10:27:11,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:11,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 132 [2024-11-08 10:27:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:11,367 INFO L225 Difference]: With dead ends: 792 [2024-11-08 10:27:11,367 INFO L226 Difference]: Without dead ends: 528 [2024-11-08 10:27:11,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:11,369 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:11,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 31 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-08 10:27:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2024-11-08 10:27:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3434535104364327) internal successors, (708), 527 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2024-11-08 10:27:11,388 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 132 [2024-11-08 10:27:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:11,388 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2024-11-08 10:27:11,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2024-11-08 10:27:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 10:27:11,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:11,393 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:11,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:27:11,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:11,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2097622749, now seen corresponding path program 1 times [2024-11-08 10:27:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:11,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925657743] [2024-11-08 10:27:11,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:11,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:27:11,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:11,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925657743] [2024-11-08 10:27:11,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925657743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:11,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:11,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:11,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995088125] [2024-11-08 10:27:11,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:11,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:11,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:11,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:11,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:11,531 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:11,895 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2024-11-08 10:27:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:11,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2024-11-08 10:27:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:11,898 INFO L225 Difference]: With dead ends: 1316 [2024-11-08 10:27:11,898 INFO L226 Difference]: Without dead ends: 790 [2024-11-08 10:27:11,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:11,901 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:11,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 30 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-08 10:27:11,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2024-11-08 10:27:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3495440729483283) internal successors, (888), 658 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2024-11-08 10:27:11,919 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 162 [2024-11-08 10:27:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:11,920 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2024-11-08 10:27:11,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2024-11-08 10:27:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 10:27:11,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:11,928 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:11,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:27:11,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:11,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:11,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1868190631, now seen corresponding path program 1 times [2024-11-08 10:27:11,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:11,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090654868] [2024-11-08 10:27:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 10:27:12,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:12,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090654868] [2024-11-08 10:27:12,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090654868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:12,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:12,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:12,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760722700] [2024-11-08 10:27:12,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:12,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:12,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:12,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:12,114 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:12,405 INFO L93 Difference]: Finished difference Result 1316 states and 1774 transitions. [2024-11-08 10:27:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:12,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2024-11-08 10:27:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:12,407 INFO L225 Difference]: With dead ends: 1316 [2024-11-08 10:27:12,407 INFO L226 Difference]: Without dead ends: 659 [2024-11-08 10:27:12,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:12,413 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 132 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:12,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 62 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:12,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-08 10:27:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2024-11-08 10:27:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.3404255319148937) internal successors, (882), 658 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 882 transitions. [2024-11-08 10:27:12,441 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 882 transitions. Word has length 166 [2024-11-08 10:27:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:12,441 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 882 transitions. [2024-11-08 10:27:12,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 882 transitions. [2024-11-08 10:27:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 10:27:12,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:12,444 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:12,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:27:12,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:12,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1553416225, now seen corresponding path program 1 times [2024-11-08 10:27:12,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:12,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071909489] [2024-11-08 10:27:12,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:12,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 10:27:12,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:12,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071909489] [2024-11-08 10:27:12,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071909489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:12,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:12,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:27:12,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492025918] [2024-11-08 10:27:12,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:12,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:12,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:12,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:12,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:12,655 INFO L87 Difference]: Start difference. First operand 659 states and 882 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:12,950 INFO L93 Difference]: Finished difference Result 1578 states and 2090 transitions. [2024-11-08 10:27:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:12,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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 170 [2024-11-08 10:27:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:12,953 INFO L225 Difference]: With dead ends: 1578 [2024-11-08 10:27:12,953 INFO L226 Difference]: Without dead ends: 921 [2024-11-08 10:27:12,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:12,954 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:12,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 54 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-08 10:27:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2024-11-08 10:27:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2826086956521738) internal successors, (1180), 920 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1180 transitions. [2024-11-08 10:27:12,969 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1180 transitions. Word has length 170 [2024-11-08 10:27:12,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:12,969 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1180 transitions. [2024-11-08 10:27:12,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1180 transitions. [2024-11-08 10:27:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 10:27:12,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:27:12,972 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:27:12,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:27:12,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:27:12,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:27:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1345535171, now seen corresponding path program 1 times [2024-11-08 10:27:12,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:27:12,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250087607] [2024-11-08 10:27:12,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:27:12,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:27:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:27:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 10:27:13,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:27:13,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250087607] [2024-11-08 10:27:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250087607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:27:13,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:27:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:27:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103736313] [2024-11-08 10:27:13,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:27:13,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:27:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:27:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:27:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:13,096 INFO L87 Difference]: Start difference. First operand 921 states and 1180 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:27:13,433 INFO L93 Difference]: Finished difference Result 2493 states and 3156 transitions. [2024-11-08 10:27:13,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:27:13,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2024-11-08 10:27:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:27:13,434 INFO L225 Difference]: With dead ends: 2493 [2024-11-08 10:27:13,434 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:27:13,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:27:13,437 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:27:13,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 22 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:27:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:27:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:27:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:27:13,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 179 [2024-11-08 10:27:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:27:13,438 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:27:13,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:27:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:27:13,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:27:13,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:27:13,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:27:13,445 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 10:27:13,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:27:13,473 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:27:13,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:27:13 BoogieIcfgContainer [2024-11-08 10:27:13,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:27:13,492 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:27:13,492 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:27:13,492 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:27:13,493 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:09" (3/4) ... [2024-11-08 10:27:13,495 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:27:13,508 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:27:13,509 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:27:13,510 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:27:13,510 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:27:13,627 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:27:13,628 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:27:13,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:27:13,628 INFO L158 Benchmark]: Toolchain (without parser) took 5564.33ms. Allocated memory was 155.2MB in the beginning and 272.6MB in the end (delta: 117.4MB). Free memory was 97.8MB in the beginning and 149.8MB in the end (delta: -52.0MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2024-11-08 10:27:13,628 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:27:13,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.31ms. Allocated memory is still 155.2MB. Free memory was 97.8MB in the beginning and 68.0MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 10:27:13,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.08ms. Allocated memory was 155.2MB in the beginning and 222.3MB in the end (delta: 67.1MB). Free memory was 68.0MB in the beginning and 189.1MB in the end (delta: -121.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-08 10:27:13,629 INFO L158 Benchmark]: Boogie Preprocessor took 99.98ms. Allocated memory is still 222.3MB. Free memory was 189.1MB in the beginning and 184.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 10:27:13,629 INFO L158 Benchmark]: RCFGBuilder took 897.13ms. Allocated memory is still 222.3MB. Free memory was 184.1MB in the beginning and 99.2MB in the end (delta: 84.9MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-11-08 10:27:13,630 INFO L158 Benchmark]: TraceAbstraction took 3902.25ms. Allocated memory was 222.3MB in the beginning and 272.6MB in the end (delta: 50.3MB). Free memory was 98.2MB in the beginning and 161.4MB in the end (delta: -63.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:27:13,630 INFO L158 Benchmark]: Witness Printer took 135.64ms. Allocated memory is still 272.6MB. Free memory was 161.4MB in the beginning and 149.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:27:13,631 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.17ms. Allocated memory is still 155.2MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.31ms. Allocated memory is still 155.2MB. Free memory was 97.8MB in the beginning and 68.0MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.08ms. Allocated memory was 155.2MB in the beginning and 222.3MB in the end (delta: 67.1MB). Free memory was 68.0MB in the beginning and 189.1MB in the end (delta: -121.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.98ms. Allocated memory is still 222.3MB. Free memory was 189.1MB in the beginning and 184.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 897.13ms. Allocated memory is still 222.3MB. Free memory was 184.1MB in the beginning and 99.2MB in the end (delta: 84.9MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3902.25ms. Allocated memory was 222.3MB in the beginning and 272.6MB in the end (delta: 50.3MB). Free memory was 98.2MB in the beginning and 161.4MB in the end (delta: -63.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 135.64ms. Allocated memory is still 272.6MB. Free memory was 161.4MB in the beginning and 149.8MB in the end (delta: 11.5MB). 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: 570]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 629 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 629 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 453 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1981 IncrementalHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 453 mSolverCounterUnsat, 242 mSDtfsCounter, 1981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 131 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 937 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 1685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 235/235 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: 593]: Loop Invariant Derived loop invariant: (((a16 < 6) || ((a21 == 1) && (15 <= a8))) || (a20 == 1)) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:27:13,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE