./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bfe5681b6d73d5859a119345279b9da165675f4eb4d814fdf24f92881f7a27f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:30:15,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:30:15,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:30:15,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:30:15,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:30:15,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:30:15,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:30:15,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:30:15,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:30:15,233 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:30:15,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:30:15,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:30:15,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:30:15,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:30:15,245 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:30:15,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:30:15,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:30:15,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:30:15,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:30:15,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:30:15,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:30:15,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:30:15,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:30:15,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:30:15,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:30:15,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:30:15,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:30:15,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:30:15,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:30:15,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:30:15,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:30:15,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:30:15,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:30:15,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:30:15,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:30:15,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:30:15,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:30:15,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:30:15,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:30:15,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:30:15,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:30:15,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:30:15,257 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bfe5681b6d73d5859a119345279b9da165675f4eb4d814fdf24f92881f7a27f [2024-10-24 00:30:15,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:30:15,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:30:15,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:30:15,528 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:30:15,529 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:30:15,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c [2024-10-24 00:30:16,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:30:17,113 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:30:17,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c [2024-10-24 00:30:17,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a211e943/f7ffe7e97f9a4199a0eb063eabf84cbd/FLAG229b3961a [2024-10-24 00:30:17,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a211e943/f7ffe7e97f9a4199a0eb063eabf84cbd [2024-10-24 00:30:17,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:30:17,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:30:17,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:30:17,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:30:17,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:30:17,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a8cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17, skipping insertion in model container [2024-10-24 00:30:17,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:30:17,696 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c[458,471] [2024-10-24 00:30:17,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:30:17,719 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:30:17,728 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c[458,471] [2024-10-24 00:30:17,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:30:17,747 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:30:17,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17 WrapperNode [2024-10-24 00:30:17,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:30:17,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:30:17,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:30:17,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:30:17,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,775 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2024-10-24 00:30:17,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:30:17,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:30:17,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:30:17,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:30:17,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,795 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 00:30:17,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:30:17,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:30:17,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:30:17,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:30:17,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (1/1) ... [2024-10-24 00:30:17,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:30:17,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:30:17,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 00:30:17,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 00:30:17,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:30:17,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:30:17,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:30:17,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:30:17,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 00:30:17,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 00:30:17,961 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:30:17,963 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:30:18,077 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-24 00:30:18,077 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:30:18,113 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:30:18,114 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:30:18,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:30:18 BoogieIcfgContainer [2024-10-24 00:30:18,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:30:18,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:30:18,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:30:18,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:30:18,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:30:17" (1/3) ... [2024-10-24 00:30:18,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3936d6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:30:18, skipping insertion in model container [2024-10-24 00:30:18,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:30:17" (2/3) ... [2024-10-24 00:30:18,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3936d6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:30:18, skipping insertion in model container [2024-10-24 00:30:18,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:30:18" (3/3) ... [2024-10-24 00:30:18,126 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound50.c [2024-10-24 00:30:18,141 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:30:18,141 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:30:18,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:30:18,205 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;@788101cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:30:18,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:30:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 00:30:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 00:30:18,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:30:18,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:30:18,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:30:18,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:30:18,222 INFO L85 PathProgramCache]: Analyzing trace with hash 793793432, now seen corresponding path program 1 times [2024-10-24 00:30:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:30:18,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654335010] [2024-10-24 00:30:18,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:18,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:30:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:18,360 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-24 00:30:18,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:30:18,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654335010] [2024-10-24 00:30:18,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654335010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:30:18,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:30:18,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 00:30:18,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122817197] [2024-10-24 00:30:18,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:30:18,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:30:18,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:30:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:30:18,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 00:30:18,386 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-24 00:30:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:30:18,404 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2024-10-24 00:30:18,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:30:18,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2024-10-24 00:30:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:30:18,413 INFO L225 Difference]: With dead ends: 32 [2024-10-24 00:30:18,413 INFO L226 Difference]: Without dead ends: 15 [2024-10-24 00:30:18,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 00:30:18,420 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:30:18,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:30:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-24 00:30:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-24 00:30:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 00:30:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-10-24 00:30:18,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 8 [2024-10-24 00:30:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:30:18,445 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-10-24 00:30:18,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-24 00:30:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-10-24 00:30:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 00:30:18,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:30:18,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:30:18,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 00:30:18,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:30:18,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:30:18,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1922989550, now seen corresponding path program 1 times [2024-10-24 00:30:18,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:30:18,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2395088] [2024-10-24 00:30:18,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:18,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:30:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:18,559 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-24 00:30:18,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:30:18,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2395088] [2024-10-24 00:30:18,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2395088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:30:18,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:30:18,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 00:30:18,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454013139] [2024-10-24 00:30:18,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:30:18,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 00:30:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:30:18,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 00:30:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 00:30:18,563 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-24 00:30:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:30:18,579 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-10-24 00:30:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 00:30:18,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-10-24 00:30:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:30:18,580 INFO L225 Difference]: With dead ends: 25 [2024-10-24 00:30:18,580 INFO L226 Difference]: Without dead ends: 17 [2024-10-24 00:30:18,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 00:30:18,582 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:30:18,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:30:18,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-24 00:30:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-24 00:30:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 00:30:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-10-24 00:30:18,587 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2024-10-24 00:30:18,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:30:18,587 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-24 00:30:18,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-24 00:30:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-10-24 00:30:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 00:30:18,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:30:18,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:30:18,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 00:30:18,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:30:18,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:30:18,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1924777010, now seen corresponding path program 1 times [2024-10-24 00:30:18,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:30:18,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026401251] [2024-10-24 00:30:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:18,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:30:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:30:18,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1603636660] [2024-10-24 00:30:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:18,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:30:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:30:18,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:30:18,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 00:30:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:18,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 00:30:18,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:30:18,787 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-24 00:30:18,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:30:18,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:30:18,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026401251] [2024-10-24 00:30:18,788 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:30:18,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603636660] [2024-10-24 00:30:18,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603636660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:30:18,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:30:18,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 00:30:18,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917768663] [2024-10-24 00:30:18,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:30:18,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:30:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:30:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:30:18,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 00:30:18,792 INFO L87 Difference]: Start difference. First operand 17 states and 20 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, (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-24 00:30:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:30:18,862 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-10-24 00:30:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:30:18,863 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, (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 9 [2024-10-24 00:30:18,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:30:18,864 INFO L225 Difference]: With dead ends: 27 [2024-10-24 00:30:18,864 INFO L226 Difference]: Without dead ends: 23 [2024-10-24 00:30:18,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:30:18,865 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:30:18,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:30:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-24 00:30:18,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-24 00:30:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 00:30:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-10-24 00:30:18,876 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 9 [2024-10-24 00:30:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:30:18,877 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-10-24 00:30:18,877 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, (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-24 00:30:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-10-24 00:30:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 00:30:18,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:30:18,879 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:30:18,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 00:30:19,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:30:19,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:30:19,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:30:19,085 INFO L85 PathProgramCache]: Analyzing trace with hash 76913492, now seen corresponding path program 1 times [2024-10-24 00:30:19,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:30:19,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782888708] [2024-10-24 00:30:19,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:19,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:30:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:19,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:30:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 00:30:19,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:30:19,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782888708] [2024-10-24 00:30:19,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782888708] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:30:19,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908020562] [2024-10-24 00:30:19,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:19,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:30:19,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:30:19,270 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:30:19,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 00:30:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:19,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 00:30:19,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:30:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 00:30:19,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:30:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 00:30:19,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908020562] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:30:19,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:30:19,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-10-24 00:30:19,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78165] [2024-10-24 00:30:19,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:30:19,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 00:30:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:30:19,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 00:30:19,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:30:19,448 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 00:30:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:30:19,537 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-10-24 00:30:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 00:30:19,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2024-10-24 00:30:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:30:19,539 INFO L225 Difference]: With dead ends: 57 [2024-10-24 00:30:19,540 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 00:30:19,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:30:19,542 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:30:19,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 75 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:30:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 00:30:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-10-24 00:30:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 00:30:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-10-24 00:30:19,558 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 17 [2024-10-24 00:30:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:30:19,558 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-10-24 00:30:19,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 00:30:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-10-24 00:30:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 00:30:19,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:30:19,559 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:30:19,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 00:30:19,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-24 00:30:19,760 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:30:19,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:30:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash 78700952, now seen corresponding path program 1 times [2024-10-24 00:30:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:30:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876154427] [2024-10-24 00:30:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:30:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:30:19,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352866247] [2024-10-24 00:30:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:19,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:30:19,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:30:19,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:30:19,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 00:30:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:19,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 00:30:19,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:30:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 00:30:19,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:30:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 00:30:20,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:30:20,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876154427] [2024-10-24 00:30:20,024 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:30:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352866247] [2024-10-24 00:30:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352866247] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 00:30:20,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:30:20,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-24 00:30:20,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438272150] [2024-10-24 00:30:20,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:30:20,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:30:20,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:30:20,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:30:20,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:30:20,030 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-24 00:30:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:30:20,087 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-10-24 00:30:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:30:20,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2024-10-24 00:30:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:30:20,089 INFO L225 Difference]: With dead ends: 59 [2024-10-24 00:30:20,091 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 00:30:20,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:30:20,092 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:30:20,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 40 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:30:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 00:30:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-10-24 00:30:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 00:30:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-10-24 00:30:20,112 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 17 [2024-10-24 00:30:20,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:30:20,113 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-24 00:30:20,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-24 00:30:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-10-24 00:30:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 00:30:20,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:30:20,115 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:30:20,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 00:30:20,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:30:20,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:30:20,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:30:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash 731759343, now seen corresponding path program 1 times [2024-10-24 00:30:20,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:30:20,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666267355] [2024-10-24 00:30:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:20,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:30:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:30:20,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1994101910] [2024-10-24 00:30:20,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:20,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:30:20,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:30:20,353 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:30:20,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 00:30:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:20,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 00:30:20,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:30:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 00:30:20,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:30:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 00:30:20,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:30:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666267355] [2024-10-24 00:30:20,642 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:30:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994101910] [2024-10-24 00:30:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994101910] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:30:20,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 00:30:20,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-24 00:30:20,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087562961] [2024-10-24 00:30:20,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 00:30:20,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 00:30:20,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:30:20,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 00:30:20,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:30:20,645 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 00:30:20,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:30:20,787 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-10-24 00:30:20,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 00:30:20,788 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2024-10-24 00:30:20,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:30:20,790 INFO L225 Difference]: With dead ends: 54 [2024-10-24 00:30:20,790 INFO L226 Difference]: Without dead ends: 45 [2024-10-24 00:30:20,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:30:20,792 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:30:20,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:30:20,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-24 00:30:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-24 00:30:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 00:30:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-10-24 00:30:20,809 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 28 [2024-10-24 00:30:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:30:20,809 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-10-24 00:30:20,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 00:30:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-10-24 00:30:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 00:30:20,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:30:20,811 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:30:20,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:30:21,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:30:21,012 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:30:21,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:30:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1074423298, now seen corresponding path program 1 times [2024-10-24 00:30:21,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:30:21,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191195186] [2024-10-24 00:30:21,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:30:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:21,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 00:30:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:21,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 00:30:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:21,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:30:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:21,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 00:30:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 00:30:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 00:30:21,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:30:21,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191195186] [2024-10-24 00:30:21,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191195186] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:30:21,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860297180] [2024-10-24 00:30:21,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:21,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:30:21,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:30:21,274 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:30:21,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 00:30:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:30:21,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 00:30:21,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:30:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 00:30:21,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:30:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 00:30:21,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860297180] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:30:21,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:30:21,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-10-24 00:30:21,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585369982] [2024-10-24 00:30:21,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:30:21,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 00:30:21,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:30:21,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 00:30:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-10-24 00:30:21,530 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 9 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-10-24 00:30:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:30:21,767 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2024-10-24 00:30:21,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 00:30:21,767 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 9 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) Word has length 46 [2024-10-24 00:30:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:30:21,769 INFO L225 Difference]: With dead ends: 131 [2024-10-24 00:30:21,769 INFO L226 Difference]: Without dead ends: 121 [2024-10-24 00:30:21,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-10-24 00:30:21,770 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 71 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:30:21,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 111 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:30:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-24 00:30:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2024-10-24 00:30:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 73 states have internal predecessors, (75), 17 states have call successors, (17), 11 states have call predecessors, (17), 10 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 00:30:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2024-10-24 00:30:21,814 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 46 [2024-10-24 00:30:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:30:21,815 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2024-10-24 00:30:21,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 9 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-10-24 00:30:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2024-10-24 00:30:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 00:30:21,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:30:21,816 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:30:21,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 00:30:22,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:30:22,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:30:22,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:30:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1441866883, now seen corresponding path program 2 times [2024-10-24 00:30:22,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:30:22,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909033586] [2024-10-24 00:30:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:30:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:30:22,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [547719218] [2024-10-24 00:30:22,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 00:30:22,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:30:22,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:30:22,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:30:22,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 00:30:22,118 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 00:30:22,118 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 00:30:22,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-24 00:30:22,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:30:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 26 proven. 41 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 00:30:22,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:30:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 26 proven. 41 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 00:30:23,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:30:23,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909033586] [2024-10-24 00:30:23,369 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 00:30:23,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547719218] [2024-10-24 00:30:23,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547719218] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:30:23,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 00:30:23,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2024-10-24 00:30:23,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413234411] [2024-10-24 00:30:23,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 00:30:23,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 00:30:23,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:30:23,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 00:30:23,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-10-24 00:30:23,374 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 24 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 00:30:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:30:24,148 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2024-10-24 00:30:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 00:30:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 52 [2024-10-24 00:30:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:30:24,150 INFO L225 Difference]: With dead ends: 102 [2024-10-24 00:30:24,152 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 00:30:24,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 00:30:24,154 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:30:24,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 296 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 00:30:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 00:30:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-24 00:30:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 00:30:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2024-10-24 00:30:24,180 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 52 [2024-10-24 00:30:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:30:24,181 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2024-10-24 00:30:24,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 14 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 00:30:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2024-10-24 00:30:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 00:30:24,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:30:24,186 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:30:24,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 00:30:24,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:30:24,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:30:24,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:30:24,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1566715457, now seen corresponding path program 3 times [2024-10-24 00:30:24,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:30:24,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995906483] [2024-10-24 00:30:24,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:30:24,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:30:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 00:30:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [308295842] [2024-10-24 00:30:24,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 00:30:24,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:30:24,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:30:24,432 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:30:24,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 00:30:24,545 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-10-24 00:30:24,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 00:30:24,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-24 00:30:24,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:30:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 27 proven. 205 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 00:30:24,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:30:33,278 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 7)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 7) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2024-10-24 00:30:41,318 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 00:30:53,333 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 00:31:09,353 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 00:31:13,369 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_32| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45|))) (or (= 0 (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 10) .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 7)) 12)) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 7) .cse0) (+ (* 7 |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_32|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_32|))))))) is different from true [2024-10-24 00:31:29,399 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 00:31:46,501 WARN L286 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 00:31:50,819 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_32| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45|))) (or (= 0 (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 10) .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 7)) 12)) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 7) .cse0) (+ (* 7 |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_32|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_32|)))))) (= c___VERIFIER_assert_~cond 0)) is different from true