./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/mannadiv_unwindbound20.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/mannadiv_unwindbound20.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 4a3cef13903dd032b032a92c3e6d07b1ee77361a4ee844998d70fb602ded6daa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:25:27,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:25:27,245 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:25:27,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:25:27,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:25:27,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:25:27,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:25:27,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:25:27,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:25:27,273 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:25:27,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:25:27,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:25:27,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:25:27,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:25:27,274 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:25:27,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:25:27,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:25:27,275 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:25:27,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:25:27,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:25:27,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:25:27,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:25:27,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:25:27,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:25:27,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:25:27,277 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:25:27,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:25:27,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:25:27,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:25:27,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:25:27,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:25:27,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:25:27,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:25:27,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:25:27,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:25:27,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:25:27,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:25:27,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:25:27,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:25:27,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:25:27,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:25:27,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:25:27,288 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 -> 4a3cef13903dd032b032a92c3e6d07b1ee77361a4ee844998d70fb602ded6daa [2024-10-11 02:25:27,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:25:27,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:25:27,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:25:27,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:25:27,525 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:25:27,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.c [2024-10-11 02:25:28,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:25:28,965 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:25:28,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound20.c [2024-10-11 02:25:28,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/72e10ffed/36a17811746045e5ad9f64bf8ee79b83/FLAG36299dcb7 [2024-10-11 02:25:28,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/72e10ffed/36a17811746045e5ad9f64bf8ee79b83 [2024-10-11 02:25:28,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:25:28,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:25:28,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:25:28,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:25:28,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:25:28,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:25:28" (1/1) ... [2024-10-11 02:25:28,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387e1577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:28, skipping insertion in model container [2024-10-11 02:25:28,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:25:28" (1/1) ... [2024-10-11 02:25:29,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:25:29,151 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/mannadiv_unwindbound20.c[573,586] [2024-10-11 02:25:29,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:25:29,170 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:25:29,181 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/mannadiv_unwindbound20.c[573,586] [2024-10-11 02:25:29,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:25:29,196 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:25:29,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:29 WrapperNode [2024-10-11 02:25:29,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:25:29,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:25:29,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:25:29,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:25:29,204 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:25:29" (1/1) ... [2024-10-11 02:25:29,209 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:25:29" (1/1) ... [2024-10-11 02:25:29,223 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-10-11 02:25:29,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:25:29,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:25:29,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:25:29,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:25:29,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:29" (1/1) ... [2024-10-11 02:25:29,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:29" (1/1) ... [2024-10-11 02:25:29,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:29" (1/1) ... [2024-10-11 02:25:29,240 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:25:29,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:29" (1/1) ... [2024-10-11 02:25:29,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:29" (1/1) ... [2024-10-11 02:25:29,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:29" (1/1) ... [2024-10-11 02:25:29,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:29" (1/1) ... [2024-10-11 02:25:29,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:29" (1/1) ... [2024-10-11 02:25:29,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:29" (1/1) ... [2024-10-11 02:25:29,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:25:29,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:25:29,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:25:29,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:25:29,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:29" (1/1) ... [2024-10-11 02:25:29,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:25:29,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:25:29,277 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:25:29,279 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:25:29,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:25:29,323 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 02:25:29,323 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 02:25:29,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:25:29,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:25:29,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:25:29,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 02:25:29,324 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 02:25:29,399 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:25:29,402 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:25:29,486 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-11 02:25:29,486 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:25:29,505 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:25:29,506 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:25:29,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:25:29 BoogieIcfgContainer [2024-10-11 02:25:29,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:25:29,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:25:29,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:25:29,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:25:29,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:25:28" (1/3) ... [2024-10-11 02:25:29,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6648318d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:25:29, skipping insertion in model container [2024-10-11 02:25:29,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:29" (2/3) ... [2024-10-11 02:25:29,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6648318d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:25:29, skipping insertion in model container [2024-10-11 02:25:29,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:25:29" (3/3) ... [2024-10-11 02:25:29,513 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound20.c [2024-10-11 02:25:29,525 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:25:29,526 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:25:29,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:25:29,597 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;@43480cf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:25:29,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:25:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 02:25:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:25:29,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:25:29,614 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:25:29,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:25:29,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:25:29,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1060579028, now seen corresponding path program 1 times [2024-10-11 02:25:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:25:29,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112683563] [2024-10-11 02:25:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:25:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:29,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:25:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:29,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:25:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:29,840 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:25:29,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:25:29,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112683563] [2024-10-11 02:25:29,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112683563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:25:29,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:25:29,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:25:29,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934794592] [2024-10-11 02:25:29,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:25:29,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:25:29,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:25:29,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:25:29,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:25:29,870 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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:25:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:25:29,887 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2024-10-11 02:25:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:25:29,889 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:25:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:25:29,893 INFO L225 Difference]: With dead ends: 42 [2024-10-11 02:25:29,894 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 02:25:29,896 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:25:29,898 INFO L432 NwaCegarLoop]: 24 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, 24 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:25:29,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:25:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 02:25:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 02:25:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 02:25:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-11 02:25:29,927 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2024-10-11 02:25:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:25:29,927 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-11 02:25:29,928 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:25:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-11 02:25:29,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:25:29,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:25:29,929 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:25:29,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:25:29,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:25:29,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:25:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash -778881514, now seen corresponding path program 1 times [2024-10-11 02:25:29,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:25:29,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122485046] [2024-10-11 02:25:29,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:29,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:25:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:25:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:30,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:25:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:30,078 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:25:30,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:25:30,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122485046] [2024-10-11 02:25:30,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122485046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:25:30,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:25:30,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:25:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579272452] [2024-10-11 02:25:30,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:25:30,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:25:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:25:30,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:25:30,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:25:30,081 INFO L87 Difference]: Start difference. First operand 20 states and 24 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:25:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:25:30,110 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-10-11 02:25:30,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:25:30,111 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:25:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:25:30,111 INFO L225 Difference]: With dead ends: 29 [2024-10-11 02:25:30,111 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 02:25:30,112 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:25:30,113 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 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:25:30,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:25:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 02:25:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 02:25:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 02:25:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-11 02:25:30,122 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2024-10-11 02:25:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:25:30,123 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-11 02:25:30,123 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:25:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-11 02:25:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:25:30,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:25:30,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:25:30,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:25:30,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:25:30,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:25:30,127 INFO L85 PathProgramCache]: Analyzing trace with hash -777094054, now seen corresponding path program 1 times [2024-10-11 02:25:30,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:25:30,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999693891] [2024-10-11 02:25:30,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:30,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:25:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:25:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388077904] [2024-10-11 02:25:30,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:30,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:25:30,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:25:30,158 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:25:30,162 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:25:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:30,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:25:30,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:25:30,387 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:25:30,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:25:30,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:25:30,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999693891] [2024-10-11 02:25:30,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:25:30,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388077904] [2024-10-11 02:25:30,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388077904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:25:30,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:25:30,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:25:30,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327672283] [2024-10-11 02:25:30,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:25:30,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:25:30,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:25:30,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:25:30,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:25:30,394 INFO L87 Difference]: Start difference. First operand 22 states and 26 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:25:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:25:30,461 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-10-11 02:25:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:25:30,461 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:25:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:25:30,462 INFO L225 Difference]: With dead ends: 31 [2024-10-11 02:25:30,462 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 02:25:30,463 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:25:30,463 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:25:30,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 62 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:25:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 02:25:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-10-11 02:25:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 02:25:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-11 02:25:30,472 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2024-10-11 02:25:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:25:30,472 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-11 02:25:30,472 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:25:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-11 02:25:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 02:25:30,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:25:30,474 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:25:30,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:25:30,677 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:25:30,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:25:30,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:25:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash -331201790, now seen corresponding path program 1 times [2024-10-11 02:25:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:25:30,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329324155] [2024-10-11 02:25:30,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:30,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:25:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:30,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:25:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:30,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:25:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:30,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:25:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:25:30,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:25:30,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329324155] [2024-10-11 02:25:30,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329324155] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:25:30,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890475807] [2024-10-11 02:25:30,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:30,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:25:30,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:25:30,950 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:25:30,953 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:25:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:30,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:25:31,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:25:31,094 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:25:31,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:25:31,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890475807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:25:31,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:25:31,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-10-11 02:25:31,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962796597] [2024-10-11 02:25:31,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:25:31,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:25:31,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:25:31,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:25:31,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:25:31,096 INFO L87 Difference]: Start difference. First operand 27 states and 31 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, (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:25:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:25:31,169 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-10-11 02:25:31,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:25:31,170 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, (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 24 [2024-10-11 02:25:31,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:25:31,171 INFO L225 Difference]: With dead ends: 36 [2024-10-11 02:25:31,171 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 02:25:31,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:25:31,172 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:25:31,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 78 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:25:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 02:25:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-10-11 02:25:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 02:25:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-11 02:25:31,179 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2024-10-11 02:25:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:25:31,179 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-11 02:25:31,179 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, (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:25:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-11 02:25:31,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 02:25:31,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:25:31,181 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:25:31,194 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:25:31,385 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:25:31,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:25:31,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:25:31,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1584280999, now seen corresponding path program 1 times [2024-10-11 02:25:31,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:25:31,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649248356] [2024-10-11 02:25:31,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:31,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:25:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:31,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:25:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:31,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:25:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:31,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:25:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:25:31,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:25:31,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649248356] [2024-10-11 02:25:31,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649248356] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:25:31,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027254941] [2024-10-11 02:25:31,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:31,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:25:31,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:25:31,495 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:25:31,497 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:25:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:31,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 02:25:31,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:25:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:25:31,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:25:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:25:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027254941] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:25:31,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:25:31,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-10-11 02:25:31,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178308253] [2024-10-11 02:25:31,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:25:31,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:25:31,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:25:31,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:25:31,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:25:31,637 INFO L87 Difference]: Start difference. First operand 28 states and 32 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, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 02:25:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:25:31,696 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-10-11 02:25:31,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:25:31,696 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, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 27 [2024-10-11 02:25:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:25:31,697 INFO L225 Difference]: With dead ends: 62 [2024-10-11 02:25:31,698 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 02:25:31,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:25:31,699 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:25:31,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 92 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:25:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 02:25:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-10-11 02:25:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 39 states have internal predecessors, (47), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 02:25:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-10-11 02:25:31,709 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 27 [2024-10-11 02:25:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:25:31,709 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-10-11 02:25:31,709 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, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 02:25:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-10-11 02:25:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 02:25:31,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:25:31,710 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:25:31,722 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:25:31,914 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:25:31,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:25:31,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:25:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1582493539, now seen corresponding path program 1 times [2024-10-11 02:25:31,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:25:31,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79960446] [2024-10-11 02:25:31,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:31,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:25:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:25:31,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1423713778] [2024-10-11 02:25:31,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:31,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:25:31,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:25:31,938 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:25:31,944 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:25:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:31,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 02:25:31,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:25:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:25:32,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:25:32,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:25:32,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:25:32,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79960446] [2024-10-11 02:25:32,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:25:32,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423713778] [2024-10-11 02:25:32,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423713778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:25:32,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 02:25:32,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 02:25:32,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088205898] [2024-10-11 02:25:32,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 02:25:32,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:25:32,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:25:32,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:25:32,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:25:32,116 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 02:25:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:25:32,187 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2024-10-11 02:25:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:25:32,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-10-11 02:25:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:25:32,188 INFO L225 Difference]: With dead ends: 106 [2024-10-11 02:25:32,188 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 02:25:32,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:25:32,189 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:25:32,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:25:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 02:25:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2024-10-11 02:25:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 02:25:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2024-10-11 02:25:32,198 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 27 [2024-10-11 02:25:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:25:32,198 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2024-10-11 02:25:32,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 02:25:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-10-11 02:25:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 02:25:32,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:25:32,199 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:25:32,215 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:25:32,403 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,SelfDestructingSolverStorable5 [2024-10-11 02:25:32,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:25:32,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:25:32,404 INFO L85 PathProgramCache]: Analyzing trace with hash 943937797, now seen corresponding path program 1 times [2024-10-11 02:25:32,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:25:32,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669191599] [2024-10-11 02:25:32,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:32,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:25:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:32,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:25:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:32,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:25:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:32,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:25:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:32,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:25:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:25:32,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:25:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669191599] [2024-10-11 02:25:32,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669191599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:25:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789156884] [2024-10-11 02:25:32,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:32,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:25:32,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:25:32,551 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:25:32,552 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:25:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:32,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 02:25:32,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:25:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 02:25:32,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:25:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:25:32,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789156884] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:25:32,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:25:32,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 15 [2024-10-11 02:25:32,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110339834] [2024-10-11 02:25:32,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:25:32,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 02:25:32,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:25:32,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 02:25:32,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:25:32,840 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:25:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:25:32,939 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2024-10-11 02:25:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:25:32,941 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 33 [2024-10-11 02:25:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:25:32,942 INFO L225 Difference]: With dead ends: 62 [2024-10-11 02:25:32,942 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 02:25:32,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:25:32,944 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:25:32,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 117 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:25:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 02:25:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-11 02:25:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 02:25:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-10-11 02:25:32,964 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 33 [2024-10-11 02:25:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:25:32,964 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-10-11 02:25:32,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:25:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-10-11 02:25:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 02:25:32,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:25:32,966 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:25:32,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 02:25:33,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:25:33,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:25:33,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:25:33,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1262136106, now seen corresponding path program 2 times [2024-10-11 02:25:33,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:25:33,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968354974] [2024-10-11 02:25:33,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:33,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:25:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:33,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:25:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:33,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:25:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:33,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:25:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:33,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:25:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:33,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:25:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:33,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:25:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:25:33,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:25:33,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968354974] [2024-10-11 02:25:33,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968354974] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:25:33,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173199656] [2024-10-11 02:25:33,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 02:25:33,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:25:33,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:25:33,351 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:25:33,352 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:25:33,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 02:25:33,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:25:33,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:25:33,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:25:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:25:33,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:25:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:25:33,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173199656] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:25:33,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:25:33,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-10-11 02:25:33,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373441253] [2024-10-11 02:25:33,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:25:33,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 02:25:33,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:25:33,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 02:25:33,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:25:33,566 INFO L87 Difference]: Start difference. First operand 56 states and 62 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, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-11 02:25:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:25:33,698 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2024-10-11 02:25:33,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 02:25:33,698 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, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 54 [2024-10-11 02:25:33,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:25:33,702 INFO L225 Difference]: With dead ends: 115 [2024-10-11 02:25:33,702 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 02:25:33,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 112 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:25:33,702 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 62 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:25:33,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 113 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:25:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 02:25:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 02:25:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.130952380952381) internal successors, (95), 84 states have internal predecessors, (95), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 02:25:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2024-10-11 02:25:33,720 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 54 [2024-10-11 02:25:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:25:33,720 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2024-10-11 02:25:33,720 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, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-11 02:25:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2024-10-11 02:25:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 02:25:33,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:25:33,724 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:25:33,736 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:25:33,924 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,SelfDestructingSolverStorable7 [2024-10-11 02:25:33,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:25:33,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:25:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash -254685450, now seen corresponding path program 3 times [2024-10-11 02:25:33,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:25:33,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358133087] [2024-10-11 02:25:33,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:33,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:25:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:25:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:25:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:25:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:25:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:25:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:25:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:25:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:25:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:25:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:25:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:25:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:25:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:25:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 02:25:34,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:25:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358133087] [2024-10-11 02:25:34,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358133087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:25:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122292123] [2024-10-11 02:25:34,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 02:25:34,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:25:34,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:25:34,322 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:25:34,330 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:25:34,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 02:25:34,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:25:34,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 02:25:34,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:25:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:25:34,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:25:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 02:25:34,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122292123] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:25:34,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:25:34,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 26 [2024-10-11 02:25:34,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268418414] [2024-10-11 02:25:34,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:25:34,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 02:25:34,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:25:34,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 02:25:34,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2024-10-11 02:25:34,795 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 22 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) [2024-10-11 02:25:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:25:35,132 INFO L93 Difference]: Finished difference Result 205 states and 236 transitions. [2024-10-11 02:25:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-11 02:25:35,133 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 22 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) Word has length 108 [2024-10-11 02:25:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:25:35,134 INFO L225 Difference]: With dead ends: 205 [2024-10-11 02:25:35,134 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 02:25:35,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=687, Invalid=1205, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 02:25:35,135 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 114 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:25:35,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 179 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:25:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 02:25:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-10-11 02:25:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 154 states have (on average 1.1363636363636365) internal successors, (175), 154 states have internal predecessors, (175), 24 states have call successors, (24), 22 states have call predecessors, (24), 21 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 02:25:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2024-10-11 02:25:35,152 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 108 [2024-10-11 02:25:35,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:25:35,153 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2024-10-11 02:25:35,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.0) internal successors, (130), 26 states have internal predecessors, (130), 22 states have call successors, (36), 13 states have call predecessors, (36), 12 states have return successors, (35), 21 states have call predecessors, (35), 21 states have call successors, (35) [2024-10-11 02:25:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2024-10-11 02:25:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 02:25:35,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:25:35,155 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:25:35,167 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:25:35,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:25:35,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:25:35,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:25:35,360 INFO L85 PathProgramCache]: Analyzing trace with hash 351932374, now seen corresponding path program 4 times [2024-10-11 02:25:35,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:25:35,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903815713] [2024-10-11 02:25:35,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:25:35,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:25:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:25:35,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [84693533] [2024-10-11 02:25:35,404 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 02:25:35,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:25:35,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:25:35,405 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:25:35,406 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:25:35,499 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 02:25:35,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-11 02:25:35,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 02:25:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:25:35,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 02:25:35,584 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 02:25:35,585 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:25:35,600 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:25:35,787 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,SelfDestructingSolverStorable9 [2024-10-11 02:25:35,790 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-10-11 02:25:35,881 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:25:35,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:25:35 BoogieIcfgContainer [2024-10-11 02:25:35,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:25:35,887 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:25:35,887 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:25:35,888 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:25:35,888 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:25:29" (3/4) ... [2024-10-11 02:25:35,888 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 02:25:35,961 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:25:35,961 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:25:35,962 INFO L158 Benchmark]: Toolchain (without parser) took 6975.81ms. Allocated memory was 186.6MB in the beginning and 264.2MB in the end (delta: 77.6MB). Free memory was 114.5MB in the beginning and 134.4MB in the end (delta: -19.9MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2024-10-11 02:25:35,962 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 186.6MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:25:35,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.47ms. Allocated memory is still 186.6MB. Free memory was 114.2MB in the beginning and 102.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 02:25:35,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.19ms. Allocated memory is still 186.6MB. Free memory was 102.0MB in the beginning and 100.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:25:35,962 INFO L158 Benchmark]: Boogie Preprocessor took 23.32ms. Allocated memory is still 186.6MB. Free memory was 100.5MB in the beginning and 98.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:25:35,963 INFO L158 Benchmark]: RCFGBuilder took 258.83ms. Allocated memory is still 186.6MB. Free memory was 98.8MB in the beginning and 148.6MB in the end (delta: -49.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-10-11 02:25:35,963 INFO L158 Benchmark]: TraceAbstraction took 6379.15ms. Allocated memory was 186.6MB in the beginning and 264.2MB in the end (delta: 77.6MB). Free memory was 147.4MB in the beginning and 141.7MB in the end (delta: 5.7MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. [2024-10-11 02:25:35,963 INFO L158 Benchmark]: Witness Printer took 74.01ms. Allocated memory is still 264.2MB. Free memory was 141.7MB in the beginning and 134.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 02:25:35,968 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.14ms. Allocated memory is still 186.6MB. Free memory is still 141.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.47ms. Allocated memory is still 186.6MB. Free memory was 114.2MB in the beginning and 102.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.19ms. Allocated memory is still 186.6MB. Free memory was 102.0MB in the beginning and 100.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.32ms. Allocated memory is still 186.6MB. Free memory was 100.5MB in the beginning and 98.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 258.83ms. Allocated memory is still 186.6MB. Free memory was 98.8MB in the beginning and 148.6MB in the end (delta: -49.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6379.15ms. Allocated memory was 186.6MB in the beginning and 264.2MB in the end (delta: 77.6MB). Free memory was 147.4MB in the beginning and 141.7MB in the end (delta: 5.7MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. * Witness Printer took 74.01ms. Allocated memory is still 264.2MB. Free memory was 141.7MB in the beginning and 134.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [counter=0, x1=21, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [counter=0, x1=21, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] EXPR counter++ VAL [counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=1, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] EXPR counter++ VAL [counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=2, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] EXPR counter++ VAL [counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=3, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] EXPR counter++ VAL [counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=4, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] EXPR counter++ VAL [counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=5, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] EXPR counter++ VAL [counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=6, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] EXPR counter++ VAL [counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=7, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] EXPR counter++ VAL [counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=8, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] EXPR counter++ VAL [counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=9, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] EXPR counter++ VAL [counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=10, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] EXPR counter++ VAL [counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=11, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] EXPR counter++ VAL [counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=12, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] EXPR counter++ VAL [counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=13, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] EXPR counter++ VAL [counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=14, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] EXPR counter++ VAL [counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=15, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] EXPR counter++ VAL [counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=16, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] EXPR counter++ VAL [counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=17, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] EXPR counter++ VAL [counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=18, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] EXPR counter++ VAL [counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=19, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] EXPR counter++ VAL [counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=20, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] EXPR counter++ VAL [counter=21, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] COND FALSE !(counter++<20) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, counter=21] [L16] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L18] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 10, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 254 mSDsluCounter, 820 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 641 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 407 IncrementalHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 179 mSDtfsCounter, 407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 676 GetRequests, 559 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=9, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 802 ConstructedInterpolants, 0 QuantifiedInterpolants, 1992 SizeOfPredicates, 20 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 610/1683 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:25:35,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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