./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_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_unwindbound100.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 ac7d6bbeae1af74610eb5ea0ec9cc56676532539c7535ebfdf72e0c17174815d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:12:37,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:12:37,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:12:37,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:12:37,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:12:37,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:12:37,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:12:37,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:12:37,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:12:37,996 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:12:37,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:12:37,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:12:37,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:12:37,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:12:38,000 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:12:38,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:12:38,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:12:38,001 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:12:38,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:12:38,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:12:38,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:12:38,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:12:38,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:12:38,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:12:38,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:12:38,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:12:38,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:12:38,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:12:38,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:12:38,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:12:38,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:12:38,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:12:38,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:12:38,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:12:38,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:12:38,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:12:38,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:12:38,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:12:38,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:12:38,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:12:38,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:12:38,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:12:38,009 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 -> ac7d6bbeae1af74610eb5ea0ec9cc56676532539c7535ebfdf72e0c17174815d [2024-10-24 00:12:38,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:12:38,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:12:38,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:12:38,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:12:38,302 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:12:38,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2024-10-24 00:12:39,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:12:39,878 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:12:39,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2024-10-24 00:12:39,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48328501c/35fc84109b07424d8a2761730faf9e83/FLAG30a8003d1 [2024-10-24 00:12:40,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48328501c/35fc84109b07424d8a2761730faf9e83 [2024-10-24 00:12:40,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:12:40,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:12:40,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:12:40,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:12:40,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:12:40,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5288be2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40, skipping insertion in model container [2024-10-24 00:12:40,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:12:40,507 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.c[535,548] [2024-10-24 00:12:40,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:12:40,548 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:12:40,560 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound100.c[535,548] [2024-10-24 00:12:40,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:12:40,618 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:12:40,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40 WrapperNode [2024-10-24 00:12:40,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:12:40,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:12:40,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:12:40,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:12:40,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,690 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2024-10-24 00:12:40,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:12:40,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:12:40,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:12:40,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:12:40,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,730 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 00:12:40,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:12:40,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:12:40,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:12:40,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:12:40,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (1/1) ... [2024-10-24 00:12:40,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:12:40,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:12:40,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 00:12:40,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 00:12:40,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:12:40,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 00:12:40,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 00:12:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:12:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:12:40,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:12:40,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 00:12:40,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 00:12:40,910 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:12:40,912 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:12:41,075 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-24 00:12:41,075 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:12:41,104 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:12:41,105 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 00:12:41,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:12:41 BoogieIcfgContainer [2024-10-24 00:12:41,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:12:41,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:12:41,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:12:41,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:12:41,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:12:40" (1/3) ... [2024-10-24 00:12:41,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652c11ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:12:41, skipping insertion in model container [2024-10-24 00:12:41,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:12:40" (2/3) ... [2024-10-24 00:12:41,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652c11ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:12:41, skipping insertion in model container [2024-10-24 00:12:41,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:12:41" (3/3) ... [2024-10-24 00:12:41,120 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound100.c [2024-10-24 00:12:41,138 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:12:41,138 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:12:41,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:12:41,201 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;@46c1ec8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:12:41,202 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:12:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 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-10-24 00:12:41,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 00:12:41,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:41,216 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:12:41,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:41,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1287337846, now seen corresponding path program 1 times [2024-10-24 00:12:41,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:41,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718344383] [2024-10-24 00:12:41,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:41,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:41,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:41,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:12:41,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:41,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718344383] [2024-10-24 00:12:41,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718344383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:12:41,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:12:41,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 00:12:41,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060717367] [2024-10-24 00:12:41,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:12:41,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:12:41,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:41,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:12:41,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 00:12:41,438 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-10-24 00:12:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:41,463 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2024-10-24 00:12:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:12:41,467 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 17 [2024-10-24 00:12:41,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:41,472 INFO L225 Difference]: With dead ends: 56 [2024-10-24 00:12:41,472 INFO L226 Difference]: Without dead ends: 27 [2024-10-24 00:12:41,475 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-10-24 00:12:41,478 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:41,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:12:41,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-24 00:12:41,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-24 00:12:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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-10-24 00:12:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-24 00:12:41,512 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2024-10-24 00:12:41,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:41,512 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-24 00:12:41,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-10-24 00:12:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-24 00:12:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 00:12:41,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:41,516 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:12:41,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 00:12:41,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:41,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash -138178001, now seen corresponding path program 1 times [2024-10-24 00:12:41,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:41,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015287063] [2024-10-24 00:12:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:41,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:41,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:12:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015287063] [2024-10-24 00:12:41,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015287063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:12:41,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:12:41,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 00:12:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61951474] [2024-10-24 00:12:41,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:12:41,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 00:12:41,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:41,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 00:12:41,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 00:12:41,758 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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), 1 states have call successors, (2) [2024-10-24 00:12:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:41,803 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-24 00:12:41,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 00:12:41,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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), 1 states have call successors, (2) Word has length 18 [2024-10-24 00:12:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:41,805 INFO L225 Difference]: With dead ends: 36 [2024-10-24 00:12:41,805 INFO L226 Difference]: Without dead ends: 29 [2024-10-24 00:12:41,805 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-10-24 00:12:41,806 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:41,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:12:41,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-24 00:12:41,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-24 00:12:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 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-10-24 00:12:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-24 00:12:41,814 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 18 [2024-10-24 00:12:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:41,815 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-24 00:12:41,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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), 1 states have call successors, (2) [2024-10-24 00:12:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-24 00:12:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 00:12:41,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:41,817 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:12:41,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 00:12:41,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:41,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash -136509705, now seen corresponding path program 1 times [2024-10-24 00:12:41,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:41,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424270799] [2024-10-24 00:12:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:12:41,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285125270] [2024-10-24 00:12:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:41,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:12:41,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:12:41,860 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:12:41,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 00:12:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:41,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 00:12:41,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:12:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:12:42,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:12:42,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:42,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424270799] [2024-10-24 00:12:42,188 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:12:42,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285125270] [2024-10-24 00:12:42,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285125270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:12:42,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:12:42,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:12:42,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502009252] [2024-10-24 00:12:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:12:42,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:12:42,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:42,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:12:42,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:12:42,191 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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), 1 states have call successors, (2) [2024-10-24 00:12:43,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 00:12:44,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 00:12:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:44,746 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2024-10-24 00:12:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:12:44,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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), 1 states have call successors, (2) Word has length 18 [2024-10-24 00:12:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:44,748 INFO L225 Difference]: With dead ends: 48 [2024-10-24 00:12:44,748 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 00:12:44,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-10-24 00:12:44,750 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:44,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 97 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 00:12:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 00:12:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-24 00:12:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 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-10-24 00:12:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2024-10-24 00:12:44,776 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 18 [2024-10-24 00:12:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:44,777 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2024-10-24 00:12:44,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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), 1 states have call successors, (2) [2024-10-24 00:12:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2024-10-24 00:12:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 00:12:44,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:44,778 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] [2024-10-24 00:12:44,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 00:12:44,978 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-10-24 00:12:44,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:44,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:44,980 INFO L85 PathProgramCache]: Analyzing trace with hash -99991460, now seen corresponding path program 1 times [2024-10-24 00:12:44,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:44,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206108383] [2024-10-24 00:12:44,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:44,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:45,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:45,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:45,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:12:45,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:45,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206108383] [2024-10-24 00:12:45,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206108383] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:12:45,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504825491] [2024-10-24 00:12:45,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:45,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:12:45,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:12:45,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:12:45,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 00:12:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:45,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 00:12:45,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:12:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:12:45,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:12:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:12:45,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504825491] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:12:45,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:12:45,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-10-24 00:12:45,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608219415] [2024-10-24 00:12:45,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:12:45,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:12:45,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:45,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:12:45,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:12:45,621 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 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-10-24 00:12:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:45,759 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2024-10-24 00:12:45,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 00:12:45,762 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 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 24 [2024-10-24 00:12:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:45,764 INFO L225 Difference]: With dead ends: 52 [2024-10-24 00:12:45,765 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 00:12:45,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:12:45,767 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:45,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:12:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 00:12:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2024-10-24 00:12:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-10-24 00:12:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-24 00:12:45,788 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 24 [2024-10-24 00:12:45,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:45,789 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-24 00:12:45,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 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-10-24 00:12:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-24 00:12:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-24 00:12:45,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:45,793 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] [2024-10-24 00:12:45,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 00:12:45,997 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-10-24 00:12:45,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:45,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:45,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1981880857, now seen corresponding path program 1 times [2024-10-24 00:12:45,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:45,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970714519] [2024-10-24 00:12:45,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:45,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:12:46,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:46,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970714519] [2024-10-24 00:12:46,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970714519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:12:46,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:12:46,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:12:46,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209654373] [2024-10-24 00:12:46,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:12:46,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:12:46,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:46,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:12:46,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:12:46,090 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-10-24 00:12:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:46,146 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2024-10-24 00:12:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 00:12:46,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 30 [2024-10-24 00:12:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:46,148 INFO L225 Difference]: With dead ends: 60 [2024-10-24 00:12:46,148 INFO L226 Difference]: Without dead ends: 39 [2024-10-24 00:12:46,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:12:46,149 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:46,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 122 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:12:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-24 00:12:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-24 00:12:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-10-24 00:12:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-10-24 00:12:46,172 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 30 [2024-10-24 00:12:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:46,173 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-24 00:12:46,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-10-24 00:12:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-10-24 00:12:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 00:12:46,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:46,175 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] [2024-10-24 00:12:46,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 00:12:46,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:46,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2089520544, now seen corresponding path program 1 times [2024-10-24 00:12:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:46,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316268047] [2024-10-24 00:12:46,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:46,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 00:12:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 00:12:46,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:46,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316268047] [2024-10-24 00:12:46,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316268047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:12:46,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:12:46,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:12:46,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593669302] [2024-10-24 00:12:46,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:12:46,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:12:46,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:46,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:12:46,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:12:46,304 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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-10-24 00:12:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:46,376 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2024-10-24 00:12:46,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:12:46,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 36 [2024-10-24 00:12:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:46,377 INFO L225 Difference]: With dead ends: 69 [2024-10-24 00:12:46,377 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 00:12:46,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:12:46,378 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:46,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 136 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:12:46,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 00:12:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-10-24 00:12:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-10-24 00:12:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-10-24 00:12:46,394 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 36 [2024-10-24 00:12:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:46,394 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-24 00:12:46,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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-10-24 00:12:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-10-24 00:12:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 00:12:46,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:46,396 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] [2024-10-24 00:12:46,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:12:46,396 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:46,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:46,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1409797157, now seen corresponding path program 1 times [2024-10-24 00:12:46,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:46,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509886730] [2024-10-24 00:12:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:46,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 00:12:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 00:12:46,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509886730] [2024-10-24 00:12:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509886730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:12:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13254281] [2024-10-24 00:12:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:46,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:12:46,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:12:46,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:12:46,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 00:12:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:46,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 00:12:46,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:12:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:12:46,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:12:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 00:12:46,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13254281] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:12:46,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:12:46,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2024-10-24 00:12:46,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549298358] [2024-10-24 00:12:46,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:12:46,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:12:46,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:46,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:12:46,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:12:46,771 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-24 00:12:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:46,970 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2024-10-24 00:12:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:12:46,971 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 38 [2024-10-24 00:12:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:46,972 INFO L225 Difference]: With dead ends: 124 [2024-10-24 00:12:46,972 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 00:12:46,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-24 00:12:46,973 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 66 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:46,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 179 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:12:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 00:12:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2024-10-24 00:12:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 67 states have internal predecessors, (81), 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-10-24 00:12:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2024-10-24 00:12:47,012 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 38 [2024-10-24 00:12:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:47,012 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2024-10-24 00:12:47,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 8 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-24 00:12:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2024-10-24 00:12:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 00:12:47,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:47,014 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] [2024-10-24 00:12:47,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 00:12:47,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:12:47,219 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:47,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1072156249, now seen corresponding path program 1 times [2024-10-24 00:12:47,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:47,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766675397] [2024-10-24 00:12:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:47,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 00:12:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 00:12:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 00:12:47,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:47,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766675397] [2024-10-24 00:12:47,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766675397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:12:47,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:12:47,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 00:12:47,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390072205] [2024-10-24 00:12:47,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:12:47,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 00:12:47,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:47,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 00:12:47,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 00:12:47,273 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10-24 00:12:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:47,340 INFO L93 Difference]: Finished difference Result 153 states and 197 transitions. [2024-10-24 00:12:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 00:12:47,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 42 [2024-10-24 00:12:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:47,343 INFO L225 Difference]: With dead ends: 153 [2024-10-24 00:12:47,343 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 00:12:47,343 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-10-24 00:12:47,344 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:47,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 85 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:12:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 00:12:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2024-10-24 00:12:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 78 states have internal predecessors, (95), 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-10-24 00:12:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2024-10-24 00:12:47,383 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 42 [2024-10-24 00:12:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:47,383 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2024-10-24 00:12:47,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10-24 00:12:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2024-10-24 00:12:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 00:12:47,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:47,385 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] [2024-10-24 00:12:47,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:12:47,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:47,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2142553388, now seen corresponding path program 1 times [2024-10-24 00:12:47,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:47,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968474751] [2024-10-24 00:12:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 00:12:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 00:12:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 00:12:47,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:47,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968474751] [2024-10-24 00:12:47,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968474751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:12:47,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661107518] [2024-10-24 00:12:47,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:47,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:12:47,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:12:47,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:12:47,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 00:12:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:47,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 00:12:47,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:12:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:12:47,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:12:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 00:12:47,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661107518] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:12:47,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:12:47,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 14 [2024-10-24 00:12:47,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179519052] [2024-10-24 00:12:47,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:12:47,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 00:12:47,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:47,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 00:12:47,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:12:47,737 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2024-10-24 00:12:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:47,969 INFO L93 Difference]: Finished difference Result 214 states and 278 transitions. [2024-10-24 00:12:47,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 00:12:47,970 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) Word has length 44 [2024-10-24 00:12:47,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:47,971 INFO L225 Difference]: With dead ends: 214 [2024-10-24 00:12:47,971 INFO L226 Difference]: Without dead ends: 167 [2024-10-24 00:12:47,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2024-10-24 00:12:47,973 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 83 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:47,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 170 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:12:47,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-24 00:12:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 148. [2024-10-24 00:12:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 110 states have (on average 1.2454545454545454) internal successors, (137), 111 states have internal predecessors, (137), 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-10-24 00:12:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2024-10-24 00:12:48,025 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 44 [2024-10-24 00:12:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:48,026 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2024-10-24 00:12:48,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 10 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2024-10-24 00:12:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2024-10-24 00:12:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 00:12:48,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:48,027 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] [2024-10-24 00:12:48,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:12:48,228 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-10-24 00:12:48,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:48,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:48,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1696895027, now seen corresponding path program 1 times [2024-10-24 00:12:48,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:48,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77869597] [2024-10-24 00:12:48,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:48,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:48,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:48,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:48,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 00:12:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 00:12:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:48,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 00:12:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:12:48,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:48,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77869597] [2024-10-24 00:12:48,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77869597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:12:48,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363667555] [2024-10-24 00:12:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:48,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:12:48,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:12:48,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:12:48,410 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-10-24 00:12:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:48,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 00:12:48,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:12:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:12:48,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:12:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:12:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363667555] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:12:48,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:12:48,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-10-24 00:12:48,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434438397] [2024-10-24 00:12:48,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:12:48,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 00:12:48,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:48,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 00:12:48,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-10-24 00:12:48,676 INFO L87 Difference]: Start difference. First operand 148 states and 192 transitions. Second operand has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-24 00:12:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:48,939 INFO L93 Difference]: Finished difference Result 206 states and 273 transitions. [2024-10-24 00:12:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 00:12:48,940 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 50 [2024-10-24 00:12:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:48,941 INFO L225 Difference]: With dead ends: 206 [2024-10-24 00:12:48,941 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 00:12:48,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2024-10-24 00:12:48,942 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 115 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:48,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 196 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 00:12:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 00:12:48,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 193. [2024-10-24 00:12:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 147 states have internal predecessors, (177), 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-10-24 00:12:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 252 transitions. [2024-10-24 00:12:48,993 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 252 transitions. Word has length 50 [2024-10-24 00:12:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:48,993 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 252 transitions. [2024-10-24 00:12:48,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-24 00:12:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 252 transitions. [2024-10-24 00:12:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 00:12:48,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:48,995 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] [2024-10-24 00:12:49,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 00:12:49,195 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-10-24 00:12:49,196 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:49,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:49,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1904373439, now seen corresponding path program 1 times [2024-10-24 00:12:49,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:49,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626870419] [2024-10-24 00:12:49,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:49,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:49,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:49,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:49,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 00:12:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 00:12:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:49,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 00:12:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:49,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 00:12:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:49,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:12:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:49,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:12:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:49,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:12:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 46 proven. 12 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-10-24 00:12:49,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:49,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626870419] [2024-10-24 00:12:49,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626870419] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:12:49,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800022076] [2024-10-24 00:12:49,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:49,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:12:49,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:12:49,348 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-10-24 00:12:49,349 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-10-24 00:12:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:49,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 00:12:49,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:12:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-24 00:12:49,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:12:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-10-24 00:12:49,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800022076] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:12:49,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:12:49,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2024-10-24 00:12:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203869858] [2024-10-24 00:12:49,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:12:49,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:12:49,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:49,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:12:49,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:12:49,571 INFO L87 Difference]: Start difference. First operand 193 states and 252 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-10-24 00:12:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:49,705 INFO L93 Difference]: Finished difference Result 486 states and 675 transitions. [2024-10-24 00:12:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 00:12:49,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 86 [2024-10-24 00:12:49,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:49,708 INFO L225 Difference]: With dead ends: 486 [2024-10-24 00:12:49,708 INFO L226 Difference]: Without dead ends: 350 [2024-10-24 00:12:49,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 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-10-24 00:12:49,709 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:49,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 185 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:12:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-24 00:12:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 337. [2024-10-24 00:12:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 253 states have (on average 1.2608695652173914) internal successors, (319), 259 states have internal predecessors, (319), 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-10-24 00:12:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 462 transitions. [2024-10-24 00:12:49,808 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 462 transitions. Word has length 86 [2024-10-24 00:12:49,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:49,810 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 462 transitions. [2024-10-24 00:12:49,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-10-24 00:12:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 462 transitions. [2024-10-24 00:12:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 00:12:49,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:49,813 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] [2024-10-24 00:12:49,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 00:12:50,013 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-10-24 00:12:50,014 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:50,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:50,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1715119347, now seen corresponding path program 2 times [2024-10-24 00:12:50,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:50,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397958830] [2024-10-24 00:12:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:50,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:50,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:50,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:50,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:50,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 00:12:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 00:12:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:50,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 00:12:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:50,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 00:12:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:50,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:12:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:50,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:12:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:50,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:12:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-24 00:12:50,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:50,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397958830] [2024-10-24 00:12:50,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397958830] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:12:50,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119770584] [2024-10-24 00:12:50,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 00:12:50,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:12:50,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:12:50,288 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-10-24 00:12:50,290 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-10-24 00:12:50,353 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 00:12:50,353 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 00:12:50,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 00:12:50,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:12:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 58 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 00:12:50,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:12:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-24 00:12:50,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119770584] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:12:50,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:12:50,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 22 [2024-10-24 00:12:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154123488] [2024-10-24 00:12:50,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:12:50,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 00:12:50,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:50,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 00:12:50,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=269, Unknown=0, NotChecked=0, Total=462 [2024-10-24 00:12:50,683 INFO L87 Difference]: Start difference. First operand 337 states and 462 transitions. Second operand has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 18 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 18 states have call predecessors, (29), 18 states have call successors, (29) [2024-10-24 00:12:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:51,365 INFO L93 Difference]: Finished difference Result 980 states and 1408 transitions. [2024-10-24 00:12:51,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-24 00:12:51,366 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 18 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 18 states have call predecessors, (29), 18 states have call successors, (29) Word has length 86 [2024-10-24 00:12:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:51,372 INFO L225 Difference]: With dead ends: 980 [2024-10-24 00:12:51,375 INFO L226 Difference]: Without dead ends: 837 [2024-10-24 00:12:51,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=438, Invalid=822, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 00:12:51,377 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 258 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:51,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 283 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 00:12:51,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-24 00:12:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 788. [2024-10-24 00:12:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 595 states have (on average 1.253781512605042) internal successors, (746), 604 states have internal predecessors, (746), 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-10-24 00:12:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1095 transitions. [2024-10-24 00:12:51,577 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1095 transitions. Word has length 86 [2024-10-24 00:12:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:51,579 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1095 transitions. [2024-10-24 00:12:51,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.318181818181818) internal successors, (95), 22 states have internal predecessors, (95), 18 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (29), 18 states have call predecessors, (29), 18 states have call successors, (29) [2024-10-24 00:12:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1095 transitions. [2024-10-24 00:12:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 00:12:51,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:51,581 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] [2024-10-24 00:12:51,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 00:12:51,782 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-10-24 00:12:51,782 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:51,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1117496236, now seen corresponding path program 1 times [2024-10-24 00:12:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195889382] [2024-10-24 00:12:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 00:12:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 00:12:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 00:12:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 00:12:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:12:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:12:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:12:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:12:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-24 00:12:52,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:52,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195889382] [2024-10-24 00:12:52,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195889382] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:12:52,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443741502] [2024-10-24 00:12:52,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:52,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:12:52,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:12:52,074 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-10-24 00:12:52,075 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-10-24 00:12:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:52,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 00:12:52,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:12:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:12:52,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:12:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-24 00:12:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443741502] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:12:52,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:12:52,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 26 [2024-10-24 00:12:52,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264698240] [2024-10-24 00:12:52,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:12:52,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 00:12:52,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 00:12:52,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=371, Unknown=0, NotChecked=0, Total=650 [2024-10-24 00:12:52,595 INFO L87 Difference]: Start difference. First operand 788 states and 1095 transitions. Second operand has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 22 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 21 states have call predecessors, (33), 21 states have call successors, (33) [2024-10-24 00:12:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:53,418 INFO L93 Difference]: Finished difference Result 1280 states and 1779 transitions. [2024-10-24 00:12:53,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-24 00:12:53,419 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 22 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 21 states have call predecessors, (33), 21 states have call successors, (33) Word has length 92 [2024-10-24 00:12:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:53,424 INFO L225 Difference]: With dead ends: 1280 [2024-10-24 00:12:53,424 INFO L226 Difference]: Without dead ends: 790 [2024-10-24 00:12:53,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=627, Invalid=1179, Unknown=0, NotChecked=0, Total=1806 [2024-10-24 00:12:53,427 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 340 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:53,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 329 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 00:12:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-10-24 00:12:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 734. [2024-10-24 00:12:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 550 states have (on average 1.22) internal successors, (671), 555 states have internal predecessors, (671), 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-10-24 00:12:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 994 transitions. [2024-10-24 00:12:53,585 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 994 transitions. Word has length 92 [2024-10-24 00:12:53,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:53,586 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 994 transitions. [2024-10-24 00:12:53,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 22 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 21 states have call predecessors, (33), 21 states have call successors, (33) [2024-10-24 00:12:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 994 transitions. [2024-10-24 00:12:53,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 00:12:53,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:53,588 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] [2024-10-24 00:12:53,604 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-10-24 00:12:53,790 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-10-24 00:12:53,791 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:53,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash -32862541, now seen corresponding path program 1 times [2024-10-24 00:12:53,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:53,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112519940] [2024-10-24 00:12:53,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:53,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 00:12:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 00:12:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 00:12:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 00:12:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:12:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:12:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:12:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:12:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:12:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-24 00:12:54,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:54,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112519940] [2024-10-24 00:12:54,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112519940] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:12:54,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904343469] [2024-10-24 00:12:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:54,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:12:54,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:12:54,105 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-10-24 00:12:54,106 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-10-24 00:12:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:54,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 00:12:54,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:12:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 236 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 00:12:54,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:12:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-24 00:12:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904343469] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:12:54,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:12:54,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 28 [2024-10-24 00:12:54,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114888474] [2024-10-24 00:12:54,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:12:54,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-24 00:12:54,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:54,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-24 00:12:54,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2024-10-24 00:12:54,618 INFO L87 Difference]: Start difference. First operand 734 states and 994 transitions. Second operand has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 24 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 23 states have call predecessors, (36), 23 states have call successors, (36) [2024-10-24 00:12:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:55,481 INFO L93 Difference]: Finished difference Result 845 states and 1153 transitions. [2024-10-24 00:12:55,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-24 00:12:55,482 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 24 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 23 states have call predecessors, (36), 23 states have call successors, (36) Word has length 98 [2024-10-24 00:12:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:55,487 INFO L225 Difference]: With dead ends: 845 [2024-10-24 00:12:55,487 INFO L226 Difference]: Without dead ends: 840 [2024-10-24 00:12:55,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=694, Invalid=1286, Unknown=0, NotChecked=0, Total=1980 [2024-10-24 00:12:55,489 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 379 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:55,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 327 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 00:12:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-10-24 00:12:55,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 825. [2024-10-24 00:12:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 619 states have (on average 1.197092084006462) internal successors, (741), 625 states have internal predecessors, (741), 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-10-24 00:12:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1104 transitions. [2024-10-24 00:12:55,656 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1104 transitions. Word has length 98 [2024-10-24 00:12:55,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:55,657 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1104 transitions. [2024-10-24 00:12:55,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.071428571428571) internal successors, (114), 28 states have internal predecessors, (114), 24 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 23 states have call predecessors, (36), 23 states have call successors, (36) [2024-10-24 00:12:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1104 transitions. [2024-10-24 00:12:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-24 00:12:55,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:55,663 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] [2024-10-24 00:12:55,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-24 00:12:55,867 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-10-24 00:12:55,868 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:55,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1211281524, now seen corresponding path program 3 times [2024-10-24 00:12:55,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:55,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796075152] [2024-10-24 00:12:55,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:55,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 00:12:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 00:12:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 00:12:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 00:12:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:12:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:12:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:12:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:12:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:12:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:12:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:12:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:12:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 00:12:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 00:12:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 00:12:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 00:12:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 00:12:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 00:12:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2024-10-24 00:12:55,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:55,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796075152] [2024-10-24 00:12:55,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796075152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:12:55,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:12:55,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 00:12:55,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768450937] [2024-10-24 00:12:55,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:12:55,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 00:12:55,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:12:55,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 00:12:55,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 00:12:55,994 INFO L87 Difference]: Start difference. First operand 825 states and 1104 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-24 00:12:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:12:56,203 INFO L93 Difference]: Finished difference Result 1368 states and 1828 transitions. [2024-10-24 00:12:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 00:12:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 176 [2024-10-24 00:12:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:12:56,209 INFO L225 Difference]: With dead ends: 1368 [2024-10-24 00:12:56,209 INFO L226 Difference]: Without dead ends: 863 [2024-10-24 00:12:56,211 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-10-24 00:12:56,212 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:12:56,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:12:56,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-10-24 00:12:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 808. [2024-10-24 00:12:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 609 states have (on average 1.1839080459770115) internal successors, (721), 616 states have internal predecessors, (721), 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-10-24 00:12:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1070 transitions. [2024-10-24 00:12:56,369 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1070 transitions. Word has length 176 [2024-10-24 00:12:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:12:56,370 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1070 transitions. [2024-10-24 00:12:56,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-10-24 00:12:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1070 transitions. [2024-10-24 00:12:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-24 00:12:56,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:12:56,374 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] [2024-10-24 00:12:56,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:12:56,375 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:12:56,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:12:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash 231275114, now seen corresponding path program 4 times [2024-10-24 00:12:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:12:56,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105108148] [2024-10-24 00:12:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:12:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:12:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 00:12:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 00:12:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:12:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 00:12:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 00:12:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 00:12:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 00:12:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:12:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:12:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:12:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:12:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:12:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:12:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:12:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:12:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 00:12:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 00:12:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 00:12:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 00:12:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 00:12:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 00:12:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:12:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 138 proven. 156 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2024-10-24 00:12:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:12:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105108148] [2024-10-24 00:12:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105108148] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:12:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811117652] [2024-10-24 00:12:57,171 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 00:12:57,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:12:57,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:12:57,173 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-10-24 00:12:57,174 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-10-24 00:12:57,283 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 00:12:57,284 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 00:12:57,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 00:12:57,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:13:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 439 proven. 112 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-10-24 00:13:03,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:13:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 189 proven. 92 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-10-24 00:13:03,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811117652] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:13:03,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:13:03,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 38 [2024-10-24 00:13:03,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859893007] [2024-10-24 00:13:03,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:13:03,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-24 00:13:03,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:13:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-24 00:13:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1159, Unknown=1, NotChecked=0, Total=1406 [2024-10-24 00:13:03,798 INFO L87 Difference]: Start difference. First operand 808 states and 1070 transitions. Second operand has 38 states, 38 states have (on average 4.394736842105263) internal successors, (167), 36 states have internal predecessors, (167), 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-10-24 00:13:08,016 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-10-24 00:13:12,107 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-10-24 00:13:16,219 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-10-24 00:13:20,318 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-10-24 00:13:21,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 00:13:25,403 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-10-24 00:13:33,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-24 00:13:37,888 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-10-24 00:13:39,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-24 00:13:43,426 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-10-24 00:13:47,530 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-10-24 00:14:00,184 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-10-24 00:14:01,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []