./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/ps6-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/ps6-ll.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 07abfb6a25bc8999c03b9e73c88de3af15c2169770f93c7bfb47efae6a8a30d3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:11:47,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:11:47,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:11:47,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:11:47,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:11:47,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:11:47,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:11:47,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:11:47,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:11:47,662 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:11:47,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:11:47,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:11:47,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:11:47,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:11:47,664 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:11:47,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:11:47,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:11:47,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:11:47,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:11:47,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:11:47,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:11:47,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:11:47,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:11:47,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:11:47,667 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:11:47,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:11:47,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:11:47,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:11:47,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:11:47,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:11:47,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:11:47,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:11:47,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:11:47,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:11:47,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:11:47,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:11:47,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:11:47,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:11:47,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:11:47,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:11:47,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:11:47,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:11:47,673 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 -> 07abfb6a25bc8999c03b9e73c88de3af15c2169770f93c7bfb47efae6a8a30d3 [2024-10-14 02:11:47,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:11:47,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:11:47,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:11:47,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:11:47,935 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:11:47,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/ps6-ll.c [2024-10-14 02:11:49,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:11:49,592 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:11:49,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/ps6-ll.c [2024-10-14 02:11:49,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/323d37867/b7a720133bb84ef8aad0c1862e6fc50d/FLAG5d55983db [2024-10-14 02:11:49,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/323d37867/b7a720133bb84ef8aad0c1862e6fc50d [2024-10-14 02:11:49,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:11:49,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:11:49,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:11:49,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:11:49,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:11:49,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e94813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49, skipping insertion in model container [2024-10-14 02:11:49,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:11:49,806 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/ps6-ll.c[458,471] [2024-10-14 02:11:49,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:11:49,838 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:11:49,851 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/ps6-ll.c[458,471] [2024-10-14 02:11:49,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:11:49,878 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:11:49,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49 WrapperNode [2024-10-14 02:11:49,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:11:49,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:11:49,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:11:49,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:11:49,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,907 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2024-10-14 02:11:49,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:11:49,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:11:49,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:11:49,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:11:49,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,930 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-14 02:11:49,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:11:49,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:11:49,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:11:49,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:11:49,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (1/1) ... [2024-10-14 02:11:49,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:11:49,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:11:49,975 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-14 02:11:49,978 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-14 02:11:50,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:11:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:11:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:11:50,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:11:50,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 02:11:50,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 02:11:50,093 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:11:50,095 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:11:50,251 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-14 02:11:50,252 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:11:50,282 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:11:50,283 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:11:50,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:11:50 BoogieIcfgContainer [2024-10-14 02:11:50,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:11:50,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:11:50,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:11:50,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:11:50,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:11:49" (1/3) ... [2024-10-14 02:11:50,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5151f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:11:50, skipping insertion in model container [2024-10-14 02:11:50,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:49" (2/3) ... [2024-10-14 02:11:50,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5151f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:11:50, skipping insertion in model container [2024-10-14 02:11:50,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:11:50" (3/3) ... [2024-10-14 02:11:50,295 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll.c [2024-10-14 02:11:50,315 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:11:50,315 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:11:50,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:11:50,391 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;@304c78d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:11:50,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:11:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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-14 02:11:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 02:11:50,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:11:50,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:11:50,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:11:50,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:11:50,408 INFO L85 PathProgramCache]: Analyzing trace with hash -959206418, now seen corresponding path program 1 times [2024-10-14 02:11:50,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:11:50,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078286955] [2024-10-14 02:11:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:11:50,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:11:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:11:50,545 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-14 02:11:50,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:11:50,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078286955] [2024-10-14 02:11:50,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078286955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:11:50,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:11:50,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 02:11:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923422852] [2024-10-14 02:11:50,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:11:50,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 02:11:50,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:11:50,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 02:11:50,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 02:11:50,577 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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-14 02:11:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:11:50,602 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2024-10-14 02:11:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 02:11:50,604 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-14 02:11:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:11:50,609 INFO L225 Difference]: With dead ends: 30 [2024-10-14 02:11:50,610 INFO L226 Difference]: Without dead ends: 14 [2024-10-14 02:11:50,612 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-14 02:11:50,615 INFO L432 NwaCegarLoop]: 16 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, 16 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-14 02:11:50,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:11:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-14 02:11:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-14 02:11:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-14 02:11:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-10-14 02:11:50,652 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2024-10-14 02:11:50,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:11:50,652 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-10-14 02:11:50,652 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-14 02:11:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-10-14 02:11:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 02:11:50,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:11:50,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:11:50,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:11:50,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:11:50,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:11:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash 817588404, now seen corresponding path program 1 times [2024-10-14 02:11:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:11:50,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919761823] [2024-10-14 02:11:50,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:11:50,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:11:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:11:50,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126401086] [2024-10-14 02:11:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:11:50,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:11:50,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:11:50,693 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-14 02:11:50,695 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-14 02:11:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:11:50,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 02:11:50,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:11:50,850 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-14 02:11:50,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:11:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:11:50,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919761823] [2024-10-14 02:11:50,851 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:11:50,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126401086] [2024-10-14 02:11:50,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126401086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:11:50,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:11:50,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:11:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689680995] [2024-10-14 02:11:50,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:11:50,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:11:50,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:11:50,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:11:50,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:11:50,855 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-14 02:11:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:11:50,923 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-10-14 02:11:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:11:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-14 02:11:50,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:11:50,924 INFO L225 Difference]: With dead ends: 25 [2024-10-14 02:11:50,924 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 02:11:50,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-14 02:11:50,926 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 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-14 02:11:50,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:11:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 02:11:50,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-14 02:11:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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-14 02:11:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-10-14 02:11:50,940 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 8 [2024-10-14 02:11:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:11:50,941 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-10-14 02:11:50,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-14 02:11:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-10-14 02:11:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 02:11:50,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:11:50,942 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:11:50,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 02:11:51,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:11:51,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:11:51,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:11:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1282095925, now seen corresponding path program 1 times [2024-10-14 02:11:51,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:11:51,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240294953] [2024-10-14 02:11:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:11:51,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:11:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:11:51,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421246015] [2024-10-14 02:11:51,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:11:51,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:11:51,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:11:51,185 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-14 02:11:51,186 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-14 02:11:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:11:51,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 02:11:51,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:11:51,316 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-14 02:11:51,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:11:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:11:51,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:11:51,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240294953] [2024-10-14 02:11:51,409 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:11:51,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421246015] [2024-10-14 02:11:51,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421246015] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 02:11:51,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:11:51,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-14 02:11:51,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367296476] [2024-10-14 02:11:51,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:11:51,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:11:51,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:11:51,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:11:51,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:11:51,416 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-14 02:11:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:11:51,475 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-10-14 02:11:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:11:51,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2024-10-14 02:11:51,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:11:51,477 INFO L225 Difference]: With dead ends: 27 [2024-10-14 02:11:51,477 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 02:11:51,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 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-14 02:11:51,479 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 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-14 02:11:51,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:11:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 02:11:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-14 02:11:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 3 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-14 02:11:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-10-14 02:11:51,492 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2024-10-14 02:11:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:11:51,492 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-10-14 02:11:51,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-14 02:11:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-10-14 02:11:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 02:11:51,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:11:51,496 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:11:51,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 02:11:51,697 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,SelfDestructingSolverStorable2 [2024-10-14 02:11:51,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:11:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:11:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1293644165, now seen corresponding path program 1 times [2024-10-14 02:11:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:11:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029148334] [2024-10-14 02:11:51,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:11:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:11:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:11:51,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395094071] [2024-10-14 02:11:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:11:51,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:11:51,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:11:51,766 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-14 02:11:51,773 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-14 02:11:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:11:51,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 02:11:51,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:11:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 02:11:52,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:11:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 02:11:52,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:11:52,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029148334] [2024-10-14 02:11:52,883 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:11:52,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395094071] [2024-10-14 02:11:52,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395094071] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:11:52,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 02:11:52,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-10-14 02:11:52,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665744448] [2024-10-14 02:11:52,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 02:11:52,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 02:11:52,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:11:52,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 02:11:52,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-14 02:11:52,885 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 02:11:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:11:53,137 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-10-14 02:11:53,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 02:11:53,137 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2024-10-14 02:11:53,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:11:53,138 INFO L225 Difference]: With dead ends: 44 [2024-10-14 02:11:53,138 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 02:11:53,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:11:53,140 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:11:53,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 53 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:11:53,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 02:11:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-14 02:11:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 02:11:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-10-14 02:11:53,178 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 26 [2024-10-14 02:11:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:11:53,179 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-10-14 02:11:53,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 02:11:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-10-14 02:11:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 02:11:53,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:11:53,180 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:11:53,199 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-14 02:11:53,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:11:53,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:11:53,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:11:53,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1936035506, now seen corresponding path program 2 times [2024-10-14 02:11:53,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:11:53,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98598568] [2024-10-14 02:11:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:11:53,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:11:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:11:53,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934444884] [2024-10-14 02:11:53,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 02:11:53,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:11:53,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:11:53,464 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-14 02:11:53,465 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-14 02:11:53,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 02:11:53,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:11:53,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 02:11:53,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:11:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 02:11:53,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:11:54,164 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 02:11:54,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:11:54,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98598568] [2024-10-14 02:11:54,165 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:11:54,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934444884] [2024-10-14 02:11:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934444884] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:11:54,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 02:11:54,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2024-10-14 02:11:54,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359129925] [2024-10-14 02:11:54,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 02:11:54,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 02:11:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:11:54,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 02:11:54,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-10-14 02:11:54,171 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 02:11:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:11:54,677 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-10-14 02:11:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 02:11:54,677 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 47 [2024-10-14 02:11:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:11:54,679 INFO L225 Difference]: With dead ends: 59 [2024-10-14 02:11:54,679 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 02:11:54,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2024-10-14 02:11:54,680 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:11:54,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 213 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 02:11:54,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 02:11:54,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-14 02:11:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 02:11:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-10-14 02:11:54,723 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 47 [2024-10-14 02:11:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:11:54,724 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-10-14 02:11:54,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 02:11:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-10-14 02:11:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 02:11:54,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:11:54,726 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:11:54,746 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-14 02:11:54,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:11:54,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:11:54,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:11:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash -118276357, now seen corresponding path program 3 times [2024-10-14 02:11:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:11:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067684324] [2024-10-14 02:11:54,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:11:54,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:11:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:11:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954741804] [2024-10-14 02:11:54,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 02:11:54,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:11:54,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:11:55,000 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-14 02:11:55,001 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-14 02:11:55,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-10-14 02:11:55,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:11:55,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-14 02:11:55,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:11:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 30 proven. 157 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-14 02:11:55,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:12:03,834 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| 6) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 6))) (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-14 02:12:11,906 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-14 02:12:19,914 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-14 02:12:39,978 WARN L286 SmtUtils]: Spent 8.02s 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-14 02:12:43,986 WARN L873 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44|))) (or (= 0 (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 7) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 6) .cse0) 12)) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31| 6)) (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 6)))))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2024-10-14 02:13:00,034 WARN L286 SmtUtils]: Spent 8.03s 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-14 02:13:16,068 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-14 02:13:20,221 WARN L873 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44|))) (or (= 0 (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 7) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 6) .cse0) 12)) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31| 6)) (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 6)))))) (not (= |c___VERIFIER_assert_#in~cond| 0)) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-10-14 02:13:32,284 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