./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/egcd-ll_unwindbound10.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/egcd-ll_unwindbound10.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 0a6d36c45579adaf3871b264b96aba9fa14294bc645c23d191a4e77c149500df --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:07:40,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:07:40,513 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:07:40,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:07:40,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:07:40,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:07:40,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:07:40,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:07:40,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:07:40,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:07:40,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:07:40,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:07:40,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:07:40,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:07:40,549 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:07:40,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:07:40,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:07:40,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:07:40,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:07:40,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:07:40,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:07:40,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:07:40,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:07:40,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:07:40,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:07:40,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:07:40,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:07:40,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:07:40,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:07:40,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:07:40,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:07:40,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:07:40,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:07:40,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:07:40,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:07:40,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:07:40,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:07:40,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:07:40,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:07:40,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:07:40,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:07:40,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:07:40,559 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 -> 0a6d36c45579adaf3871b264b96aba9fa14294bc645c23d191a4e77c149500df [2024-10-11 02:07:40,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:07:40,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:07:40,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:07:40,844 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:07:40,845 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:07:40,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound10.c [2024-10-11 02:07:42,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:07:42,503 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:07:42,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound10.c [2024-10-11 02:07:42,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/426272f50/ae68f8a9044740e58504db2be5ef3f4d/FLAG36b2fb83b [2024-10-11 02:07:42,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/426272f50/ae68f8a9044740e58504db2be5ef3f4d [2024-10-11 02:07:42,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:07:42,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:07:42,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:07:42,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:07:42,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:07:42,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:07:42" (1/1) ... [2024-10-11 02:07:42,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27387b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42, skipping insertion in model container [2024-10-11 02:07:42,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:07:42" (1/1) ... [2024-10-11 02:07:42,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:07:42,746 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/egcd-ll_unwindbound10.c[489,502] [2024-10-11 02:07:42,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:07:42,782 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:07:42,796 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/egcd-ll_unwindbound10.c[489,502] [2024-10-11 02:07:42,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:07:42,821 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:07:42,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42 WrapperNode [2024-10-11 02:07:42,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:07:42,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:07:42,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:07:42,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:07:42,830 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:07:42" (1/1) ... [2024-10-11 02:07:42,837 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:07:42" (1/1) ... [2024-10-11 02:07:42,855 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2024-10-11 02:07:42,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:07:42,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:07:42,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:07:42,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:07:42,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42" (1/1) ... [2024-10-11 02:07:42,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42" (1/1) ... [2024-10-11 02:07:42,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42" (1/1) ... [2024-10-11 02:07:42,875 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:07:42,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42" (1/1) ... [2024-10-11 02:07:42,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42" (1/1) ... [2024-10-11 02:07:42,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42" (1/1) ... [2024-10-11 02:07:42,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42" (1/1) ... [2024-10-11 02:07:42,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42" (1/1) ... [2024-10-11 02:07:42,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42" (1/1) ... [2024-10-11 02:07:42,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:07:42,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:07:42,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:07:42,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:07:42,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42" (1/1) ... [2024-10-11 02:07:42,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:07:42,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:42,923 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:07:42,926 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:07:42,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:07:42,976 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 02:07:42,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 02:07:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:07:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:07:42,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:07:42,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 02:07:42,978 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 02:07:43,046 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:07:43,050 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:07:43,205 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-11 02:07:43,205 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:07:43,238 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:07:43,238 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:07:43,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:07:43 BoogieIcfgContainer [2024-10-11 02:07:43,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:07:43,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:07:43,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:07:43,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:07:43,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:07:42" (1/3) ... [2024-10-11 02:07:43,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f5246c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:07:43, skipping insertion in model container [2024-10-11 02:07:43,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:07:42" (2/3) ... [2024-10-11 02:07:43,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f5246c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:07:43, skipping insertion in model container [2024-10-11 02:07:43,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:07:43" (3/3) ... [2024-10-11 02:07:43,246 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound10.c [2024-10-11 02:07:43,260 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:07:43,261 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:07:43,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:07:43,316 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;@2142e1e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:07:43,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:07:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 02:07:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:07:43,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:43,327 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:07:43,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:43,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2138951705, now seen corresponding path program 1 times [2024-10-11 02:07:43,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:43,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733422192] [2024-10-11 02:07:43,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:07:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:43,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:07:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:43,527 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:07:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733422192] [2024-10-11 02:07:43,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733422192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:07:43,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:07:43,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:07:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238546057] [2024-10-11 02:07:43,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:07:43,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:07:43,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:43,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:07:43,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:07:43,561 INFO L87 Difference]: Start difference. First operand has 27 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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:07:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:43,620 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2024-10-11 02:07:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:07:43,623 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:07:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:43,651 INFO L225 Difference]: With dead ends: 52 [2024-10-11 02:07:43,652 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 02:07:43,655 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:07:43,659 INFO L432 NwaCegarLoop]: 34 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, 34 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:07:43,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:07:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 02:07:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-11 02:07:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 02:07:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-10-11 02:07:43,689 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 17 [2024-10-11 02:07:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:43,690 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-10-11 02:07:43,690 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:07:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-10-11 02:07:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:07:43,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:43,691 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:07:43,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:07:43,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:43,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:43,693 INFO L85 PathProgramCache]: Analyzing trace with hash -443127421, now seen corresponding path program 1 times [2024-10-11 02:07:43,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:43,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669231023] [2024-10-11 02:07:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:43,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:07:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:43,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:07:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:43,847 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:07:43,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669231023] [2024-10-11 02:07:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669231023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:07:43,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:07:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:07:43,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102315458] [2024-10-11 02:07:43,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:07:43,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:07:43,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:43,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:07:43,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:07:43,854 INFO L87 Difference]: Start difference. First operand 25 states and 34 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:07:43,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:43,887 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-10-11 02:07:43,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:07:43,888 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:07:43,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:43,889 INFO L225 Difference]: With dead ends: 37 [2024-10-11 02:07:43,889 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 02:07:43,889 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:07:43,891 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:43,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:07:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 02:07:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 02:07:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 02:07:43,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-11 02:07:43,899 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 18 [2024-10-11 02:07:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:43,900 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-11 02:07:43,900 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:07:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-11 02:07:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:07:43,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:43,901 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:07:43,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:07:43,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:43,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash -441459125, now seen corresponding path program 1 times [2024-10-11 02:07:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643576652] [2024-10-11 02:07:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:07:43,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148992168] [2024-10-11 02:07:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:43,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:43,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:43,934 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:07:43,935 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:07:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:43,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:07:44,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:07:44,125 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:07:44,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:07:44,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:44,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643576652] [2024-10-11 02:07:44,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:07:44,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148992168] [2024-10-11 02:07:44,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148992168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:07:44,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:07:44,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:07:44,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520879451] [2024-10-11 02:07:44,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:07:44,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:07:44,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:44,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:07:44,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:07:44,131 INFO L87 Difference]: Start difference. First operand 27 states and 36 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:07:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:44,208 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2024-10-11 02:07:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:07:44,209 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:07:44,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:44,210 INFO L225 Difference]: With dead ends: 44 [2024-10-11 02:07:44,210 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 02:07:44,210 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:07:44,211 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:44,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:07:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 02:07:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-10-11 02:07:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 24 states have internal predecessors, (29), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 02:07:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-10-11 02:07:44,231 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 18 [2024-10-11 02:07:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:44,231 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-10-11 02:07:44,231 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:07:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-10-11 02:07:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 02:07:44,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:44,232 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:07:44,246 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:07:44,433 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:07:44,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:44,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:44,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1203735897, now seen corresponding path program 1 times [2024-10-11 02:07:44,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:44,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005720817] [2024-10-11 02:07:44,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:07:44,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338658283] [2024-10-11 02:07:44,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:44,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:44,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:44,470 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:07:44,473 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:07:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:44,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:07:44,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:07:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:07:44,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:07:44,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:44,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005720817] [2024-10-11 02:07:44,627 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:07:44,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338658283] [2024-10-11 02:07:44,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338658283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:07:44,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:07:44,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:07:44,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941329045] [2024-10-11 02:07:44,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:07:44,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:07:44,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:44,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:07:44,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:07:44,632 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 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:07:44,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:44,715 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-10-11 02:07:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:07:44,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 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 23 [2024-10-11 02:07:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:44,717 INFO L225 Difference]: With dead ends: 48 [2024-10-11 02:07:44,718 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 02:07:44,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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:07:44,719 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:44,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 119 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:07:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 02:07:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-11 02:07:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 02:07:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2024-10-11 02:07:44,735 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 23 [2024-10-11 02:07:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:44,737 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2024-10-11 02:07:44,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 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:07:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2024-10-11 02:07:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 02:07:44,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:44,738 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:07:44,754 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:07:44,938 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:07:44,939 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:44,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash 705122187, now seen corresponding path program 1 times [2024-10-11 02:07:44,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:44,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065084721] [2024-10-11 02:07:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:44,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:07:44,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1708348950] [2024-10-11 02:07:44,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:44,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:44,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:44,972 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:07:44,973 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:07:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 02:07:45,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:07:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:07:45,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:07:45,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:45,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065084721] [2024-10-11 02:07:45,085 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:07:45,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708348950] [2024-10-11 02:07:45,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708348950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:07:45,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:07:45,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:07:45,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722540227] [2024-10-11 02:07:45,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:07:45,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:07:45,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:45,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:07:45,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:07:45,087 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:07:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:45,149 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2024-10-11 02:07:45,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:07:45,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-10-11 02:07:45,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:45,154 INFO L225 Difference]: With dead ends: 70 [2024-10-11 02:07:45,154 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 02:07:45,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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:07:45,155 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:45,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 104 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:07:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 02:07:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 02:07:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 38 states have internal predecessors, (46), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 02:07:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2024-10-11 02:07:45,175 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 28 [2024-10-11 02:07:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:45,176 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2024-10-11 02:07:45,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:07:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2024-10-11 02:07:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 02:07:45,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:45,178 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:07:45,194 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:07:45,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:45,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:45,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:45,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1795283768, now seen corresponding path program 1 times [2024-10-11 02:07:45,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:45,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493015700] [2024-10-11 02:07:45,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:45,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:07:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:07:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:07:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:07:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:07:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:07:45,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:45,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493015700] [2024-10-11 02:07:45,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493015700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:07:45,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:07:45,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:07:45,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392915580] [2024-10-11 02:07:45,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:07:45,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:07:45,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:45,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:07:45,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:07:45,578 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 02:07:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:45,640 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2024-10-11 02:07:45,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:07:45,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2024-10-11 02:07:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:45,643 INFO L225 Difference]: With dead ends: 82 [2024-10-11 02:07:45,644 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 02:07:45,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:07:45,646 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:45,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 128 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:07:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 02:07:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2024-10-11 02:07:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 44 states have internal predecessors, (49), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 02:07:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 104 transitions. [2024-10-11 02:07:45,665 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 104 transitions. Word has length 34 [2024-10-11 02:07:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:45,665 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 104 transitions. [2024-10-11 02:07:45,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 02:07:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2024-10-11 02:07:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 02:07:45,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:45,668 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] [2024-10-11 02:07:45,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:07:45,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:45,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:45,669 INFO L85 PathProgramCache]: Analyzing trace with hash -427827123, now seen corresponding path program 1 times [2024-10-11 02:07:45,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:45,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180046159] [2024-10-11 02:07:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:07:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:07:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:07:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:07:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:07:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:07:45,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:45,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180046159] [2024-10-11 02:07:45,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180046159] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:07:45,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887657817] [2024-10-11 02:07:45,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:45,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:45,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:45,857 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:07:45,858 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:07:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:45,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 02:07:45,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:07:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:07:45,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:07:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:07:46,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887657817] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:07:46,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:07:46,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-10-11 02:07:46,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765629476] [2024-10-11 02:07:46,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:07:46,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:07:46,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:46,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:07:46,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:07:46,080 INFO L87 Difference]: Start difference. First operand 73 states and 104 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 02:07:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:46,273 INFO L93 Difference]: Finished difference Result 217 states and 285 transitions. [2024-10-11 02:07:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:07:46,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 37 [2024-10-11 02:07:46,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:46,276 INFO L225 Difference]: With dead ends: 217 [2024-10-11 02:07:46,277 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 02:07:46,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:07:46,282 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:46,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 177 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:07:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 02:07:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 189. [2024-10-11 02:07:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 118 states have internal predecessors, (131), 61 states have call successors, (61), 21 states have call predecessors, (61), 20 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 02:07:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 246 transitions. [2024-10-11 02:07:46,313 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 246 transitions. Word has length 37 [2024-10-11 02:07:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:46,314 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 246 transitions. [2024-10-11 02:07:46,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-11 02:07:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 246 transitions. [2024-10-11 02:07:46,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 02:07:46,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:46,315 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 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:07:46,332 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:07:46,516 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,SelfDestructingSolverStorable6 [2024-10-11 02:07:46,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:46,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:46,516 INFO L85 PathProgramCache]: Analyzing trace with hash -426158827, now seen corresponding path program 1 times [2024-10-11 02:07:46,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:46,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784218025] [2024-10-11 02:07:46,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:46,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:07:46,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066503884] [2024-10-11 02:07:46,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:46,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:46,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:46,535 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:07:46,537 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:07:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:46,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:07:46,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:07:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:07:46,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:07:46,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:46,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784218025] [2024-10-11 02:07:46,681 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:07:46,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066503884] [2024-10-11 02:07:46,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066503884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:07:46,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:07:46,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:07:46,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738099159] [2024-10-11 02:07:46,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:07:46,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:07:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:46,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:07:46,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:07:46,685 INFO L87 Difference]: Start difference. First operand 189 states and 246 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 02:07:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:46,742 INFO L93 Difference]: Finished difference Result 203 states and 259 transitions. [2024-10-11 02:07:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:07:46,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-10-11 02:07:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:46,745 INFO L225 Difference]: With dead ends: 203 [2024-10-11 02:07:46,745 INFO L226 Difference]: Without dead ends: 198 [2024-10-11 02:07:46,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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:07:46,746 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:46,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 105 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:07:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-11 02:07:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-10-11 02:07:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 116 states have (on average 1.206896551724138) internal successors, (140), 127 states have internal predecessors, (140), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 02:07:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2024-10-11 02:07:46,787 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 37 [2024-10-11 02:07:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:46,788 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2024-10-11 02:07:46,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 02:07:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2024-10-11 02:07:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 02:07:46,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:46,789 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 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:07:46,810 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:07:46,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:46,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:46,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1298990710, now seen corresponding path program 1 times [2024-10-11 02:07:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102524138] [2024-10-11 02:07:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:47,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:07:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:47,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:07:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:47,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:07:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:47,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:07:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:47,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:07:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:47,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:07:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:07:47,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:47,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102524138] [2024-10-11 02:07:47,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102524138] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:07:47,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039408648] [2024-10-11 02:07:47,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:47,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:47,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:47,210 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:07:47,212 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:07:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:47,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:07:47,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:07:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:07:47,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:07:47,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039408648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:07:47,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:07:47,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-10-11 02:07:47,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075940848] [2024-10-11 02:07:47,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:07:47,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:07:47,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:47,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:07:47,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:07:47,349 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:07:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:47,460 INFO L93 Difference]: Finished difference Result 229 states and 278 transitions. [2024-10-11 02:07:47,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:07:47,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2024-10-11 02:07:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:47,463 INFO L225 Difference]: With dead ends: 229 [2024-10-11 02:07:47,464 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 02:07:47,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:07:47,465 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:47,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 128 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:07:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 02:07:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2024-10-11 02:07:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 129 states have (on average 1.178294573643411) internal successors, (152), 140 states have internal predecessors, (152), 57 states have call successors, (57), 28 states have call predecessors, (57), 28 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 02:07:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 260 transitions. [2024-10-11 02:07:47,492 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 260 transitions. Word has length 39 [2024-10-11 02:07:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:47,493 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 260 transitions. [2024-10-11 02:07:47,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:07:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 260 transitions. [2024-10-11 02:07:47,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 02:07:47,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:47,494 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] [2024-10-11 02:07:47,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:07:47,696 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,SelfDestructingSolverStorable8 [2024-10-11 02:07:47,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:47,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:47,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1786533347, now seen corresponding path program 2 times [2024-10-11 02:07:47,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:47,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568749885] [2024-10-11 02:07:47,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:47,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:07:47,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [329191538] [2024-10-11 02:07:47,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 02:07:47,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:47,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:47,722 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:07:47,723 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:07:47,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 02:07:47,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:07:47,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 02:07:47,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:07:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:07:48,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:07:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:07:48,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:48,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568749885] [2024-10-11 02:07:48,615 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:07:48,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329191538] [2024-10-11 02:07:48,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329191538] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:07:48,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 02:07:48,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2024-10-11 02:07:48,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933227267] [2024-10-11 02:07:48,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 02:07:48,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 02:07:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:48,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 02:07:48,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:07:48,617 INFO L87 Difference]: Start difference. First operand 215 states and 260 transitions. Second operand has 17 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 02:07:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:49,301 INFO L93 Difference]: Finished difference Result 265 states and 334 transitions. [2024-10-11 02:07:49,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:07:49,302 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 42 [2024-10-11 02:07:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:49,306 INFO L225 Difference]: With dead ends: 265 [2024-10-11 02:07:49,308 INFO L226 Difference]: Without dead ends: 263 [2024-10-11 02:07:49,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:07:49,309 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:49,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 234 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:07:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-11 02:07:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 227. [2024-10-11 02:07:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 138 states have (on average 1.1666666666666667) internal successors, (161), 149 states have internal predecessors, (161), 57 states have call successors, (57), 31 states have call predecessors, (57), 31 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 02:07:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 269 transitions. [2024-10-11 02:07:49,367 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 269 transitions. Word has length 42 [2024-10-11 02:07:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:49,367 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 269 transitions. [2024-10-11 02:07:49,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 02:07:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 269 transitions. [2024-10-11 02:07:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 02:07:49,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:49,370 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:07:49,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 02:07:49,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:49,575 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:49,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1675496919, now seen corresponding path program 1 times [2024-10-11 02:07:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:49,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051072178] [2024-10-11 02:07:49,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:07:49,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1678310943] [2024-10-11 02:07:49,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:49,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:49,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:49,591 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:07:49,594 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:07:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:49,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 02:07:49,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:07:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-11 02:07:49,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:07:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:07:50,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051072178] [2024-10-11 02:07:50,281 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:07:50,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678310943] [2024-10-11 02:07:50,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678310943] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:07:50,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 02:07:50,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-10-11 02:07:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822550609] [2024-10-11 02:07:50,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 02:07:50,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 02:07:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:50,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 02:07:50,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:07:50,285 INFO L87 Difference]: Start difference. First operand 227 states and 269 transitions. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 02:07:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:52,099 INFO L93 Difference]: Finished difference Result 276 states and 341 transitions. [2024-10-11 02:07:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 02:07:52,099 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 47 [2024-10-11 02:07:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:52,101 INFO L225 Difference]: With dead ends: 276 [2024-10-11 02:07:52,101 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 02:07:52,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:07:52,102 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:52,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 194 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:07:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 02:07:52,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 199. [2024-10-11 02:07:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 128 states have (on average 1.1484375) internal successors, (147), 134 states have internal predecessors, (147), 43 states have call successors, (43), 28 states have call predecessors, (43), 27 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 02:07:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 228 transitions. [2024-10-11 02:07:52,148 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 228 transitions. Word has length 47 [2024-10-11 02:07:52,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:52,148 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 228 transitions. [2024-10-11 02:07:52,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 02:07:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 228 transitions. [2024-10-11 02:07:52,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 02:07:52,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:52,150 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:07:52,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 02:07:52,354 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,SelfDestructingSolverStorable10 [2024-10-11 02:07:52,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:52,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash -882918259, now seen corresponding path program 1 times [2024-10-11 02:07:52,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:52,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652872685] [2024-10-11 02:07:52,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:52,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:07:52,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [729207346] [2024-10-11 02:07:52,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:52,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:52,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:52,373 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:07:52,375 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:07:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:52,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 02:07:52,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:07:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-11 02:07:52,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:07:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 02:07:52,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:52,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652872685] [2024-10-11 02:07:52,951 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:07:52,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729207346] [2024-10-11 02:07:52,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729207346] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:07:52,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 02:07:52,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-10-11 02:07:52,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895676916] [2024-10-11 02:07:52,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 02:07:52,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 02:07:52,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:52,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 02:07:52,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:07:52,954 INFO L87 Difference]: Start difference. First operand 199 states and 228 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-11 02:07:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:53,370 INFO L93 Difference]: Finished difference Result 219 states and 254 transitions. [2024-10-11 02:07:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:07:53,371 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 56 [2024-10-11 02:07:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:53,373 INFO L225 Difference]: With dead ends: 219 [2024-10-11 02:07:53,373 INFO L226 Difference]: Without dead ends: 212 [2024-10-11 02:07:53,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:07:53,374 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:53,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 365 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:07:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-11 02:07:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 190. [2024-10-11 02:07:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 128 states have (on average 1.140625) internal successors, (146), 130 states have internal predecessors, (146), 34 states have call successors, (34), 28 states have call predecessors, (34), 27 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 02:07:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 212 transitions. [2024-10-11 02:07:53,422 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 212 transitions. Word has length 56 [2024-10-11 02:07:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:53,422 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 212 transitions. [2024-10-11 02:07:53,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-11 02:07:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 212 transitions. [2024-10-11 02:07:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 02:07:53,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:53,423 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 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:07:53,440 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:07:53,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:53,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:53,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1456768256, now seen corresponding path program 1 times [2024-10-11 02:07:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:53,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235501987] [2024-10-11 02:07:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:53,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:53,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:07:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:53,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:07:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:53,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:07:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:53,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:07:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:53,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:07:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:53,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:07:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:53,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:07:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:53,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:07:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:53,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:07:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-11 02:07:53,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:53,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235501987] [2024-10-11 02:07:53,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235501987] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:07:53,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037626251] [2024-10-11 02:07:53,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:53,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:53,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:53,808 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:07:53,813 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:07:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:53,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 02:07:53,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:07:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-11 02:07:53,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:07:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-11 02:07:54,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037626251] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:07:54,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:07:54,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 13 [2024-10-11 02:07:54,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343235164] [2024-10-11 02:07:54,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:07:54,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 02:07:54,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:54,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 02:07:54,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:07:54,033 INFO L87 Difference]: Start difference. First operand 190 states and 212 transitions. Second operand has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 02:07:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:54,176 INFO L93 Difference]: Finished difference Result 216 states and 241 transitions. [2024-10-11 02:07:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:07:54,176 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 58 [2024-10-11 02:07:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:54,177 INFO L225 Difference]: With dead ends: 216 [2024-10-11 02:07:54,178 INFO L226 Difference]: Without dead ends: 196 [2024-10-11 02:07:54,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:07:54,178 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:54,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 115 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:07:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-11 02:07:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 97. [2024-10-11 02:07:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 67 states have internal predecessors, (72), 17 states have call successors, (17), 14 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 02:07:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2024-10-11 02:07:54,219 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 58 [2024-10-11 02:07:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:54,221 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2024-10-11 02:07:54,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 02:07:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2024-10-11 02:07:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:07:54,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:54,222 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:07:54,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 02:07:54,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 02:07:54,423 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:54,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash -11441917, now seen corresponding path program 2 times [2024-10-11 02:07:54,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:54,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346886419] [2024-10-11 02:07:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:07:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:07:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:07:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:07:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:07:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:07:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:07:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:07:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:07:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:07:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:07:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:07:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:07:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:07:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:07:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-10-11 02:07:54,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:07:54,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346886419] [2024-10-11 02:07:54,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346886419] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:07:54,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389193363] [2024-10-11 02:07:54,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 02:07:54,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:54,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:54,634 INFO L229 MonitoredProcess]: Starting monitored process 12 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:07:54,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 02:07:54,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 02:07:54,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:07:54,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:07:54,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:07:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 02:07:54,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:07:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-10-11 02:07:54,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389193363] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:07:54,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:07:54,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-10-11 02:07:54,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593254208] [2024-10-11 02:07:54,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:07:54,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 02:07:54,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:07:54,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 02:07:54,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:07:54,951 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 12 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2024-10-11 02:07:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:07:55,171 INFO L93 Difference]: Finished difference Result 232 states and 257 transitions. [2024-10-11 02:07:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 02:07:55,171 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 12 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) Word has length 94 [2024-10-11 02:07:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:07:55,173 INFO L225 Difference]: With dead ends: 232 [2024-10-11 02:07:55,173 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 02:07:55,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-10-11 02:07:55,174 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:07:55,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 172 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:07:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 02:07:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 211. [2024-10-11 02:07:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 143 states have (on average 1.0909090909090908) internal successors, (156), 145 states have internal predecessors, (156), 35 states have call successors, (35), 32 states have call predecessors, (35), 32 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 02:07:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 224 transitions. [2024-10-11 02:07:55,227 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 224 transitions. Word has length 94 [2024-10-11 02:07:55,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:07:55,227 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 224 transitions. [2024-10-11 02:07:55,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 12 states have call successors, (43), 7 states have call predecessors, (43), 6 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2024-10-11 02:07:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 224 transitions. [2024-10-11 02:07:55,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 02:07:55,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:07:55,230 INFO L215 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:07:55,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 02:07:55,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 02:07:55,431 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:07:55,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:07:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1428770883, now seen corresponding path program 3 times [2024-10-11 02:07:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:07:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174110053] [2024-10-11 02:07:55,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:07:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:07:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:07:55,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141514655] [2024-10-11 02:07:55,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 02:07:55,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:07:55,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:07:55,479 INFO L229 MonitoredProcess]: Starting monitored process 13 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:07:55,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 02:07:55,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2024-10-11 02:07:55,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-11 02:07:55,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 02:07:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:07:55,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 02:07:55,812 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 02:07:55,814 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:07:55,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 02:07:56,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 02:07:56,020 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:07:56,097 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:07:56,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:07:56 BoogieIcfgContainer [2024-10-11 02:07:56,101 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:07:56,102 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:07:56,102 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:07:56,102 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:07:56,103 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:07:43" (3/4) ... [2024-10-11 02:07:56,103 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 02:07:56,207 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:07:56,207 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:07:56,208 INFO L158 Benchmark]: Toolchain (without parser) took 13673.98ms. Allocated memory was 167.8MB in the beginning and 287.3MB in the end (delta: 119.5MB). Free memory was 112.0MB in the beginning and 193.5MB in the end (delta: -81.6MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-10-11 02:07:56,208 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:07:56,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.27ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 98.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 02:07:56,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.04ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 97.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:07:56,208 INFO L158 Benchmark]: Boogie Preprocessor took 35.96ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 95.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:07:56,209 INFO L158 Benchmark]: RCFGBuilder took 346.79ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 82.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 02:07:56,209 INFO L158 Benchmark]: TraceAbstraction took 12860.28ms. Allocated memory was 167.8MB in the beginning and 287.3MB in the end (delta: 119.5MB). Free memory was 82.1MB in the beginning and 200.9MB in the end (delta: -118.8MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-10-11 02:07:56,209 INFO L158 Benchmark]: Witness Printer took 105.61ms. Allocated memory is still 287.3MB. Free memory was 200.9MB in the beginning and 193.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 02:07:56,212 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.27ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 98.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.04ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 97.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.96ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 95.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 346.79ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 82.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12860.28ms. Allocated memory was 167.8MB in the beginning and 287.3MB in the end (delta: 119.5MB). Free memory was 82.1MB in the beginning and 200.9MB in the end (delta: -118.8MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Witness Printer took 105.61ms. Allocated memory is still 287.3MB. Free memory was 200.9MB in the beginning and 193.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=12, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=12, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=12, b=1, counter=0, p=1, q=0, r=0, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=1, counter=1, p=1, q=0, r=-1, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=10, b=1, counter=2, p=1, q=0, r=-2, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=1, counter=3, p=1, q=0, r=-3, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=8, b=1, counter=4, p=1, q=0, r=-4, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=1, counter=5, p=1, q=0, r=-5, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=6, b=1, counter=6, p=1, q=0, r=-6, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=1, counter=7, p=1, q=0, r=-7, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=4, b=1, counter=8, p=1, q=0, r=-8, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=1, counter=9, p=1, q=0, r=-9, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=2, b=1, counter=10, p=1, q=0, r=-10, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=2, b=1, counter=11, p=1, q=0, r=-10, s=1, x=12, y=1] [L34] COND FALSE !(counter++<10) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=11] [L11] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L13] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 15, TraceHistogramMax: 31, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 2064 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1644 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1321 IncrementalHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 420 mSDtfsCounter, 1321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 961 GetRequests, 818 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=10, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 223 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1443 NumberOfCodeBlocks, 1443 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1086 ConstructedInterpolants, 0 QuantifiedInterpolants, 3724 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1351 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 1479/1947 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 02:07:56,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE