./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df76811034b688387cfe28dd1eb6de91c21580662ac8ddb8163b41c1d6179172 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:21:14,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:21:14,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:21:14,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:21:14,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:21:14,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:21:14,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:21:14,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:21:14,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:21:14,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:21:14,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:21:14,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:21:14,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:21:14,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:21:14,692 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:21:14,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:21:14,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:21:14,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:21:14,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:21:14,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:21:14,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:21:14,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:21:14,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:21:14,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:21:14,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:21:14,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:21:14,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:21:14,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:21:14,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:21:14,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:21:14,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:21:14,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:21:14,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:21:14,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:21:14,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:21:14,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:21:14,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:21:14,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:21:14,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:21:14,698 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:21:14,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:21:14,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:21:14,699 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df76811034b688387cfe28dd1eb6de91c21580662ac8ddb8163b41c1d6179172 [2024-10-13 22:21:14,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:21:14,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:21:14,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:21:14,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:21:14,891 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:21:14,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c [2024-10-13 22:21:16,097 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:21:16,225 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:21:16,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c [2024-10-13 22:21:16,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3879e8c/9ae823affc7c449fa9937e253f108059/FLAGdc584f6da [2024-10-13 22:21:16,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3879e8c/9ae823affc7c449fa9937e253f108059 [2024-10-13 22:21:16,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:21:16,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:21:16,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:21:16,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:21:16,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:21:16,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd6ad8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16, skipping insertion in model container [2024-10-13 22:21:16,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:21:16,371 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/array-multidimensional/init-non-constant-3-u.c[333,346] [2024-10-13 22:21:16,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:21:16,389 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:21:16,397 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/array-multidimensional/init-non-constant-3-u.c[333,346] [2024-10-13 22:21:16,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:21:16,413 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:21:16,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16 WrapperNode [2024-10-13 22:21:16,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:21:16,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:21:16,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:21:16,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:21:16,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,451 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2024-10-13 22:21:16,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:21:16,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:21:16,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:21:16,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:21:16,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,472 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-13 22:21:16,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:21:16,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:21:16,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:21:16,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:21:16,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (1/1) ... [2024-10-13 22:21:16,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:21:16,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:21:16,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 22:21:16,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 22:21:16,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:21:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:21:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 22:21:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 22:21:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 22:21:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 22:21:16,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:21:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:21:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 22:21:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 22:21:16,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 22:21:16,630 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:21:16,632 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:21:16,773 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-13 22:21:16,773 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:21:16,798 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:21:16,798 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-13 22:21:16,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:21:16 BoogieIcfgContainer [2024-10-13 22:21:16,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:21:16,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:21:16,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:21:16,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:21:16,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:21:16" (1/3) ... [2024-10-13 22:21:16,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6f3e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:21:16, skipping insertion in model container [2024-10-13 22:21:16,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:16" (2/3) ... [2024-10-13 22:21:16,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6f3e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:21:16, skipping insertion in model container [2024-10-13 22:21:16,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:21:16" (3/3) ... [2024-10-13 22:21:16,808 INFO L112 eAbstractionObserver]: Analyzing ICFG init-non-constant-3-u.c [2024-10-13 22:21:16,819 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:21:16,820 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:21:16,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:21:16,877 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;@37b26ccb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:21:16,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:21:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 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-13 22:21:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 22:21:16,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:21:16,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:21:16,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:21:16,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:21:16,889 INFO L85 PathProgramCache]: Analyzing trace with hash -526685124, now seen corresponding path program 1 times [2024-10-13 22:21:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:21:16,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138471212] [2024-10-13 22:21:16,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:21:16,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:21:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:21:16,999 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-13 22:21:16,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:21:17,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138471212] [2024-10-13 22:21:17,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138471212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:21:17,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:21:17,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:21:17,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290726064] [2024-10-13 22:21:17,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:21:17,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 22:21:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:21:17,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 22:21:17,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:21:17,022 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-13 22:21:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:21:17,043 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2024-10-13 22:21:17,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 22:21:17,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-10-13 22:21:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:21:17,050 INFO L225 Difference]: With dead ends: 35 [2024-10-13 22:21:17,050 INFO L226 Difference]: Without dead ends: 16 [2024-10-13 22:21:17,052 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-13 22:21:17,054 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:21:17,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:21:17,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-13 22:21:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-13 22:21:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 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-13 22:21:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2024-10-13 22:21:17,078 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 8 [2024-10-13 22:21:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:21:17,078 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2024-10-13 22:21:17,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-13 22:21:17,079 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2024-10-13 22:21:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 22:21:17,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:21:17,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:21:17,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:21:17,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:21:17,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:21:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1381991778, now seen corresponding path program 1 times [2024-10-13 22:21:17,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:21:17,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26254499] [2024-10-13 22:21:17,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:21:17,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:21:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:21:17,202 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-13 22:21:17,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:21:17,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26254499] [2024-10-13 22:21:17,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26254499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:21:17,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:21:17,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:21:17,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412017923] [2024-10-13 22:21:17,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:21:17,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:21:17,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:21:17,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:21:17,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:21:17,208 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-13 22:21:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:21:17,241 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2024-10-13 22:21:17,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:21:17,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-10-13 22:21:17,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:21:17,242 INFO L225 Difference]: With dead ends: 31 [2024-10-13 22:21:17,242 INFO L226 Difference]: Without dead ends: 21 [2024-10-13 22:21:17,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:21:17,244 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:21:17,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:21:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-13 22:21:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2024-10-13 22:21:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-13 22:21:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-10-13 22:21:17,248 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 8 [2024-10-13 22:21:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:21:17,248 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-13 22:21:17,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-13 22:21:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2024-10-13 22:21:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 22:21:17,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:21:17,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:21:17,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:21:17,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:21:17,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:21:17,253 INFO L85 PathProgramCache]: Analyzing trace with hash -236778402, now seen corresponding path program 1 times [2024-10-13 22:21:17,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:21:17,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933914287] [2024-10-13 22:21:17,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:21:17,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:21:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:21:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:21:17,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:21:17,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933914287] [2024-10-13 22:21:17,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933914287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:21:17,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:21:17,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:21:17,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416838229] [2024-10-13 22:21:17,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:21:17,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:21:17,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:21:17,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:21:17,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:21:17,397 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-13 22:21:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:21:17,437 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2024-10-13 22:21:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:21:17,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-10-13 22:21:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:21:17,438 INFO L225 Difference]: With dead ends: 42 [2024-10-13 22:21:17,439 INFO L226 Difference]: Without dead ends: 27 [2024-10-13 22:21:17,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-13 22:21:17,439 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:21:17,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 14 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:21:17,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-13 22:21:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2024-10-13 22:21:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-13 22:21:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2024-10-13 22:21:17,446 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 11 [2024-10-13 22:21:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:21:17,446 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2024-10-13 22:21:17,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-13 22:21:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2024-10-13 22:21:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 22:21:17,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:21:17,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:21:17,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:21:17,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:21:17,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:21:17,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1385813380, now seen corresponding path program 1 times [2024-10-13 22:21:17,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:21:17,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45802177] [2024-10-13 22:21:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:21:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:21:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:21:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:21:17,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:21:17,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45802177] [2024-10-13 22:21:17,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45802177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:21:17,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:21:17,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:21:17,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716780769] [2024-10-13 22:21:17,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:21:17,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:21:17,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:21:17,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:21:17,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:21:17,530 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-13 22:21:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:21:17,572 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-10-13 22:21:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:21:17,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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) Word has length 14 [2024-10-13 22:21:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:21:17,573 INFO L225 Difference]: With dead ends: 42 [2024-10-13 22:21:17,573 INFO L226 Difference]: Without dead ends: 25 [2024-10-13 22:21:17,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-13 22:21:17,574 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:21:17,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 16 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:21:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-13 22:21:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2024-10-13 22:21:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-13 22:21:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-10-13 22:21:17,580 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 14 [2024-10-13 22:21:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:21:17,580 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-13 22:21:17,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-13 22:21:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-10-13 22:21:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 22:21:17,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:21:17,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:21:17,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:21:17,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:21:17,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:21:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1868918897, now seen corresponding path program 1 times [2024-10-13 22:21:17,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:21:17,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000586295] [2024-10-13 22:21:17,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:21:17,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:21:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:21:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:21:17,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:21:17,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000586295] [2024-10-13 22:21:17,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000586295] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:21:17,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375585238] [2024-10-13 22:21:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:21:17,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:21:17,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:21:17,658 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:21:17,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 22:21:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:21:17,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 22:21:17,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:21:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:21:17,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:21:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:21:17,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375585238] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:21:17,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:21:17,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-13 22:21:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721003074] [2024-10-13 22:21:17,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:21:17,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 22:21:17,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:21:17,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 22:21:17,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-13 22:21:17,801 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-13 22:21:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:21:17,900 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2024-10-13 22:21:17,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 22:21:17,901 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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 15 [2024-10-13 22:21:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:21:17,901 INFO L225 Difference]: With dead ends: 58 [2024-10-13 22:21:17,901 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 22:21:17,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-10-13 22:21:17,902 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 88 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:21:17,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 35 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:21:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 22:21:17,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2024-10-13 22:21:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 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-13 22:21:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-10-13 22:21:17,907 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 15 [2024-10-13 22:21:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:21:17,908 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-13 22:21:17,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-13 22:21:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-10-13 22:21:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 22:21:17,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:21:17,908 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:21:17,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 22:21:18,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:21:18,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:21:18,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:21:18,110 INFO L85 PathProgramCache]: Analyzing trace with hash 165697340, now seen corresponding path program 2 times [2024-10-13 22:21:18,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:21:18,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47761278] [2024-10-13 22:21:18,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:21:18,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:21:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:21:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 22:21:18,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:21:18,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47761278] [2024-10-13 22:21:18,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47761278] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:21:18,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928479546] [2024-10-13 22:21:18,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 22:21:18,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:21:18,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:21:18,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:21:18,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 22:21:18,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 22:21:18,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:21:18,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 22:21:18,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:21:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:21:18,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:21:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:21:18,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928479546] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:21:18,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:21:18,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2024-10-13 22:21:18,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316961894] [2024-10-13 22:21:18,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:21:18,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 22:21:18,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:21:18,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 22:21:18,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-10-13 22:21:18,393 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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-13 22:21:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:21:18,901 INFO L93 Difference]: Finished difference Result 236 states and 291 transitions. [2024-10-13 22:21:18,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-13 22:21:18,902 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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 18 [2024-10-13 22:21:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:21:18,903 INFO L225 Difference]: With dead ends: 236 [2024-10-13 22:21:18,904 INFO L226 Difference]: Without dead ends: 205 [2024-10-13 22:21:18,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2024-10-13 22:21:18,906 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 759 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:21:18,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 57 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:21:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-13 22:21:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 103. [2024-10-13 22:21:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 102 states have internal predecessors, (129), 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-13 22:21:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2024-10-13 22:21:18,932 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 18 [2024-10-13 22:21:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:21:18,932 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2024-10-13 22:21:18,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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-13 22:21:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2024-10-13 22:21:18,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 22:21:18,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:21:18,934 INFO L215 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:21:18,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 22:21:19,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 22:21:19,135 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:21:19,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:21:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2053749022, now seen corresponding path program 3 times [2024-10-13 22:21:19,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:21:19,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432077165] [2024-10-13 22:21:19,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:21:19,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:21:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:21:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-13 22:21:19,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:21:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432077165] [2024-10-13 22:21:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432077165] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:21:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858076463] [2024-10-13 22:21:19,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 22:21:19,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:21:19,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:21:19,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:21:19,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 22:21:19,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 22:21:19,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:21:19,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 22:21:19,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:21:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-13 22:21:19,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:21:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-13 22:21:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858076463] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:21:19,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:21:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-10-13 22:21:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088813313] [2024-10-13 22:21:19,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:21:19,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 22:21:19,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:21:19,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 22:21:19,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-13 22:21:19,491 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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-13 22:21:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:21:19,552 INFO L93 Difference]: Finished difference Result 262 states and 322 transitions. [2024-10-13 22:21:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:21:19,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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 37 [2024-10-13 22:21:19,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:21:19,555 INFO L225 Difference]: With dead ends: 262 [2024-10-13 22:21:19,557 INFO L226 Difference]: Without dead ends: 190 [2024-10-13 22:21:19,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-13 22:21:19,558 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:21:19,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 22 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:21:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-13 22:21:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-10-13 22:21:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.1904761904761905) internal successors, (225), 189 states have internal predecessors, (225), 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-13 22:21:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 225 transitions. [2024-10-13 22:21:19,586 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 225 transitions. Word has length 37 [2024-10-13 22:21:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:21:19,586 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 225 transitions. [2024-10-13 22:21:19,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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-13 22:21:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 225 transitions. [2024-10-13 22:21:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 22:21:19,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:21:19,589 INFO L215 NwaCegarLoop]: trace histogram [80, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:21:19,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 22:21:19,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:21:19,790 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:21:19,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:21:19,790 INFO L85 PathProgramCache]: Analyzing trace with hash -296117602, now seen corresponding path program 4 times [2024-10-13 22:21:19,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:21:19,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958454588] [2024-10-13 22:21:19,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:21:19,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:21:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:21:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3938 backedges. 862 proven. 55 refuted. 0 times theorem prover too weak. 3021 trivial. 0 not checked. [2024-10-13 22:21:20,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:21:20,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958454588] [2024-10-13 22:21:20,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958454588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:21:20,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014210275] [2024-10-13 22:21:20,321 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 22:21:20,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:21:20,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:21:20,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:21:20,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 22:21:20,472 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 22:21:20,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:21:20,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 22:21:20,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:21:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3938 backedges. 1540 proven. 135 refuted. 0 times theorem prover too weak. 2263 trivial. 0 not checked. [2024-10-13 22:21:20,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:21:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3938 backedges. 1540 proven. 135 refuted. 0 times theorem prover too weak. 2263 trivial. 0 not checked. [2024-10-13 22:21:20,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014210275] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:21:20,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:21:20,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 42 [2024-10-13 22:21:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926882306] [2024-10-13 22:21:20,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:21:20,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-13 22:21:20,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:21:20,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-13 22:21:20,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1358, Unknown=0, NotChecked=0, Total=1722 [2024-10-13 22:21:20,950 INFO L87 Difference]: Start difference. First operand 190 states and 225 transitions. Second operand has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 42 states have internal predecessors, (67), 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-13 22:21:23,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:21:23,256 INFO L93 Difference]: Finished difference Result 1020 states and 1155 transitions. [2024-10-13 22:21:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-10-13 22:21:23,257 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 42 states have internal predecessors, (67), 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 124 [2024-10-13 22:21:23,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:21:23,259 INFO L225 Difference]: With dead ends: 1020 [2024-10-13 22:21:23,259 INFO L226 Difference]: Without dead ends: 844 [2024-10-13 22:21:23,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5560 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3896, Invalid=12874, Unknown=0, NotChecked=0, Total=16770 [2024-10-13 22:21:23,268 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 3211 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3211 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:21:23,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3211 Valid, 300 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:21:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-10-13 22:21:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 664. [2024-10-13 22:21:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.1779788838612368) internal successors, (781), 663 states have internal predecessors, (781), 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-13 22:21:23,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 781 transitions. [2024-10-13 22:21:23,326 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 781 transitions. Word has length 124 [2024-10-13 22:21:23,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:21:23,326 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 781 transitions. [2024-10-13 22:21:23,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 42 states have internal predecessors, (67), 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-13 22:21:23,326 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 781 transitions. [2024-10-13 22:21:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2024-10-13 22:21:23,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:21:23,333 INFO L215 NwaCegarLoop]: trace histogram [308, 28, 28, 28, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:21:23,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 22:21:23,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:21:23,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:21:23,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:21:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash -294011042, now seen corresponding path program 5 times [2024-10-13 22:21:23,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:21:23,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072217548] [2024-10-13 22:21:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:21:23,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:21:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:21:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 57170 backedges. 3923 proven. 66 refuted. 0 times theorem prover too weak. 53181 trivial. 0 not checked. [2024-10-13 22:21:24,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:21:24,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072217548] [2024-10-13 22:21:24,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072217548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:21:24,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475907172] [2024-10-13 22:21:24,855 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 22:21:24,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:21:24,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:21:24,856 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:21:24,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process