./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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/nla-digbench-scaling/fermat1-ll_unwindbound50.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 ca2134f8a32f49a0943527ee47fd89b4eb01286294fd09a8197c7c707de74c1d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:18:42,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:18:42,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:18:42,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:18:42,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:18:42,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:18:42,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:18:42,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:18:42,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:18:42,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:18:42,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:18:42,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:18:42,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:18:42,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:18:42,643 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:18:42,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:18:42,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:18:42,644 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:18:42,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:18:42,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:18:42,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:18:42,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:18:42,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:18:42,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:18:42,651 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:18:42,651 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:18:42,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:18:42,651 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:18:42,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:18:42,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:18:42,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:18:42,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:18:42,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:18:42,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:18:42,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:18:42,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:18:42,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:18:42,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:18:42,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:18:42,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:18:42,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:18:42,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:18:42,657 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 -> ca2134f8a32f49a0943527ee47fd89b4eb01286294fd09a8197c7c707de74c1d [2024-11-19 21:18:42,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:18:42,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:18:42,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:18:42,902 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:18:42,902 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:18:42,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2024-11-19 21:18:44,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:18:44,316 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:18:44,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2024-11-19 21:18:44,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13f87bce/ee488aecc8ad4bb7985c9aa752211d96/FLAG180065bd9 [2024-11-19 21:18:44,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13f87bce/ee488aecc8ad4bb7985c9aa752211d96 [2024-11-19 21:18:44,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:18:44,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:18:44,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:18:44,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:18:44,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:18:44,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a13c8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:44, skipping insertion in model container [2024-11-19 21:18:44,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:18:44" (1/1) ... [2024-11-19 21:18:44,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:18:44,886 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c[535,548] [2024-11-19 21:18:44,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:18:44,921 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:18:44,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c[535,548] [2024-11-19 21:18:44,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:18:45,009 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:18:45,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45 WrapperNode [2024-11-19 21:18:45,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:18:45,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:18:45,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:18:45,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:18:45,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (1/1) ... [2024-11-19 21:18:45,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (1/1) ... [2024-11-19 21:18:45,051 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2024-11-19 21:18:45,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:18:45,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:18:45,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:18:45,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:18:45,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (1/1) ... [2024-11-19 21:18:45,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (1/1) ... [2024-11-19 21:18:45,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (1/1) ... [2024-11-19 21:18:45,075 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 21:18:45,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (1/1) ... [2024-11-19 21:18:45,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (1/1) ... [2024-11-19 21:18:45,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (1/1) ... [2024-11-19 21:18:45,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (1/1) ... [2024-11-19 21:18:45,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (1/1) ... [2024-11-19 21:18:45,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (1/1) ... [2024-11-19 21:18:45,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:18:45,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:18:45,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:18:45,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:18:45,084 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (1/1) ... [2024-11-19 21:18:45,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:18:45,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:45,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 21:18:45,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 21:18:45,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:18:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 21:18:45,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 21:18:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:18:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:18:45,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:18:45,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 21:18:45,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 21:18:45,204 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:18:45,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:18:45,362 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-19 21:18:45,364 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:18:45,375 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:18:45,376 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 21:18:45,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:18:45 BoogieIcfgContainer [2024-11-19 21:18:45,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:18:45,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:18:45,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:18:45,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:18:45,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:18:44" (1/3) ... [2024-11-19 21:18:45,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c37e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:18:45, skipping insertion in model container [2024-11-19 21:18:45,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:18:45" (2/3) ... [2024-11-19 21:18:45,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c37e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:18:45, skipping insertion in model container [2024-11-19 21:18:45,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:18:45" (3/3) ... [2024-11-19 21:18:45,385 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound50.c [2024-11-19 21:18:45,398 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:18:45,398 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:18:45,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:18:45,456 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;@6f3cabe1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:18:45,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:18:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 21:18:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 21:18:45,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:45,466 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:45,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:45,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:45,472 INFO L85 PathProgramCache]: Analyzing trace with hash 738208203, now seen corresponding path program 1 times [2024-11-19 21:18:45,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:45,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289974168] [2024-11-19 21:18:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:45,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:45,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:45,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:45,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289974168] [2024-11-19 21:18:45,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289974168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:45,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:45,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 21:18:45,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153411141] [2024-11-19 21:18:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:45,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:18:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:18:45,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 21:18:45,660 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 21:18:45,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:45,677 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2024-11-19 21:18:45,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:18:45,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-19 21:18:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:45,684 INFO L225 Difference]: With dead ends: 61 [2024-11-19 21:18:45,684 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 21:18:45,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-11-19 21:18:45,690 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:45,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 21:18:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 21:18:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 21:18:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-11-19 21:18:45,723 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2024-11-19 21:18:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:45,724 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-11-19 21:18:45,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 21:18:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-11-19 21:18:45,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 21:18:45,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:45,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:45,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 21:18:45,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:45,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:45,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1770759922, now seen corresponding path program 1 times [2024-11-19 21:18:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:45,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590808466] [2024-11-19 21:18:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:45,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:45,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:45,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:45,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:45,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590808466] [2024-11-19 21:18:45,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590808466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:45,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:45,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 21:18:45,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984283095] [2024-11-19 21:18:45,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:45,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 21:18:45,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:45,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 21:18:45,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 21:18:45,894 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 21:18:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:45,920 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-11-19 21:18:45,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 21:18:45,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-19 21:18:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:45,922 INFO L225 Difference]: With dead ends: 37 [2024-11-19 21:18:45,922 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 21:18:45,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-19 21:18:45,924 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 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-11-19 21:18:45,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 21:18:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-19 21:18:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 21:18:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2024-11-19 21:18:45,933 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2024-11-19 21:18:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:45,934 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2024-11-19 21:18:45,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 21:18:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-11-19 21:18:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 21:18:45,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:45,936 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:45,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 21:18:45,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:45,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1769091626, now seen corresponding path program 1 times [2024-11-19 21:18:45,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:45,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021281724] [2024-11-19 21:18:45,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:45,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:18:45,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872045060] [2024-11-19 21:18:45,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:45,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:45,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:45,982 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-11-19 21:18:45,984 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-11-19 21:18:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:46,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 21:18:46,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:46,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:18:46,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:46,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021281724] [2024-11-19 21:18:46,281 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:18:46,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872045060] [2024-11-19 21:18:46,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872045060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:46,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:46,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 21:18:46,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386437838] [2024-11-19 21:18:46,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:46,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:18:46,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:46,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:18:46,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:18:46,283 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 21:18:48,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 21:18:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:48,468 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2024-11-19 21:18:48,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:18:48,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-19 21:18:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:48,469 INFO L225 Difference]: With dead ends: 49 [2024-11-19 21:18:48,469 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 21:18:48,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:18:48,470 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:48,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 104 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 21:18:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 21:18:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-19 21:18:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 21:18:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-11-19 21:18:48,488 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 19 [2024-11-19 21:18:48,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:48,488 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-11-19 21:18:48,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 21:18:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-11-19 21:18:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 21:18:48,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:48,489 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:48,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 21:18:48,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:48,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:48,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:48,690 INFO L85 PathProgramCache]: Analyzing trace with hash -82041861, now seen corresponding path program 1 times [2024-11-19 21:18:48,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:48,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15024694] [2024-11-19 21:18:48,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:48,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:48,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:48,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:48,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:48,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15024694] [2024-11-19 21:18:48,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15024694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:48,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000181914] [2024-11-19 21:18:48,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:48,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:48,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:48,929 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-11-19 21:18:48,935 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-11-19 21:18:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:48,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 21:18:48,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:49,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:49,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000181914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:49,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:49,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-11-19 21:18:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246275789] [2024-11-19 21:18:49,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:49,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:18:49,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:49,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:18:49,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:18:49,167 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 21:18:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:49,389 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-19 21:18:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:18:49,390 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 25 [2024-11-19 21:18:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:49,391 INFO L225 Difference]: With dead ends: 53 [2024-11-19 21:18:49,391 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 21:18:49,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:18:49,392 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:49,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 194 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 21:18:49,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 21:18:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2024-11-19 21:18:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 21:18:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-19 21:18:49,400 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2024-11-19 21:18:49,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:49,400 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-19 21:18:49,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 21:18:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-19 21:18:49,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 21:18:49,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:49,401 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:49,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 21:18:49,605 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,SelfDestructingSolverStorable3 [2024-11-19 21:18:49,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:49,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:49,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1145481658, now seen corresponding path program 1 times [2024-11-19 21:18:49,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:49,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702621032] [2024-11-19 21:18:49,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:49,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:49,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:49,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702621032] [2024-11-19 21:18:49,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702621032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:49,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:49,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 21:18:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669956718] [2024-11-19 21:18:49,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:49,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:18:49,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:49,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:18:49,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:18:49,747 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 21:18:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:49,798 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2024-11-19 21:18:49,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:18:49,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-19 21:18:49,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:49,799 INFO L225 Difference]: With dead ends: 61 [2024-11-19 21:18:49,799 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 21:18:49,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:18:49,800 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:49,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 91 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 21:18:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 21:18:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 21:18:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-11-19 21:18:49,824 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 31 [2024-11-19 21:18:49,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:49,825 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-11-19 21:18:49,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 21:18:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-11-19 21:18:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 21:18:49,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:49,829 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:49,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 21:18:49,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:49,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1102972225, now seen corresponding path program 1 times [2024-11-19 21:18:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:49,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681233256] [2024-11-19 21:18:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:49,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:18:49,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:49,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681233256] [2024-11-19 21:18:49,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681233256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:49,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:49,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:18:49,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220793234] [2024-11-19 21:18:49,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:49,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:18:49,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:49,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:18:49,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:18:49,968 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 21:18:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:50,005 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2024-11-19 21:18:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:18:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-11-19 21:18:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:50,006 INFO L225 Difference]: With dead ends: 70 [2024-11-19 21:18:50,007 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 21:18:50,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:18:50,008 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:50,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 109 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 21:18:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-19 21:18:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 21:18:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-11-19 21:18:50,020 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 37 [2024-11-19 21:18:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:50,020 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-19 21:18:50,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 21:18:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-11-19 21:18:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 21:18:50,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:50,022 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:50,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:18:50,022 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:50,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 30895492, now seen corresponding path program 1 times [2024-11-19 21:18:50,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:50,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302560237] [2024-11-19 21:18:50,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:50,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:18:50,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:50,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302560237] [2024-11-19 21:18:50,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302560237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:50,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592977024] [2024-11-19 21:18:50,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:50,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:50,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:50,101 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-11-19 21:18:50,107 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-11-19 21:18:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 21:18:50,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:50,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:18:50,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592977024] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:50,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:50,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-19 21:18:50,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708497731] [2024-11-19 21:18:50,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:50,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:18:50,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:18:50,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:18:50,260 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 21:18:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:50,369 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2024-11-19 21:18:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 21:18:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 39 [2024-11-19 21:18:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:50,371 INFO L225 Difference]: With dead ends: 125 [2024-11-19 21:18:50,371 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 21:18:50,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:18:50,376 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 72 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:50,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 133 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:18:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 21:18:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2024-11-19 21:18:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 68 states have internal predecessors, (82), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 21:18:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2024-11-19 21:18:50,415 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 39 [2024-11-19 21:18:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:50,415 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2024-11-19 21:18:50,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-19 21:18:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2024-11-19 21:18:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 21:18:50,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:50,416 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:50,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 21:18:50,617 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-11-19 21:18:50,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:50,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash -798356602, now seen corresponding path program 1 times [2024-11-19 21:18:50,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:50,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120237352] [2024-11-19 21:18:50,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 21:18:50,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:50,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120237352] [2024-11-19 21:18:50,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120237352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:50,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:50,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 21:18:50,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976833901] [2024-11-19 21:18:50,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:50,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 21:18:50,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:50,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 21:18:50,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 21:18:50,660 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 21:18:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:50,764 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2024-11-19 21:18:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 21:18:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2024-11-19 21:18:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:50,767 INFO L225 Difference]: With dead ends: 154 [2024-11-19 21:18:50,767 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 21:18:50,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-11-19 21:18:50,768 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 16 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:50,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 114 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 21:18:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2024-11-19 21:18:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 21:18:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2024-11-19 21:18:50,789 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 43 [2024-11-19 21:18:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:50,789 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2024-11-19 21:18:50,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 21:18:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2024-11-19 21:18:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 21:18:50,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:50,790 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:50,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:18:50,790 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:50,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:50,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1023958197, now seen corresponding path program 1 times [2024-11-19 21:18:50,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:50,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429857834] [2024-11-19 21:18:50,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:50,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 21:18:50,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:50,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429857834] [2024-11-19 21:18:50,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429857834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:50,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690384667] [2024-11-19 21:18:50,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:50,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:50,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:50,877 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-11-19 21:18:50,877 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-11-19 21:18:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:50,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 21:18:50,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:50,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 21:18:51,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690384667] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:51,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:51,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-11-19 21:18:51,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424238036] [2024-11-19 21:18:51,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:51,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:18:51,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:51,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:18:51,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:18:51,143 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-19 21:18:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:51,328 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2024-11-19 21:18:51,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 21:18:51,329 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 45 [2024-11-19 21:18:51,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:51,330 INFO L225 Difference]: With dead ends: 215 [2024-11-19 21:18:51,330 INFO L226 Difference]: Without dead ends: 168 [2024-11-19 21:18:51,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:18:51,334 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 79 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:51,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 194 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:18:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-19 21:18:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 149. [2024-11-19 21:18:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 112 states have internal predecessors, (138), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 21:18:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 193 transitions. [2024-11-19 21:18:51,377 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 193 transitions. Word has length 45 [2024-11-19 21:18:51,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:51,377 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 193 transitions. [2024-11-19 21:18:51,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-19 21:18:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 193 transitions. [2024-11-19 21:18:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 21:18:51,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:51,379 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:51,386 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-11-19 21:18:51,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:51,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:51,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1104536814, now seen corresponding path program 1 times [2024-11-19 21:18:51,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:51,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241317350] [2024-11-19 21:18:51,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:51,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:18:51,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:51,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241317350] [2024-11-19 21:18:51,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241317350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:51,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676064883] [2024-11-19 21:18:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:51,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:51,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:51,678 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-11-19 21:18:51,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 21:18:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:51,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 21:18:51,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:51,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:18:51,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676064883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:51,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:51,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-19 21:18:51,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160462962] [2024-11-19 21:18:51,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:51,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 21:18:51,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:51,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 21:18:51,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:18:51,896 INFO L87 Difference]: Start difference. First operand 149 states and 193 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-19 21:18:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:52,109 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2024-11-19 21:18:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 21:18:52,109 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 51 [2024-11-19 21:18:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:52,111 INFO L225 Difference]: With dead ends: 207 [2024-11-19 21:18:52,111 INFO L226 Difference]: Without dead ends: 202 [2024-11-19 21:18:52,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2024-11-19 21:18:52,112 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 158 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:52,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 176 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:18:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-19 21:18:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2024-11-19 21:18:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 148 states have internal predecessors, (178), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-19 21:18:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 253 transitions. [2024-11-19 21:18:52,186 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 253 transitions. Word has length 51 [2024-11-19 21:18:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:52,187 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 253 transitions. [2024-11-19 21:18:52,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-19 21:18:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 253 transitions. [2024-11-19 21:18:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 21:18:52,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:52,192 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:52,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 21:18:52,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 21:18:52,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:52,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:52,394 INFO L85 PathProgramCache]: Analyzing trace with hash 540498080, now seen corresponding path program 1 times [2024-11-19 21:18:52,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:52,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202572869] [2024-11-19 21:18:52,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:52,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:18:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:18:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-19 21:18:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:18:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 12 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-19 21:18:52,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202572869] [2024-11-19 21:18:52,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202572869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617299700] [2024-11-19 21:18:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:52,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:52,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:52,546 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:52,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 21:18:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:52,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 21:18:52,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 21:18:52,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-19 21:18:52,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617299700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:52,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:52,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2024-11-19 21:18:52,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160822201] [2024-11-19 21:18:52,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:52,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:18:52,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:52,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:18:52,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:18:52,752 INFO L87 Difference]: Start difference. First operand 194 states and 253 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-19 21:18:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:52,843 INFO L93 Difference]: Finished difference Result 487 states and 676 transitions. [2024-11-19 21:18:52,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:18:52,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) Word has length 87 [2024-11-19 21:18:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:52,845 INFO L225 Difference]: With dead ends: 487 [2024-11-19 21:18:52,845 INFO L226 Difference]: Without dead ends: 351 [2024-11-19 21:18:52,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:18:52,846 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:52,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 182 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-19 21:18:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 338. [2024-11-19 21:18:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 254 states have (on average 1.2598425196850394) internal successors, (320), 260 states have internal predecessors, (320), 72 states have call successors, (72), 12 states have call predecessors, (72), 11 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-19 21:18:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 463 transitions. [2024-11-19 21:18:52,911 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 463 transitions. Word has length 87 [2024-11-19 21:18:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:52,912 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 463 transitions. [2024-11-19 21:18:52,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 7 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-19 21:18:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 463 transitions. [2024-11-19 21:18:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 21:18:52,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:52,913 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:52,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 21:18:53,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:53,116 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:53,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash -134976430, now seen corresponding path program 2 times [2024-11-19 21:18:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:53,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476714179] [2024-11-19 21:18:53,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:53,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:18:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:18:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:18:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:18:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-19 21:18:53,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:53,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476714179] [2024-11-19 21:18:53,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476714179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:53,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160673405] [2024-11-19 21:18:53,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 21:18:53,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:53,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:53,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:53,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 21:18:53,353 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 21:18:53,353 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:18:53,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 21:18:53,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 58 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 21:18:53,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-19 21:18:53,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160673405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:53,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:53,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20 [2024-11-19 21:18:53,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129528769] [2024-11-19 21:18:53,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:53,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 21:18:53,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:53,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 21:18:53,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2024-11-19 21:18:53,599 INFO L87 Difference]: Start difference. First operand 338 states and 463 transitions. Second operand has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 17 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 17 states have call predecessors, (29), 17 states have call successors, (29) [2024-11-19 21:18:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:54,156 INFO L93 Difference]: Finished difference Result 981 states and 1409 transitions. [2024-11-19 21:18:54,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 21:18:54,157 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 17 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 17 states have call predecessors, (29), 17 states have call successors, (29) Word has length 87 [2024-11-19 21:18:54,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:54,165 INFO L225 Difference]: With dead ends: 981 [2024-11-19 21:18:54,165 INFO L226 Difference]: Without dead ends: 838 [2024-11-19 21:18:54,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=403, Invalid=719, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 21:18:54,167 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 266 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:54,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 310 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 21:18:54,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-19 21:18:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 789. [2024-11-19 21:18:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 596 states have (on average 1.2533557046979866) internal successors, (747), 605 states have internal predecessors, (747), 175 states have call successors, (175), 18 states have call predecessors, (175), 17 states have return successors, (174), 165 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-19 21:18:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1096 transitions. [2024-11-19 21:18:54,440 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1096 transitions. Word has length 87 [2024-11-19 21:18:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:54,441 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1096 transitions. [2024-11-19 21:18:54,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 20 states have internal predecessors, (93), 17 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 17 states have call predecessors, (29), 17 states have call successors, (29) [2024-11-19 21:18:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1096 transitions. [2024-11-19 21:18:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 21:18:54,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:54,442 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:54,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 21:18:54,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:54,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:54,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:54,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2132027339, now seen corresponding path program 1 times [2024-11-19 21:18:54,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:54,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423944901] [2024-11-19 21:18:54,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:54,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:54,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:54,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:54,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:54,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:54,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:54,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:18:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:18:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:54,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:18:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:54,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:18:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:54,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:18:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 21:18:54,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:54,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423944901] [2024-11-19 21:18:54,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423944901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:54,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470612708] [2024-11-19 21:18:54,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:54,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:54,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:54,963 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:54,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 21:18:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:55,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 21:18:55,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:55,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-19 21:18:55,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470612708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:55,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:55,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2024-11-19 21:18:55,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893402820] [2024-11-19 21:18:55,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:55,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 21:18:55,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:55,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 21:18:55,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-19 21:18:55,385 INFO L87 Difference]: Start difference. First operand 789 states and 1096 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2024-11-19 21:18:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:55,991 INFO L93 Difference]: Finished difference Result 1281 states and 1780 transitions. [2024-11-19 21:18:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-19 21:18:55,992 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) Word has length 93 [2024-11-19 21:18:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:55,996 INFO L225 Difference]: With dead ends: 1281 [2024-11-19 21:18:55,996 INFO L226 Difference]: Without dead ends: 791 [2024-11-19 21:18:55,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=584, Invalid=1056, Unknown=0, NotChecked=0, Total=1640 [2024-11-19 21:18:55,998 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 358 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:55,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 310 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 21:18:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-19 21:18:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 735. [2024-11-19 21:18:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 551 states have (on average 1.219600725952813) internal successors, (672), 556 states have internal predecessors, (672), 162 states have call successors, (162), 22 states have call predecessors, (162), 21 states have return successors, (161), 156 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-19 21:18:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 995 transitions. [2024-11-19 21:18:56,149 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 995 transitions. Word has length 93 [2024-11-19 21:18:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:56,149 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 995 transitions. [2024-11-19 21:18:56,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2024-11-19 21:18:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 995 transitions. [2024-11-19 21:18:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 21:18:56,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:56,151 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:56,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 21:18:56,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 21:18:56,352 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:56,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash 519126930, now seen corresponding path program 1 times [2024-11-19 21:18:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:56,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80987454] [2024-11-19 21:18:56,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:56,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:18:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:18:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:18:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:18:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:18:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:18:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-19 21:18:56,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:56,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80987454] [2024-11-19 21:18:56,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80987454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:56,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135048605] [2024-11-19 21:18:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:56,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:56,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:56,699 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:56,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 21:18:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:56,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 21:18:56,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:18:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 236 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 21:18:56,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:18:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-19 21:18:57,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135048605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:18:57,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:18:57,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2024-11-19 21:18:57,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137562807] [2024-11-19 21:18:57,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:18:57,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 21:18:57,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:57,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 21:18:57,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2024-11-19 21:18:57,249 INFO L87 Difference]: Start difference. First operand 735 states and 995 transitions. Second operand has 26 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 26 states have internal predecessors, (112), 23 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 22 states have call predecessors, (36), 22 states have call successors, (36) [2024-11-19 21:18:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:57,934 INFO L93 Difference]: Finished difference Result 846 states and 1154 transitions. [2024-11-19 21:18:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-19 21:18:57,934 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 26 states have internal predecessors, (112), 23 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 22 states have call predecessors, (36), 22 states have call successors, (36) Word has length 99 [2024-11-19 21:18:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:57,938 INFO L225 Difference]: With dead ends: 846 [2024-11-19 21:18:57,938 INFO L226 Difference]: Without dead ends: 841 [2024-11-19 21:18:57,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=670, Invalid=1222, Unknown=0, NotChecked=0, Total=1892 [2024-11-19 21:18:57,939 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 360 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:57,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 317 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 21:18:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-11-19 21:18:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 826. [2024-11-19 21:18:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 620 states have (on average 1.196774193548387) internal successors, (742), 626 states have internal predecessors, (742), 182 states have call successors, (182), 24 states have call predecessors, (182), 23 states have return successors, (181), 175 states have call predecessors, (181), 181 states have call successors, (181) [2024-11-19 21:18:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1105 transitions. [2024-11-19 21:18:58,079 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1105 transitions. Word has length 99 [2024-11-19 21:18:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:58,079 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1105 transitions. [2024-11-19 21:18:58,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 26 states have internal predecessors, (112), 23 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 22 states have call predecessors, (36), 22 states have call successors, (36) [2024-11-19 21:18:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1105 transitions. [2024-11-19 21:18:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-19 21:18:58,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:58,082 INFO L215 NwaCegarLoop]: trace histogram [20, 19, 19, 9, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:58,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 21:18:58,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 21:18:58,284 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:58,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1985812011, now seen corresponding path program 3 times [2024-11-19 21:18:58,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:58,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746060941] [2024-11-19 21:18:58,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:18:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:18:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:18:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:18:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:18:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:18:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:18:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:18:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:18:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-19 21:18:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-19 21:18:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-19 21:18:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 21:18:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-19 21:18:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-19 21:18:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2024-11-19 21:18:58,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:58,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746060941] [2024-11-19 21:18:58,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746060941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:18:58,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:18:58,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 21:18:58,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265232234] [2024-11-19 21:18:58,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:18:58,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 21:18:58,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:18:58,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 21:18:58,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 21:18:58,366 INFO L87 Difference]: Start difference. First operand 826 states and 1105 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 21:18:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:18:58,545 INFO L93 Difference]: Finished difference Result 1369 states and 1829 transitions. [2024-11-19 21:18:58,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 21:18:58,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 177 [2024-11-19 21:18:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:18:58,549 INFO L225 Difference]: With dead ends: 1369 [2024-11-19 21:18:58,549 INFO L226 Difference]: Without dead ends: 864 [2024-11-19 21:18:58,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-11-19 21:18:58,551 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:18:58,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:18:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-19 21:18:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 809. [2024-11-19 21:18:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 610 states have (on average 1.1836065573770491) internal successors, (722), 617 states have internal predecessors, (722), 175 states have call successors, (175), 24 states have call predecessors, (175), 23 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-19 21:18:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1071 transitions. [2024-11-19 21:18:58,658 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1071 transitions. Word has length 177 [2024-11-19 21:18:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:18:58,659 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1071 transitions. [2024-11-19 21:18:58,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 21:18:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1071 transitions. [2024-11-19 21:18:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-19 21:18:58,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:18:58,662 INFO L215 NwaCegarLoop]: trace histogram [20, 19, 19, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:18:58,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:18:58,662 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:18:58,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:18:58,662 INFO L85 PathProgramCache]: Analyzing trace with hash -866598647, now seen corresponding path program 4 times [2024-11-19 21:18:58,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:18:58,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174029847] [2024-11-19 21:18:58,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:18:58,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:18:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:18:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:18:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 21:18:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 21:18:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:18:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:18:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:18:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:18:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:18:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:18:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:18:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:18:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:18:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:18:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:18:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-19 21:18:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-19 21:18:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-19 21:18:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-19 21:18:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-19 21:18:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-19 21:18:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:18:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 138 proven. 156 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2024-11-19 21:18:59,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:18:59,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174029847] [2024-11-19 21:18:59,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174029847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:18:59,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42898942] [2024-11-19 21:18:59,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 21:18:59,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:18:59,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:18:59,196 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:18:59,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 21:18:59,269 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 21:18:59,269 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 21:18:59,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 21:18:59,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:19:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 439 proven. 112 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-11-19 21:19:31,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:19:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 189 proven. 92 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-11-19 21:19:44,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42898942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:19:44,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:19:44,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 11] total 37 [2024-11-19 21:19:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331573427] [2024-11-19 21:19:44,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:19:44,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-19 21:19:44,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:19:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 21:19:44,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1098, Unknown=7, NotChecked=0, Total=1332 [2024-11-19 21:19:44,396 INFO L87 Difference]: Start difference. First operand 809 states and 1071 transitions. Second operand has 37 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 35 states have internal predecessors, (169), 31 states have call successors, (55), 2 states have call predecessors, (55), 3 states have return successors, (55), 33 states have call predecessors, (55), 31 states have call successors, (55) [2024-11-19 21:19:54,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-19 21:19:58,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-19 21:20:00,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-19 21:20:02,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-19 21:20:14,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-19 21:20:18,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-19 21:20:22,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]