./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca2134f8a32f49a0943527ee47fd89b4eb01286294fd09a8197c7c707de74c1d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:11:14,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:11:14,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:11:14,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:11:14,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:11:14,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:11:14,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:11:14,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:11:14,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:11:14,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:11:14,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:11:14,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:11:14,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:11:14,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:11:14,414 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:11:14,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:11:14,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:11:14,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:11:14,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:11:14,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:11:14,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:11:14,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:11:14,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:11:14,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:11:14,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:11:14,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:11:14,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:11:14,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:11:14,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:11:14,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:11:14,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:11:14,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:11:14,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:11:14,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:11:14,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:11:14,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:11:14,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:11:14,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:11:14,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:11:14,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:11:14,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:11:14,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:11:14,423 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca2134f8a32f49a0943527ee47fd89b4eb01286294fd09a8197c7c707de74c1d [2024-10-11 02:11:14,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:11:14,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:11:14,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:11:14,763 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:11:14,764 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:11:14,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2024-10-11 02:11:16,203 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:11:16,386 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:11:16,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2024-10-11 02:11:16,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4adb28d5f/7d40f43fe2b14f0396cce2c246f20968/FLAGb4ac40d1e [2024-10-11 02:11:16,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4adb28d5f/7d40f43fe2b14f0396cce2c246f20968 [2024-10-11 02:11:16,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:11:16,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:11:16,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:11:16,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:11:16,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:11:16,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16, skipping insertion in model container [2024-10-11 02:11:16,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:11:16,620 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_unwindbound50.c[535,548] [2024-10-11 02:11:16,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:11:16,648 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:11:16,657 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_unwindbound50.c[535,548] [2024-10-11 02:11:16,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:11:16,680 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:11:16,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16 WrapperNode [2024-10-11 02:11:16,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:11:16,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:11:16,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:11:16,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:11:16,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,709 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2024-10-11 02:11:16,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:11:16,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:11:16,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:11:16,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:11:16,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,736 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-11 02:11:16,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:11:16,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:11:16,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:11:16,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:11:16,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (1/1) ... [2024-10-11 02:11:16,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:11:16,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:16,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:11:16,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:11:16,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:11:16,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 02:11:16,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 02:11:16,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:11:16,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:11:16,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:11:16,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 02:11:16,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 02:11:16,882 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:11:16,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:11:17,076 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-11 02:11:17,076 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:11:17,100 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:11:17,100 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 02:11:17,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:17 BoogieIcfgContainer [2024-10-11 02:11:17,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:11:17,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:11:17,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:11:17,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:11:17,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:11:16" (1/3) ... [2024-10-11 02:11:17,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3374cb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:11:17, skipping insertion in model container [2024-10-11 02:11:17,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:16" (2/3) ... [2024-10-11 02:11:17,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3374cb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:11:17, skipping insertion in model container [2024-10-11 02:11:17,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:17" (3/3) ... [2024-10-11 02:11:17,114 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound50.c [2024-10-11 02:11:17,127 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:11:17,127 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:11:17,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:11:17,184 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;@1fdacdcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:11:17,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:11:17,189 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-11 02:11:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:11:17,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:17,196 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:17,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:17,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:17,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1287337846, now seen corresponding path program 1 times [2024-10-11 02:11:17,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:17,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294660416] [2024-10-11 02:11:17,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:17,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,397 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-11 02:11:17,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:17,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294660416] [2024-10-11 02:11:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294660416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:17,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:11:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225975123] [2024-10-11 02:11:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:17,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:11:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:17,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:11:17,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:11:17,428 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-11 02:11:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:17,450 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2024-10-11 02:11:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:11:17,453 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-11 02:11:17,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:17,459 INFO L225 Difference]: With dead ends: 56 [2024-10-11 02:11:17,459 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 02:11:17,461 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-11 02:11:17,464 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-11 02:11:17,465 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-11 02:11:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 02:11:17,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 02:11:17,491 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-11 02:11:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-11 02:11:17,493 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2024-10-11 02:11:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:17,493 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-11 02:11:17,494 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-11 02:11:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-11 02:11:17,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:11:17,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:17,495 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:17,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:11:17,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:17,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:17,496 INFO L85 PathProgramCache]: Analyzing trace with hash -138178001, now seen corresponding path program 1 times [2024-10-11 02:11:17,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:17,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286807331] [2024-10-11 02:11:17,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:17,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,716 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-11 02:11:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286807331] [2024-10-11 02:11:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286807331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:17,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:17,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:11:17,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738090811] [2024-10-11 02:11:17,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:17,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:11:17,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:17,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:11:17,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:17,721 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-11 02:11:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:17,757 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-11 02:11:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:11:17,758 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-11 02:11:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:17,759 INFO L225 Difference]: With dead ends: 36 [2024-10-11 02:11:17,759 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 02:11:17,759 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-11 02:11:17,761 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-11 02:11:17,761 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-11 02:11:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 02:11:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 02:11:17,767 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-11 02:11:17,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-11 02:11:17,768 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 18 [2024-10-11 02:11:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:17,770 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-11 02:11:17,770 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-11 02:11:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-11 02:11:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:11:17,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:17,771 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:17,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:11:17,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:17,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash -136509705, now seen corresponding path program 1 times [2024-10-11 02:11:17,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:17,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842995059] [2024-10-11 02:11:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:11:17,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189883253] [2024-10-11 02:11:17,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:17,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:17,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:17,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:17,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:11:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:17,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:11:17,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:18,133 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-11 02:11:18,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:11:18,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:18,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842995059] [2024-10-11 02:11:18,135 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:11:18,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189883253] [2024-10-11 02:11:18,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189883253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:18,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:18,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:11:18,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666151980] [2024-10-11 02:11:18,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:18,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:11:18,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:18,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:11:18,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:11:18,138 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-11 02:11:19,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 02:11:20,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 02:11:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:20,616 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2024-10-11 02:11:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:11:20,617 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-11 02:11:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:20,619 INFO L225 Difference]: With dead ends: 48 [2024-10-11 02:11:20,619 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 02:11:20,619 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-11 02:11:20,620 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:20,621 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.4s Time] [2024-10-11 02:11:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 02:11:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-11 02:11:20,639 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-11 02:11:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2024-10-11 02:11:20,644 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 18 [2024-10-11 02:11:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:20,645 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2024-10-11 02:11:20,645 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-11 02:11:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2024-10-11 02:11:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 02:11:20,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:20,646 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-11 02:11:20,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 02:11:20,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:20,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:20,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:20,849 INFO L85 PathProgramCache]: Analyzing trace with hash -99991460, now seen corresponding path program 1 times [2024-10-11 02:11:20,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:20,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902219174] [2024-10-11 02:11:20,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:20,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,260 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-11 02:11:21,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:21,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902219174] [2024-10-11 02:11:21,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902219174] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:21,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805516207] [2024-10-11 02:11:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:21,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:21,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:21,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:21,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:11:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 02:11:21,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:21,400 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-11 02:11:21,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:21,540 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-11 02:11:21,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805516207] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:21,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:21,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-10-11 02:11:21,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549468664] [2024-10-11 02:11:21,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:21,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:11:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:21,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:11:21,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:11:21,543 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-11 02:11:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:21,663 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2024-10-11 02:11:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:11:21,664 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-11 02:11:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:21,666 INFO L225 Difference]: With dead ends: 52 [2024-10-11 02:11:21,667 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 02:11:21,667 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-11 02:11:21,668 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-11 02:11:21,670 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-11 02:11:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 02:11:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2024-10-11 02:11:21,690 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-11 02:11:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-11 02:11:21,691 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 24 [2024-10-11 02:11:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:21,691 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-11 02:11:21,691 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-11 02:11:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-11 02:11:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 02:11:21,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:21,692 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-11 02:11:21,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:11:21,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:21,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:21,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1981880857, now seen corresponding path program 1 times [2024-10-11 02:11:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220021915] [2024-10-11 02:11:21,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:21,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:21,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,004 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-11 02:11:22,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220021915] [2024-10-11 02:11:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220021915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:22,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:22,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:11:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186736003] [2024-10-11 02:11:22,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:22,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:11:22,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:22,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:11:22,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:11:22,007 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-11 02:11:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:22,068 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2024-10-11 02:11:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:11:22,070 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-11 02:11:22,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:22,071 INFO L225 Difference]: With dead ends: 60 [2024-10-11 02:11:22,074 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 02:11:22,074 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-11 02:11:22,075 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-11 02:11:22,075 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-11 02:11:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 02:11:22,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 02:11:22,090 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-11 02:11:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-10-11 02:11:22,094 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 30 [2024-10-11 02:11:22,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:22,094 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-11 02:11:22,094 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-11 02:11:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-10-11 02:11:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 02:11:22,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:22,096 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-11 02:11:22,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:11:22,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:22,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:22,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2089520544, now seen corresponding path program 1 times [2024-10-11 02:11:22,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:22,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187059046] [2024-10-11 02:11:22,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:22,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,234 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-11 02:11:22,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:22,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187059046] [2024-10-11 02:11:22,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187059046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:22,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:22,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:11:22,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633590533] [2024-10-11 02:11:22,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:22,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:11:22,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:22,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:11:22,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:11:22,238 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-11 02:11:22,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:22,314 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2024-10-11 02:11:22,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:11:22,315 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-11 02:11:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:22,316 INFO L225 Difference]: With dead ends: 69 [2024-10-11 02:11:22,316 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 02:11:22,317 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-11 02:11:22,317 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:22,318 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.1s Time] [2024-10-11 02:11:22,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 02:11:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-10-11 02:11:22,333 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-11 02:11:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-10-11 02:11:22,334 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 36 [2024-10-11 02:11:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:22,335 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-11 02:11:22,335 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-11 02:11:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-10-11 02:11:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 02:11:22,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:22,336 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-11 02:11:22,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:11:22,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:22,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1409797157, now seen corresponding path program 1 times [2024-10-11 02:11:22,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:22,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28814655] [2024-10-11 02:11:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,463 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-11 02:11:22,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:22,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28814655] [2024-10-11 02:11:22,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28814655] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:22,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813198426] [2024-10-11 02:11:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:22,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:22,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:22,466 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:22,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:11:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:22,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 02:11:22,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:22,581 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-11 02:11:22,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:22,656 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-11 02:11:22,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813198426] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:22,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:22,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 12 [2024-10-11 02:11:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719187191] [2024-10-11 02:11:22,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:22,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:11:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:11:22,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:11:22,659 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-11 02:11:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:22,839 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2024-10-11 02:11:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:11:22,840 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-11 02:11:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:22,841 INFO L225 Difference]: With dead ends: 124 [2024-10-11 02:11:22,842 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 02:11:22,842 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-11 02:11:22,843 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-11 02:11:22,843 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-11 02:11:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 02:11:22,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2024-10-11 02:11:22,870 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-11 02:11:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2024-10-11 02:11:22,871 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 38 [2024-10-11 02:11:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:22,872 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2024-10-11 02:11:22,872 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-11 02:11:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2024-10-11 02:11:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 02:11:22,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:22,874 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-11 02:11:22,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:11:23,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:23,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:23,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:23,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1072156249, now seen corresponding path program 1 times [2024-10-11 02:11:23,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:23,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416470988] [2024-10-11 02:11:23,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:23,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,130 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-11 02:11:23,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:23,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416470988] [2024-10-11 02:11:23,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416470988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:23,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:23,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:11:23,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280193460] [2024-10-11 02:11:23,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:23,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:11:23,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:11:23,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:23,133 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-11 02:11:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:23,190 INFO L93 Difference]: Finished difference Result 153 states and 197 transitions. [2024-10-11 02:11:23,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:11:23,190 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-11 02:11:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:23,193 INFO L225 Difference]: With dead ends: 153 [2024-10-11 02:11:23,193 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 02:11:23,194 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-11 02:11:23,195 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-11 02:11:23,195 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-11 02:11:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 02:11:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2024-10-11 02:11:23,247 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-11 02:11:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2024-10-11 02:11:23,248 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 42 [2024-10-11 02:11:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:23,249 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2024-10-11 02:11:23,250 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-11 02:11:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2024-10-11 02:11:23,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 02:11:23,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:23,253 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-11 02:11:23,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:11:23,254 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:23,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2142553388, now seen corresponding path program 1 times [2024-10-11 02:11:23,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:23,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128379670] [2024-10-11 02:11:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:23,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,417 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-11 02:11:23,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:23,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128379670] [2024-10-11 02:11:23,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128379670] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:23,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364672050] [2024-10-11 02:11:23,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:23,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:23,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:23,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:23,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:11:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:23,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:11:23,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:23,552 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-11 02:11:23,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:23,654 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-11 02:11:23,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364672050] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:23,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:23,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 14 [2024-10-11 02:11:23,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088039503] [2024-10-11 02:11:23,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:23,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 02:11:23,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:23,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 02:11:23,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:11:23,656 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-11 02:11:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:23,872 INFO L93 Difference]: Finished difference Result 214 states and 278 transitions. [2024-10-11 02:11:23,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 02:11:23,873 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-11 02:11:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:23,874 INFO L225 Difference]: With dead ends: 214 [2024-10-11 02:11:23,874 INFO L226 Difference]: Without dead ends: 167 [2024-10-11 02:11:23,875 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-11 02:11:23,876 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-11 02:11:23,876 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-11 02:11:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-11 02:11:23,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 148. [2024-10-11 02:11:23,921 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-11 02:11:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2024-10-11 02:11:23,926 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 44 [2024-10-11 02:11:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:23,926 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2024-10-11 02:11:23,928 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-11 02:11:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2024-10-11 02:11:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 02:11:23,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:23,929 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-11 02:11:23,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 02:11:24,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 02:11:24,130 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:24,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1696895027, now seen corresponding path program 1 times [2024-10-11 02:11:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:24,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12021132] [2024-10-11 02:11:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:11:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,317 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-11 02:11:24,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:24,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12021132] [2024-10-11 02:11:24,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12021132] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:24,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906655214] [2024-10-11 02:11:24,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:24,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:24,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:24,320 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:24,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:11:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:24,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:11:24,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:24,438 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-11 02:11:24,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:24,553 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-11 02:11:24,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906655214] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:24,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:24,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-10-11 02:11:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502688740] [2024-10-11 02:11:24,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:24,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 02:11:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:24,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 02:11:24,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:11:24,555 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-11 02:11:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:24,814 INFO L93 Difference]: Finished difference Result 206 states and 273 transitions. [2024-10-11 02:11:24,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 02:11:24,815 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-11 02:11:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:24,817 INFO L225 Difference]: With dead ends: 206 [2024-10-11 02:11:24,817 INFO L226 Difference]: Without dead ends: 201 [2024-10-11 02:11:24,818 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-11 02:11:24,818 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-11 02:11:24,820 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-11 02:11:24,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-11 02:11:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 193. [2024-10-11 02:11:24,872 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-11 02:11:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 252 transitions. [2024-10-11 02:11:24,874 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 252 transitions. Word has length 50 [2024-10-11 02:11:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:24,874 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 252 transitions. [2024-10-11 02:11:24,874 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-11 02:11:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 252 transitions. [2024-10-11 02:11:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 02:11:24,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:24,879 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-11 02:11:24,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:11:25,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:11:25,080 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:25,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1904373439, now seen corresponding path program 1 times [2024-10-11 02:11:25,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:25,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091873733] [2024-10-11 02:11:25,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:25,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:11:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:11:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:11:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:11:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:11:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,230 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-11 02:11:25,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:25,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091873733] [2024-10-11 02:11:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091873733] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:25,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985031782] [2024-10-11 02:11:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:25,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:25,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:25,234 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:25,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:11:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:25,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:11:25,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:25,347 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-11 02:11:25,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:25,437 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-11 02:11:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985031782] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:25,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:25,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2024-10-11 02:11:25,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960937800] [2024-10-11 02:11:25,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:25,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:11:25,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:25,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:11:25,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:11:25,440 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-11 02:11:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:25,584 INFO L93 Difference]: Finished difference Result 486 states and 675 transitions. [2024-10-11 02:11:25,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:11:25,585 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-11 02:11:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:25,588 INFO L225 Difference]: With dead ends: 486 [2024-10-11 02:11:25,588 INFO L226 Difference]: Without dead ends: 350 [2024-10-11 02:11:25,588 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-11 02:11:25,589 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-11 02:11:25,589 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-11 02:11:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-11 02:11:25,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 337. [2024-10-11 02:11:25,709 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-11 02:11:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 462 transitions. [2024-10-11 02:11:25,713 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 462 transitions. Word has length 86 [2024-10-11 02:11:25,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:25,713 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 462 transitions. [2024-10-11 02:11:25,713 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-11 02:11:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 462 transitions. [2024-10-11 02:11:25,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 02:11:25,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:25,715 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-11 02:11:25,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 02:11:25,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 02:11:25,920 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:25,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1715119347, now seen corresponding path program 2 times [2024-10-11 02:11:25,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:25,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128066664] [2024-10-11 02:11:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:26,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:26,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:26,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:26,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:26,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:26,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:11:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:26,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:11:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:11:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:26,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:11:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:11:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:26,183 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-11 02:11:26,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:26,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128066664] [2024-10-11 02:11:26,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128066664] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:26,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845083817] [2024-10-11 02:11:26,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 02:11:26,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:26,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:26,185 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:26,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 02:11:26,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 02:11:26,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:11:26,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 02:11:26,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:26,348 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-11 02:11:26,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-11 02:11:26,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845083817] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:26,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:26,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 22 [2024-10-11 02:11:26,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347340801] [2024-10-11 02:11:26,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:26,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 02:11:26,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:26,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 02:11:26,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=269, Unknown=0, NotChecked=0, Total=462 [2024-10-11 02:11:26,598 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-11 02:11:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:27,287 INFO L93 Difference]: Finished difference Result 980 states and 1408 transitions. [2024-10-11 02:11:27,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 02:11:27,288 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-11 02:11:27,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:27,293 INFO L225 Difference]: With dead ends: 980 [2024-10-11 02:11:27,293 INFO L226 Difference]: Without dead ends: 837 [2024-10-11 02:11:27,294 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-11 02:11:27,295 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-11 02:11:27,295 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-11 02:11:27,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-11 02:11:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 788. [2024-10-11 02:11:27,524 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-11 02:11:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1095 transitions. [2024-10-11 02:11:27,528 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1095 transitions. Word has length 86 [2024-10-11 02:11:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:27,529 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1095 transitions. [2024-10-11 02:11:27,529 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-11 02:11:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1095 transitions. [2024-10-11 02:11:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:11:27,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:27,531 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-11 02:11:27,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 02:11:27,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:27,732 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:27,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:27,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1117496236, now seen corresponding path program 1 times [2024-10-11 02:11:27,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:27,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146141667] [2024-10-11 02:11:27,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:27,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:27,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:27,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:27,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:27,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:11:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:27,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:11:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:27,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:11:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:28,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:11:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:28,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:11:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:28,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:11:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:28,010 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-11 02:11:28,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:28,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146141667] [2024-10-11 02:11:28,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146141667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:28,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843840674] [2024-10-11 02:11:28,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:28,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:28,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:28,013 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:28,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 02:11:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:28,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 02:11:28,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:28,219 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-11 02:11:28,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:28,503 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-11 02:11:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843840674] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:28,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 26 [2024-10-11 02:11:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500470796] [2024-10-11 02:11:28,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 02:11:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:28,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 02:11:28,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=371, Unknown=0, NotChecked=0, Total=650 [2024-10-11 02:11:28,505 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-11 02:11:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:29,329 INFO L93 Difference]: Finished difference Result 1280 states and 1779 transitions. [2024-10-11 02:11:29,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-11 02:11:29,330 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-11 02:11:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:29,335 INFO L225 Difference]: With dead ends: 1280 [2024-10-11 02:11:29,336 INFO L226 Difference]: Without dead ends: 790 [2024-10-11 02:11:29,337 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-11 02:11:29,338 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-11 02:11:29,338 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-11 02:11:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-10-11 02:11:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 734. [2024-10-11 02:11:29,491 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-11 02:11:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 994 transitions. [2024-10-11 02:11:29,494 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 994 transitions. Word has length 92 [2024-10-11 02:11:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:29,495 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 994 transitions. [2024-10-11 02:11:29,495 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-11 02:11:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 994 transitions. [2024-10-11 02:11:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:11:29,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:29,498 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-11 02:11:29,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 02:11:29,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 02:11:29,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:29,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash -32862541, now seen corresponding path program 1 times [2024-10-11 02:11:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:29,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919522102] [2024-10-11 02:11:29,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:11:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:11:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:11:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:11:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:11:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:11:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:11:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,059 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-11 02:11:30,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:30,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919522102] [2024-10-11 02:11:30,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919522102] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:30,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281651316] [2024-10-11 02:11:30,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:30,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:30,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:30,062 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:30,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 02:11:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:30,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 02:11:30,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:30,283 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-11 02:11:30,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:30,633 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-11 02:11:30,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281651316] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:30,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:30,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 28 [2024-10-11 02:11:30,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791510686] [2024-10-11 02:11:30,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:30,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 02:11:30,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:30,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 02:11:30,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2024-10-11 02:11:30,636 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-11 02:11:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:31,375 INFO L93 Difference]: Finished difference Result 845 states and 1153 transitions. [2024-10-11 02:11:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-11 02:11:31,376 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-11 02:11:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:31,380 INFO L225 Difference]: With dead ends: 845 [2024-10-11 02:11:31,380 INFO L226 Difference]: Without dead ends: 840 [2024-10-11 02:11:31,381 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-11 02:11:31,381 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-11 02:11:31,381 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-11 02:11:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-10-11 02:11:31,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 825. [2024-10-11 02:11:31,520 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-11 02:11:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1104 transitions. [2024-10-11 02:11:31,523 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1104 transitions. Word has length 98 [2024-10-11 02:11:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:31,524 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1104 transitions. [2024-10-11 02:11:31,524 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-11 02:11:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1104 transitions. [2024-10-11 02:11:31,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 02:11:31,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:31,527 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-11 02:11:31,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 02:11:31,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:31,732 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:31,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1211281524, now seen corresponding path program 3 times [2024-10-11 02:11:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:31,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929427086] [2024-10-11 02:11:31,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:11:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:11:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:11:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:11:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:11:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:11:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:11:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:11:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:11:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:11:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:11:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:11:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 02:11:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 02:11:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 02:11:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 02:11:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:31,861 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-11 02:11:31,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:31,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929427086] [2024-10-11 02:11:31,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929427086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:31,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:31,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:11:31,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563629276] [2024-10-11 02:11:31,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:31,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:11:31,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:31,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:11:31,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:31,863 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-11 02:11:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:32,044 INFO L93 Difference]: Finished difference Result 1368 states and 1828 transitions. [2024-10-11 02:11:32,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:11:32,046 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-11 02:11:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:32,050 INFO L225 Difference]: With dead ends: 1368 [2024-10-11 02:11:32,051 INFO L226 Difference]: Without dead ends: 863 [2024-10-11 02:11:32,052 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-11 02:11:32,054 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-11 02:11:32,054 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-11 02:11:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-10-11 02:11:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 808. [2024-10-11 02:11:32,215 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-11 02:11:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1070 transitions. [2024-10-11 02:11:32,221 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1070 transitions. Word has length 176 [2024-10-11 02:11:32,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:32,221 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1070 transitions. [2024-10-11 02:11:32,221 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-11 02:11:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1070 transitions. [2024-10-11 02:11:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 02:11:32,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:32,226 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-11 02:11:32,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:11:32,226 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:32,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:32,226 INFO L85 PathProgramCache]: Analyzing trace with hash 231275114, now seen corresponding path program 4 times [2024-10-11 02:11:32,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:32,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363387621] [2024-10-11 02:11:32,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:32,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:11:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:11:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:11:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:11:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:11:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:11:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:11:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:11:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:11:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:11:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:11:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:11:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:11:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:11:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 02:11:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 02:11:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 02:11:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 02:11:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:32,971 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-11 02:11:32,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:32,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363387621] [2024-10-11 02:11:32,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363387621] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:32,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283236672] [2024-10-11 02:11:32,972 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 02:11:32,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:32,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:32,974 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:32,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 02:11:33,068 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 02:11:33,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:11:33,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 02:11:33,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:38,759 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-11 02:11:38,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:39,582 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-11 02:11:39,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283236672] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:39,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:39,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 38 [2024-10-11 02:11:39,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898288157] [2024-10-11 02:11:39,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:39,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 02:11:39,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:39,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 02:11:39,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1159, Unknown=1, NotChecked=0, Total=1406 [2024-10-11 02:11:39,586 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-11 02:11:43,661 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-11 02:11:51,917 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-11 02:11:56,043 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-11 02:11:57,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 02:12:01,152 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-11 02:12:13,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-11 02:12:14,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 02:12:23,042 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-11 02:12:27,103 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-11 02:12:31,131 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-11 02:12:39,610 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-11 02:12:49,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]