./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/linear_search.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/loops/linear_search.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 5daf86ff8189a9471a20a947a9c78ff63bc56ed2dde2c379166a5ef7ff47fae4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:47:06,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:47:06,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:47:06,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:47:06,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:47:06,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:47:06,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:47:06,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:47:06,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:47:06,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:47:06,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:47:06,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:47:06,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:47:06,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:47:06,602 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:47:06,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:47:06,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:47:06,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:47:06,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:47:06,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:47:06,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:47:06,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:47:06,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:47:06,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:47:06,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:47:06,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:47:06,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:47:06,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:47:06,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:47:06,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:47:06,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:47:06,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:47:06,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:47:06,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:47:06,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:47:06,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:47:06,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:47:06,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:47:06,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:47:06,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:47:06,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:47:06,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:47:06,612 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 -> 5daf86ff8189a9471a20a947a9c78ff63bc56ed2dde2c379166a5ef7ff47fae4 [2024-10-11 01:47:06,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:47:06,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:47:06,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:47:06,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:47:06,864 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:47:06,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/linear_search.c [2024-10-11 01:47:08,149 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:47:08,315 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:47:08,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/linear_search.c [2024-10-11 01:47:08,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6c845927b/8f89e8b8ab054413a87141227008eaca/FLAG7da07881d [2024-10-11 01:47:08,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6c845927b/8f89e8b8ab054413a87141227008eaca [2024-10-11 01:47:08,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:47:08,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:47:08,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:47:08,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:47:08,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:47:08,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:47:08" (1/1) ... [2024-10-11 01:47:08,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2837c315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:08, skipping insertion in model container [2024-10-11 01:47:08,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:47:08" (1/1) ... [2024-10-11 01:47:08,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:47:08,948 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/loops/linear_search.c[383,396] [2024-10-11 01:47:08,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:47:08,990 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:47:09,002 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/loops/linear_search.c[383,396] [2024-10-11 01:47:09,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:47:09,031 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:47:09,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09 WrapperNode [2024-10-11 01:47:09,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:47:09,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:47:09,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:47:09,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:47:09,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (1/1) ... [2024-10-11 01:47:09,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (1/1) ... [2024-10-11 01:47:09,067 INFO L138 Inliner]: procedures = 17, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 58 [2024-10-11 01:47:09,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:47:09,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:47:09,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:47:09,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:47:09,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (1/1) ... [2024-10-11 01:47:09,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (1/1) ... [2024-10-11 01:47:09,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (1/1) ... [2024-10-11 01:47:09,093 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-10-11 01:47:09,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (1/1) ... [2024-10-11 01:47:09,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (1/1) ... [2024-10-11 01:47:09,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (1/1) ... [2024-10-11 01:47:09,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (1/1) ... [2024-10-11 01:47:09,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (1/1) ... [2024-10-11 01:47:09,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (1/1) ... [2024-10-11 01:47:09,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:47:09,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:47:09,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:47:09,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:47:09,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (1/1) ... [2024-10-11 01:47:09,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:47:09,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:47:09,144 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-11 01:47:09,149 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-11 01:47:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:47:09,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:47:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:47:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:47:09,259 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:47:09,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:47:09,422 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 01:47:09,423 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:47:09,458 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:47:09,458 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 01:47:09,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:47:09 BoogieIcfgContainer [2024-10-11 01:47:09,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:47:09,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:47:09,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:47:09,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:47:09,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:47:08" (1/3) ... [2024-10-11 01:47:09,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6650afd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:47:09, skipping insertion in model container [2024-10-11 01:47:09,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:09" (2/3) ... [2024-10-11 01:47:09,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6650afd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:47:09, skipping insertion in model container [2024-10-11 01:47:09,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:47:09" (3/3) ... [2024-10-11 01:47:09,467 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_search.c [2024-10-11 01:47:09,484 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:47:09,484 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:47:09,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:47:09,542 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;@667a8950, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:47:09,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:47:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 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-11 01:47:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 01:47:09,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:09,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:47:09,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1564981187, now seen corresponding path program 1 times [2024-10-11 01:47:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:09,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521838074] [2024-10-11 01:47:09,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:09,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:09,758 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-11 01:47:09,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:09,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521838074] [2024-10-11 01:47:09,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521838074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:47:09,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:47:09,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:47:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019919617] [2024-10-11 01:47:09,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:47:09,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:47:09,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:09,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:47:09,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:47:09,790 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-11 01:47:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:09,815 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2024-10-11 01:47:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:47:09,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-11 01:47:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:09,825 INFO L225 Difference]: With dead ends: 22 [2024-10-11 01:47:09,826 INFO L226 Difference]: Without dead ends: 11 [2024-10-11 01:47:09,829 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-11 01:47:09,832 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:09,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:47:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-11 01:47:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-11 01:47:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-11 01:47:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-10-11 01:47:09,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 7 [2024-10-11 01:47:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:09,870 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2024-10-11 01:47:09,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-11 01:47:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2024-10-11 01:47:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:47:09,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:09,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:47:09,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:47:09,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:09,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:09,874 INFO L85 PathProgramCache]: Analyzing trace with hash 493506260, now seen corresponding path program 1 times [2024-10-11 01:47:09,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:09,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266577473] [2024-10-11 01:47:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:10,057 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-11 01:47:10,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:10,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266577473] [2024-10-11 01:47:10,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266577473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:47:10,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:47:10,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:47:10,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197979942] [2024-10-11 01:47:10,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:47:10,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:47:10,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:10,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:47:10,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:47:10,060 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-11 01:47:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:10,078 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2024-10-11 01:47:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:47:10,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-10-11 01:47:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:10,079 INFO L225 Difference]: With dead ends: 15 [2024-10-11 01:47:10,079 INFO L226 Difference]: Without dead ends: 11 [2024-10-11 01:47:10,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:47:10,080 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:10,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:47:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-11 01:47:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-11 01:47:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-11 01:47:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2024-10-11 01:47:10,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2024-10-11 01:47:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:10,086 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-10-11 01:47:10,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-11 01:47:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2024-10-11 01:47:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:47:10,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:10,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:47:10,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:47:10,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:10,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:10,088 INFO L85 PathProgramCache]: Analyzing trace with hash 493565842, now seen corresponding path program 1 times [2024-10-11 01:47:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:10,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913002731] [2024-10-11 01:47:10,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:10,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:10,247 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-11 01:47:10,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:10,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913002731] [2024-10-11 01:47:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913002731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:47:10,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:47:10,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:47:10,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485661838] [2024-10-11 01:47:10,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:47:10,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:47:10,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:10,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:47:10,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:47:10,249 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-11 01:47:10,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:10,275 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2024-10-11 01:47:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:47:10,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-10-11 01:47:10,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:10,276 INFO L225 Difference]: With dead ends: 19 [2024-10-11 01:47:10,276 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 01:47:10,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11 01:47:10,277 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:10,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:47:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 01:47:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 01:47:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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-11 01:47:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2024-10-11 01:47:10,285 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2024-10-11 01:47:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:10,285 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-10-11 01:47:10,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-11 01:47:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2024-10-11 01:47:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 01:47:10,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:10,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:47:10,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:47:10,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:10,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1891169386, now seen corresponding path program 1 times [2024-10-11 01:47:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:10,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485536978] [2024-10-11 01:47:10,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:10,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:10,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485536978] [2024-10-11 01:47:10,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485536978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:47:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:47:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:47:10,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837901942] [2024-10-11 01:47:10,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:47:10,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:47:10,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:47:10,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:47:10,337 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11 01:47:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:10,358 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-10-11 01:47:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:47:10,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-10-11 01:47:10,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:10,359 INFO L225 Difference]: With dead ends: 25 [2024-10-11 01:47:10,360 INFO L226 Difference]: Without dead ends: 15 [2024-10-11 01:47:10,361 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-11 01:47:10,361 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:10,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:47:10,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-11 01:47:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-11 01:47:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-11 01:47:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-10-11 01:47:10,365 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 13 [2024-10-11 01:47:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:10,365 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-11 01:47:10,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11 01:47:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-10-11 01:47:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 01:47:10,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:10,367 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:47:10,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:47:10,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:10,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:10,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2010770900, now seen corresponding path program 1 times [2024-10-11 01:47:10,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:10,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464341707] [2024-10-11 01:47:10,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:10,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:10,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:10,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464341707] [2024-10-11 01:47:10,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464341707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:47:10,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:47:10,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:47:10,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240000397] [2024-10-11 01:47:10,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:47:10,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:47:10,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:10,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:47:10,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:47:10,490 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11 01:47:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:10,524 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-10-11 01:47:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:47:10,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-10-11 01:47:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:10,526 INFO L225 Difference]: With dead ends: 31 [2024-10-11 01:47:10,526 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 01:47:10,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:47:10,527 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:10,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 12 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:47:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 01:47:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2024-10-11 01:47:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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-11 01:47:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-10-11 01:47:10,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2024-10-11 01:47:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:10,533 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-10-11 01:47:10,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11 01:47:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-10-11 01:47:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 01:47:10,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:10,534 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:47:10,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:47:10,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:10,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1474849770, now seen corresponding path program 1 times [2024-10-11 01:47:10,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:10,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010259003] [2024-10-11 01:47:10,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:10,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:10,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:10,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010259003] [2024-10-11 01:47:10,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010259003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:47:10,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746893345] [2024-10-11 01:47:10,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:10,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:10,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:47:10,684 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-11 01:47:10,685 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-11 01:47:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:10,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 01:47:10,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:47:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:10,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:47:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:10,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746893345] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:47:10,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:47:10,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 8 [2024-10-11 01:47:10,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762514845] [2024-10-11 01:47:10,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:47:10,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 01:47:10,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:10,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 01:47:10,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:47:10,969 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-11 01:47:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:11,019 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-10-11 01:47:11,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:47:11,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 13 [2024-10-11 01:47:11,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:11,022 INFO L225 Difference]: With dead ends: 25 [2024-10-11 01:47:11,022 INFO L226 Difference]: Without dead ends: 19 [2024-10-11 01:47:11,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:47:11,023 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:11,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:47:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-11 01:47:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-11 01:47:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-11 01:47:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-10-11 01:47:11,030 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2024-10-11 01:47:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:11,031 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-11 01:47:11,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-11 01:47:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-10-11 01:47:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 01:47:11,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:11,033 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:47:11,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:47:11,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:11,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:11,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:11,234 INFO L85 PathProgramCache]: Analyzing trace with hash 499210884, now seen corresponding path program 1 times [2024-10-11 01:47:11,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:11,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878172942] [2024-10-11 01:47:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:11,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:11,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878172942] [2024-10-11 01:47:11,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878172942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:47:11,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390122998] [2024-10-11 01:47:11,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:11,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:11,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:47:11,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:47:11,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:47:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:11,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 01:47:11,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:47:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:11,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:47:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:11,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390122998] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:47:11,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:47:11,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-11 01:47:11,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155305064] [2024-10-11 01:47:11,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:47:11,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 01:47:11,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:11,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 01:47:11,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:47:11,439 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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-11 01:47:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:11,527 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2024-10-11 01:47:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:47:11,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 17 [2024-10-11 01:47:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:11,529 INFO L225 Difference]: With dead ends: 48 [2024-10-11 01:47:11,529 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 01:47:11,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:47:11,530 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:11,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 28 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:47:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 01:47:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2024-10-11 01:47:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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-11 01:47:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-11 01:47:11,539 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2024-10-11 01:47:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:11,539 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-11 01:47:11,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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-11 01:47:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-11 01:47:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 01:47:11,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:11,540 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:47:11,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:47:11,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:11,745 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:11,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:11,745 INFO L85 PathProgramCache]: Analyzing trace with hash -310135742, now seen corresponding path program 2 times [2024-10-11 01:47:11,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:11,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795635840] [2024-10-11 01:47:11,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:11,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:15,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:15,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795635840] [2024-10-11 01:47:15,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795635840] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:47:15,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747123189] [2024-10-11 01:47:15,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:47:15,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:15,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:47:15,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:47:15,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:47:15,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:47:15,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:47:15,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 01:47:15,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:47:15,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 01:47:16,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-10-11 01:47:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:16,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:47:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:18,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747123189] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:47:18,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:47:18,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 12] total 27 [2024-10-11 01:47:18,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157447873] [2024-10-11 01:47:18,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:47:18,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 01:47:18,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:18,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 01:47:18,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2024-10-11 01:47:18,205 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 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-11 01:47:42,380 WARN L286 SmtUtils]: Spent 21.38s on a formula simplification. DAG size of input: 66 DAG size of output: 65 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 01:47:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:42,991 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2024-10-11 01:47:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 01:47:42,992 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 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 17 [2024-10-11 01:47:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:42,993 INFO L225 Difference]: With dead ends: 58 [2024-10-11 01:47:42,993 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 01:47:42,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=677, Invalid=2185, Unknown=0, NotChecked=0, Total=2862 [2024-10-11 01:47:42,994 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 110 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:42,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 34 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 01:47:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 01:47:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2024-10-11 01:47:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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-11 01:47:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-11 01:47:43,004 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 17 [2024-10-11 01:47:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:43,005 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-11 01:47:43,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 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-11 01:47:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-11 01:47:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 01:47:43,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:43,005 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:47:43,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 01:47:43,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:43,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:43,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:43,207 INFO L85 PathProgramCache]: Analyzing trace with hash 922931124, now seen corresponding path program 1 times [2024-10-11 01:47:43,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:43,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415216900] [2024-10-11 01:47:43,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:43,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 01:47:44,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:44,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415216900] [2024-10-11 01:47:44,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415216900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:47:44,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901637611] [2024-10-11 01:47:44,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:44,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:44,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:47:44,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:47:44,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:47:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:44,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 01:47:44,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:47:44,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 01:47:45,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2024-10-11 01:47:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:45,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:47:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:45,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901637611] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:47:45,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:47:45,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2024-10-11 01:47:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342242881] [2024-10-11 01:47:45,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:47:45,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 01:47:45,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:45,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 01:47:45,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-10-11 01:47:45,957 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 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-11 01:47:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:46,880 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-10-11 01:47:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 01:47:46,880 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 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 25 [2024-10-11 01:47:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:46,881 INFO L225 Difference]: With dead ends: 54 [2024-10-11 01:47:46,881 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 01:47:46,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=345, Invalid=915, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 01:47:46,882 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:46,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 37 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 01:47:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 01:47:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2024-10-11 01:47:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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-11 01:47:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-10-11 01:47:46,889 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 25 [2024-10-11 01:47:46,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:46,890 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-10-11 01:47:46,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 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-11 01:47:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-10-11 01:47:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 01:47:46,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:46,891 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:47:46,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 01:47:47,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 01:47:47,091 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:47,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash 375784778, now seen corresponding path program 3 times [2024-10-11 01:47:47,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:47,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313386609] [2024-10-11 01:47:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:47,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:49,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:49,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313386609] [2024-10-11 01:47:49,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313386609] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:47:49,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552338859] [2024-10-11 01:47:49,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 01:47:49,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:49,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:47:49,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:47:49,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:47:49,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 01:47:49,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:47:49,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-11 01:47:49,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:47:49,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 01:47:50,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2024-10-11 01:47:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:51,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:48:18,266 WARN L286 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)