./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex3.i --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/loop-lit/bh2017-ex3.i -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 67c3f42f5641e6993fb8445c2fa4fe121d859872ed17b178229098422831f110 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:52:26,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:52:27,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:52:27,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:52:27,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:52:27,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:52:27,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:52:27,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:52:27,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:52:27,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:52:27,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:52:27,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:52:27,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:52:27,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:52:27,090 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:52:27,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:52:27,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:52:27,091 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:52:27,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:52:27,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:52:27,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:52:27,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:52:27,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:52:27,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:52:27,093 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:52:27,093 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:52:27,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:52:27,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:52:27,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:52:27,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:52:27,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:52:27,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:52:27,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:52:27,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:52:27,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:52:27,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:52:27,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:52:27,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:52:27,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:52:27,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:52:27,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:52:27,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:52:27,099 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 -> 67c3f42f5641e6993fb8445c2fa4fe121d859872ed17b178229098422831f110 [2024-10-11 01:52:27,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:52:27,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:52:27,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:52:27,379 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:52:27,379 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:52:27,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex3.i [2024-10-11 01:52:28,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:52:28,980 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:52:28,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/bh2017-ex3.i [2024-10-11 01:52:28,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5a9c4fa5a/6c21ce68eac7402fbaf7cde9b1c02a77/FLAG7fd396fc5 [2024-10-11 01:52:29,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5a9c4fa5a/6c21ce68eac7402fbaf7cde9b1c02a77 [2024-10-11 01:52:29,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:52:29,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:52:29,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:52:29,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:52:29,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:52:29,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f67783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29, skipping insertion in model container [2024-10-11 01:52:29,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:52:29,198 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/loop-lit/bh2017-ex3.i[799,812] [2024-10-11 01:52:29,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:52:29,215 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:52:29,225 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/loop-lit/bh2017-ex3.i[799,812] [2024-10-11 01:52:29,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:52:29,241 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:52:29,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29 WrapperNode [2024-10-11 01:52:29,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:52:29,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:52:29,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:52:29,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:52:29,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,300 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2024-10-11 01:52:29,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:52:29,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:52:29,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:52:29,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:52:29,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,335 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 01:52:29,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:52:29,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:52:29,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:52:29,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:52:29,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (1/1) ... [2024-10-11 01:52:29,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:52:29,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:52:29,376 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 01:52:29,378 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 01:52:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:52:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:52:29,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:52:29,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:52:29,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 01:52:29,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 01:52:29,463 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:52:29,465 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:52:29,575 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-11 01:52:29,575 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:52:29,597 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:52:29,597 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 01:52:29,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:52:29 BoogieIcfgContainer [2024-10-11 01:52:29,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:52:29,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:52:29,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:52:29,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:52:29,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:52:29" (1/3) ... [2024-10-11 01:52:29,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb684c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:52:29, skipping insertion in model container [2024-10-11 01:52:29,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:52:29" (2/3) ... [2024-10-11 01:52:29,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb684c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:52:29, skipping insertion in model container [2024-10-11 01:52:29,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:52:29" (3/3) ... [2024-10-11 01:52:29,607 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex3.i [2024-10-11 01:52:29,623 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:52:29,624 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:52:29,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:52:29,701 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;@21abd932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:52:29,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:52:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 01:52:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 01:52:29,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:29,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 01:52:29,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:29,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1248097640, now seen corresponding path program 1 times [2024-10-11 01:52:29,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:29,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007837716] [2024-10-11 01:52:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:29,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:52:30,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:30,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007837716] [2024-10-11 01:52:30,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007837716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:52:30,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:52:30,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:52:30,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069619188] [2024-10-11 01:52:30,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:52:30,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:52:30,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:52:30,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:52:30,051 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:52:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:30,125 INFO L93 Difference]: Finished difference Result 45 states and 70 transitions. [2024-10-11 01:52:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:52:30,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 01:52:30,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:30,132 INFO L225 Difference]: With dead ends: 45 [2024-10-11 01:52:30,133 INFO L226 Difference]: Without dead ends: 24 [2024-10-11 01:52:30,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 01:52:30,138 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:30,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 69 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:52:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-11 01:52:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-11 01:52:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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 01:52:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-11 01:52:30,172 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 6 [2024-10-11 01:52:30,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:30,173 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-11 01:52:30,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:52:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-11 01:52:30,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 01:52:30,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:30,174 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:30,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:52:30,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:30,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash 675454336, now seen corresponding path program 1 times [2024-10-11 01:52:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:30,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400212664] [2024-10-11 01:52:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:30,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:52:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:52:30,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:30,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400212664] [2024-10-11 01:52:30,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400212664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:52:30,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:52:30,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:52:30,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186330638] [2024-10-11 01:52:30,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:52:30,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:52:30,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:30,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:52:30,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:52:30,319 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:52:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:30,377 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-10-11 01:52:30,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:52:30,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 01:52:30,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:30,379 INFO L225 Difference]: With dead ends: 30 [2024-10-11 01:52:30,380 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 01:52:30,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 01:52:30,382 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:30,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:52:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 01:52:30,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 01:52:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 01:52:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-11 01:52:30,395 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2024-10-11 01:52:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:30,396 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-11 01:52:30,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:52:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-11 01:52:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 01:52:30,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:30,397 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:30,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:52:30,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:30,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash 715879520, now seen corresponding path program 1 times [2024-10-11 01:52:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6078353] [2024-10-11 01:52:30,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:52:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:52:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:52:30,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:30,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6078353] [2024-10-11 01:52:30,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6078353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:52:30,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:52:30,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:52:30,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913148087] [2024-10-11 01:52:30,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:52:30,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:52:30,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:30,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:52:30,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:52:30,501 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 01:52:30,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:30,524 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2024-10-11 01:52:30,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:52:30,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 20 [2024-10-11 01:52:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:30,527 INFO L225 Difference]: With dead ends: 66 [2024-10-11 01:52:30,528 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 01:52:30,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:52:30,529 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:30,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:52:30,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 01:52:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 01:52:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 01:52:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-10-11 01:52:30,541 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 20 [2024-10-11 01:52:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:30,542 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-10-11 01:52:30,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 01:52:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-10-11 01:52:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 01:52:30,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:30,543 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:30,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:52:30,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:30,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1791028434, now seen corresponding path program 1 times [2024-10-11 01:52:30,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:30,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020848373] [2024-10-11 01:52:30,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:30,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:52:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:52:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:52:30,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:30,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020848373] [2024-10-11 01:52:30,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020848373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:52:30,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:52:30,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:52:30,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533466707] [2024-10-11 01:52:30,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:52:30,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:52:30,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:30,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:52:30,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:52:30,636 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 01:52:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:30,653 INFO L93 Difference]: Finished difference Result 97 states and 137 transitions. [2024-10-11 01:52:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:52:30,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 20 [2024-10-11 01:52:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:30,655 INFO L225 Difference]: With dead ends: 97 [2024-10-11 01:52:30,655 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 01:52:30,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:52:30,657 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:30,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:52:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 01:52:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-11 01:52:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 01:52:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2024-10-11 01:52:30,680 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 20 [2024-10-11 01:52:30,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:30,680 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2024-10-11 01:52:30,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 01:52:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2024-10-11 01:52:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 01:52:30,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:30,682 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:30,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:52:30,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:30,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1325115391, now seen corresponding path program 1 times [2024-10-11 01:52:30,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:30,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253737507] [2024-10-11 01:52:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:52:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:52:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 01:52:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 01:52:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 01:52:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253737507] [2024-10-11 01:52:30,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253737507] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:52:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136333237] [2024-10-11 01:52:30,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:30,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:52:30,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:52:30,807 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 01:52:30,820 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 01:52:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:30,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 01:52:30,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:52:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 01:52:30,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:52:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 01:52:31,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136333237] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:52:31,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:52:31,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-11 01:52:31,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526647463] [2024-10-11 01:52:31,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:52:31,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:52:31,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:31,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:52:31,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:52:31,035 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-11 01:52:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:31,138 INFO L93 Difference]: Finished difference Result 177 states and 269 transitions. [2024-10-11 01:52:31,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:52:31,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 35 [2024-10-11 01:52:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:31,141 INFO L225 Difference]: With dead ends: 177 [2024-10-11 01:52:31,141 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 01:52:31,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:52:31,144 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 49 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:31,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 93 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:52:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 01:52:31,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-11 01:52:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 01:52:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2024-10-11 01:52:31,174 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 35 [2024-10-11 01:52:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:31,175 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2024-10-11 01:52:31,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-11 01:52:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2024-10-11 01:52:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 01:52:31,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:31,176 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 01:52:31,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 01:52:31,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:52:31,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:31,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1704439485, now seen corresponding path program 1 times [2024-10-11 01:52:31,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:31,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144528026] [2024-10-11 01:52:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:31,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:31,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:52:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:52:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 01:52:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:31,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 01:52:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 01:52:31,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:31,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144528026] [2024-10-11 01:52:31,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144528026] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:52:31,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353583996] [2024-10-11 01:52:31,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:31,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:52:31,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:52:31,457 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 01:52:31,459 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 01:52:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:31,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 01:52:31,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:52:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 01:52:31,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:52:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 01:52:31,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353583996] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:52:31,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:52:31,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-11 01:52:31,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482818817] [2024-10-11 01:52:31,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:52:31,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:52:31,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:31,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:52:31,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:52:31,616 INFO L87 Difference]: Start difference. First operand 119 states and 180 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-11 01:52:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:31,686 INFO L93 Difference]: Finished difference Result 378 states and 596 transitions. [2024-10-11 01:52:31,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:52:31,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 35 [2024-10-11 01:52:31,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:31,689 INFO L225 Difference]: With dead ends: 378 [2024-10-11 01:52:31,691 INFO L226 Difference]: Without dead ends: 260 [2024-10-11 01:52:31,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:52:31,695 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:31,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 104 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:52:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-11 01:52:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-10-11 01:52:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 196 states have (on average 1.4387755102040816) internal successors, (282), 196 states have internal predecessors, (282), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 01:52:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 402 transitions. [2024-10-11 01:52:31,745 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 402 transitions. Word has length 35 [2024-10-11 01:52:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:31,747 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 402 transitions. [2024-10-11 01:52:31,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-11 01:52:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 402 transitions. [2024-10-11 01:52:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 01:52:31,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:31,752 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2024-10-11 01:52:31,768 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 01:52:31,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:52:31,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:31,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:31,957 INFO L85 PathProgramCache]: Analyzing trace with hash -563554144, now seen corresponding path program 2 times [2024-10-11 01:52:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:31,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697829630] [2024-10-11 01:52:31,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:31,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:52:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:52:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 01:52:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 01:52:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 01:52:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 01:52:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 01:52:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 01:52:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 01:52:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 01:52:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-11 01:52:32,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:32,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697829630] [2024-10-11 01:52:32,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697829630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:52:32,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:52:32,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:52:32,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983045669] [2024-10-11 01:52:32,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:52:32,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:52:32,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:32,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:52:32,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:52:32,197 INFO L87 Difference]: Start difference. First operand 260 states and 402 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 01:52:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:32,254 INFO L93 Difference]: Finished difference Result 266 states and 407 transitions. [2024-10-11 01:52:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:52:32,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 80 [2024-10-11 01:52:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:32,257 INFO L225 Difference]: With dead ends: 266 [2024-10-11 01:52:32,257 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 01:52:32,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:52:32,259 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:32,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 77 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:52:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 01:52:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-10-11 01:52:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 199 states have (on average 1.4321608040201006) internal successors, (285), 199 states have internal predecessors, (285), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 01:52:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 405 transitions. [2024-10-11 01:52:32,311 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 405 transitions. Word has length 80 [2024-10-11 01:52:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:32,312 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 405 transitions. [2024-10-11 01:52:32,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 01:52:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 405 transitions. [2024-10-11 01:52:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 01:52:32,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:52:32,315 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2024-10-11 01:52:32,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 01:52:32,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:52:32,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:52:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1289698158, now seen corresponding path program 2 times [2024-10-11 01:52:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:52:32,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445572009] [2024-10-11 01:52:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:52:32,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:52:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:52:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:52:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 01:52:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 01:52:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 01:52:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 01:52:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 01:52:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 01:52:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 01:52:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 01:52:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:52:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-11 01:52:32,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:52:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445572009] [2024-10-11 01:52:32,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445572009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:52:32,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:52:32,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:52:32,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039827696] [2024-10-11 01:52:32,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:52:32,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:52:32,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:52:32,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:52:32,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:52:32,525 INFO L87 Difference]: Start difference. First operand 264 states and 405 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 01:52:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:52:32,584 INFO L93 Difference]: Finished difference Result 264 states and 405 transitions. [2024-10-11 01:52:32,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:52:32,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 80 [2024-10-11 01:52:32,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:52:32,586 INFO L225 Difference]: With dead ends: 264 [2024-10-11 01:52:32,586 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 01:52:32,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:52:32,588 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:52:32,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 77 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:52:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 01:52:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 01:52:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:52:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 01:52:32,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2024-10-11 01:52:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:52:32,591 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 01:52:32,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 01:52:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 01:52:32,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 01:52:32,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 01:52:32,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 01:52:32,597 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2024-10-11 01:52:32,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 01:52:33,019 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 01:52:33,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:52:33 BoogieIcfgContainer [2024-10-11 01:52:33,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 01:52:33,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 01:52:33,036 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 01:52:33,036 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 01:52:33,036 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:52:29" (3/4) ... [2024-10-11 01:52:33,038 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 01:52:33,041 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 01:52:33,045 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-11 01:52:33,046 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 01:52:33,046 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 01:52:33,046 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 01:52:33,126 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 01:52:33,126 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 01:52:33,127 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 01:52:33,127 INFO L158 Benchmark]: Toolchain (without parser) took 4117.83ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 109.0MB in the beginning and 182.8MB in the end (delta: -73.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:52:33,127 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:52:33,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.06ms. Allocated memory is still 176.2MB. Free memory was 108.8MB in the beginning and 96.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 01:52:33,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.23ms. Allocated memory is still 176.2MB. Free memory was 96.6MB in the beginning and 148.5MB in the end (delta: -51.9MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-11 01:52:33,128 INFO L158 Benchmark]: Boogie Preprocessor took 46.59ms. Allocated memory is still 176.2MB. Free memory was 148.5MB in the beginning and 146.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:52:33,129 INFO L158 Benchmark]: RCFGBuilder took 249.86ms. Allocated memory is still 176.2MB. Free memory was 146.8MB in the beginning and 135.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 01:52:33,129 INFO L158 Benchmark]: TraceAbstraction took 3435.01ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 135.1MB in the beginning and 188.1MB in the end (delta: -53.0MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2024-10-11 01:52:33,129 INFO L158 Benchmark]: Witness Printer took 91.03ms. Allocated memory is still 232.8MB. Free memory was 188.1MB in the beginning and 182.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 01:52:33,130 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.16ms. Allocated memory is still 176.2MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.06ms. Allocated memory is still 176.2MB. Free memory was 108.8MB in the beginning and 96.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.23ms. Allocated memory is still 176.2MB. Free memory was 96.6MB in the beginning and 148.5MB in the end (delta: -51.9MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.59ms. Allocated memory is still 176.2MB. Free memory was 148.5MB in the beginning and 146.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 249.86ms. Allocated memory is still 176.2MB. Free memory was 146.8MB in the beginning and 135.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3435.01ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 135.1MB in the beginning and 188.1MB in the end (delta: -53.0MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. * Witness Printer took 91.03ms. Allocated memory is still 232.8MB. Free memory was 188.1MB in the beginning and 182.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 596 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 402 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 194 mSDtfsCounter, 155 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 162 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 750/792 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((m <= 60) && (n <= 60)) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 01:52:33,159 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 Result: TRUE