./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/ps4-ll_unwindbound10.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-scaling/ps4-ll_unwindbound10.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 34fd2c5bce28a2f0a39de6b9c2d306403d911c32b4998862fc7a657ddcb319f4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:37:06,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:37:06,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:37:06,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:37:06,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:37:06,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:37:06,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:37:06,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:37:06,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:37:06,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:37:06,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:37:06,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:37:06,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:37:06,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:37:06,801 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:37:06,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:37:06,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:37:06,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:37:06,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:37:06,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:37:06,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:37:06,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:37:06,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:37:06,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:37:06,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:37:06,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:37:06,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:37:06,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:37:06,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:37:06,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:37:06,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:37:06,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:37:06,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:37:06,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:37:06,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:37:06,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:37:06,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:37:06,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:37:06,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:37:06,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:37:06,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:37:06,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:37:06,810 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 -> 34fd2c5bce28a2f0a39de6b9c2d306403d911c32b4998862fc7a657ddcb319f4 [2024-10-14 02:37:07,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:37:07,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:37:07,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:37:07,093 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:37:07,094 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:37:07,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.c [2024-10-14 02:37:08,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:37:08,667 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:37:08,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound10.c [2024-10-14 02:37:08,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024b6a53d/cf162b366dbe4db99f12883327eac912/FLAG67e8d1aa6 [2024-10-14 02:37:08,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024b6a53d/cf162b366dbe4db99f12883327eac912 [2024-10-14 02:37:08,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:37:08,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:37:08,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:37:08,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:37:08,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:37:08,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:37:08" (1/1) ... [2024-10-14 02:37:08,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c1949f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08, skipping insertion in model container [2024-10-14 02:37:08,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:37:08" (1/1) ... [2024-10-14 02:37:08,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:37:08,876 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/ps4-ll_unwindbound10.c[458,471] [2024-10-14 02:37:08,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:37:08,917 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:37:08,930 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/ps4-ll_unwindbound10.c[458,471] [2024-10-14 02:37:08,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:37:08,963 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:37:08,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08 WrapperNode [2024-10-14 02:37:08,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:37:08,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:37:08,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:37:08,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:37:08,972 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:37:08" (1/1) ... [2024-10-14 02:37:08,979 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:37:08" (1/1) ... [2024-10-14 02:37:08,997 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2024-10-14 02:37:08,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:37:08,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:37:08,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:37:08,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:37:09,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08" (1/1) ... [2024-10-14 02:37:09,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08" (1/1) ... [2024-10-14 02:37:09,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08" (1/1) ... [2024-10-14 02:37:09,018 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:37:09,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08" (1/1) ... [2024-10-14 02:37:09,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08" (1/1) ... [2024-10-14 02:37:09,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08" (1/1) ... [2024-10-14 02:37:09,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08" (1/1) ... [2024-10-14 02:37:09,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08" (1/1) ... [2024-10-14 02:37:09,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08" (1/1) ... [2024-10-14 02:37:09,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:37:09,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:37:09,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:37:09,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:37:09,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08" (1/1) ... [2024-10-14 02:37:09,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:37:09,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:37:09,069 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:37:09,072 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:37:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:37:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:37:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:37:09,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:37:09,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 02:37:09,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 02:37:09,216 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:37:09,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:37:09,376 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-14 02:37:09,376 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:37:09,400 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:37:09,403 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:37:09,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:37:09 BoogieIcfgContainer [2024-10-14 02:37:09,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:37:09,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:37:09,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:37:09,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:37:09,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:37:08" (1/3) ... [2024-10-14 02:37:09,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f43169e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:37:09, skipping insertion in model container [2024-10-14 02:37:09,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:37:08" (2/3) ... [2024-10-14 02:37:09,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f43169e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:37:09, skipping insertion in model container [2024-10-14 02:37:09,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:37:09" (3/3) ... [2024-10-14 02:37:09,412 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound10.c [2024-10-14 02:37:09,428 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:37:09,429 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:37:09,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:37:09,504 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;@732af7b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:37:09,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:37:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 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:37:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 02:37:09,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:37:09,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 02:37:09,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:37:09,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:37:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2070802916, now seen corresponding path program 1 times [2024-10-14 02:37:09,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:37:09,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580075963] [2024-10-14 02:37:09,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:09,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:37:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:09,679 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:37:09,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:37:09,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580075963] [2024-10-14 02:37:09,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580075963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:37:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:37:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 02:37:09,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327201190] [2024-10-14 02:37:09,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:37:09,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 02:37:09,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:37:09,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 02:37:09,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 02:37:09,716 INFO L87 Difference]: Start difference. First operand has 15 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:37:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:37:09,743 INFO L93 Difference]: Finished difference Result 29 states and 42 transitions. [2024-10-14 02:37:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 02:37:09,746 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 02:37:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:37:09,752 INFO L225 Difference]: With dead ends: 29 [2024-10-14 02:37:09,752 INFO L226 Difference]: Without dead ends: 13 [2024-10-14 02:37:09,755 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:37:09,760 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:37:09,761 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:37:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-14 02:37:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-14 02:37:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.375) internal successors, (11), 9 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:37:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-10-14 02:37:09,795 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 6 [2024-10-14 02:37:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:37:09,796 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-14 02:37:09,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:37:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2024-10-14 02:37:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 02:37:09,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:37:09,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:37:09,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:37:09,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:37:09,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:37:09,800 INFO L85 PathProgramCache]: Analyzing trace with hash -170804699, now seen corresponding path program 1 times [2024-10-14 02:37:09,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:37:09,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896750579] [2024-10-14 02:37:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:37:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:09,916 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:37:09,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:37:09,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896750579] [2024-10-14 02:37:09,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896750579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:37:09,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:37:09,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 02:37:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032053530] [2024-10-14 02:37:09,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:37:09,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 02:37:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:37:09,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 02:37:09,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 02:37:09,922 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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:37:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:37:09,946 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-10-14 02:37:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 02:37:09,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-10-14 02:37:09,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:37:09,947 INFO L225 Difference]: With dead ends: 23 [2024-10-14 02:37:09,947 INFO L226 Difference]: Without dead ends: 15 [2024-10-14 02:37:09,948 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-14 02:37:09,949 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 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-14 02:37:09,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:37:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-14 02:37:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-14 02:37:09,953 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-14 02:37:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-10-14 02:37:09,954 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 7 [2024-10-14 02:37:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:37:09,954 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-10-14 02:37:09,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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:37:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-10-14 02:37:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 02:37:09,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:37:09,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:37:09,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:37:09,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:37:09,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:37:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash -169017239, now seen corresponding path program 1 times [2024-10-14 02:37:09,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:37:09,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73937712] [2024-10-14 02:37:09,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:09,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:37:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:37:09,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [685825482] [2024-10-14 02:37:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:09,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:37:09,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:37:09,984 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:37:09,985 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:37:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:10,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 02:37:10,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:37:10,137 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:37:10,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:37:10,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:37:10,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73937712] [2024-10-14 02:37:10,138 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:37:10,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685825482] [2024-10-14 02:37:10,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685825482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:37:10,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:37:10,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 02:37:10,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207642174] [2024-10-14 02:37:10,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:37:10,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:37:10,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:37:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:37:10,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:37:10,144 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 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:37:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:37:10,263 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-10-14 02:37:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:37:10,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-10-14 02:37:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:37:10,265 INFO L225 Difference]: With dead ends: 25 [2024-10-14 02:37:10,269 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 02:37:10,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:37:10,271 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:37:10,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:37:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 02:37:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-14 02:37:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 02:37:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-14 02:37:10,287 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2024-10-14 02:37:10,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:37:10,287 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-14 02:37:10,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 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:37:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-10-14 02:37:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 02:37:10,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:37:10,288 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:37:10,303 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:37:10,491 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-14 02:37:10,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:37:10,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:37:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash 867499275, now seen corresponding path program 1 times [2024-10-14 02:37:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:37:10,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133210642] [2024-10-14 02:37:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:37:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:10,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:37:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:10,629 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:37:10,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:37:10,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133210642] [2024-10-14 02:37:10,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133210642] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:37:10,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957636981] [2024-10-14 02:37:10,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:10,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:37:10,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:37:10,633 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:37:10,634 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:37:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:10,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 02:37:10,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:37:10,730 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:37:10,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:37:10,804 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:37:10,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957636981] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:37:10,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:37:10,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-10-14 02:37:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475871822] [2024-10-14 02:37:10,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:37:10,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:37:10,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:37:10,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:37:10,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:37:10,809 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-14 02:37:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:37:10,904 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-10-14 02:37:10,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:37:10,905 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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 15 [2024-10-14 02:37:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:37:10,907 INFO L225 Difference]: With dead ends: 55 [2024-10-14 02:37:10,908 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 02:37:10,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 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-14 02:37:10,910 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:37:10,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 61 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:37:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 02:37:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2024-10-14 02:37:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 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-14 02:37:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-10-14 02:37:10,922 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 15 [2024-10-14 02:37:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:37:10,923 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-10-14 02:37:10,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-14 02:37:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-10-14 02:37:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 02:37:10,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:37:10,924 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:37:10,936 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-14 02:37:11,124 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-14 02:37:11,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:37:11,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:37:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash 869286735, now seen corresponding path program 1 times [2024-10-14 02:37:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:37:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439234838] [2024-10-14 02:37:11,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:37:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:37:11,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726851241] [2024-10-14 02:37:11,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:11,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:37:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:37:11,146 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:37:11,147 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:37:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:11,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 02:37:11,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:37:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:37:11,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:37:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:37:11,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:37:11,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439234838] [2024-10-14 02:37:11,476 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:37:11,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726851241] [2024-10-14 02:37:11,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726851241] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:37:11,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 02:37:11,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2024-10-14 02:37:11,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850860285] [2024-10-14 02:37:11,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 02:37:11,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 02:37:11,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:37:11,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 02:37:11,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:37:11,478 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 02:37:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:37:11,571 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2024-10-14 02:37:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:37:11,572 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-10-14 02:37:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:37:11,573 INFO L225 Difference]: With dead ends: 57 [2024-10-14 02:37:11,573 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 02:37:11,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:37:11,575 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:37:11,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:37:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 02:37:11,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2024-10-14 02:37:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:37:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-10-14 02:37:11,595 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 15 [2024-10-14 02:37:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:37:11,595 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-10-14 02:37:11,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 02:37:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-10-14 02:37:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 02:37:11,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:37:11,596 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 02:37:11,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 02:37:11,800 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-14 02:37:11,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:37:11,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:37:11,802 INFO L85 PathProgramCache]: Analyzing trace with hash 24753612, now seen corresponding path program 1 times [2024-10-14 02:37:11,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:37:11,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142235399] [2024-10-14 02:37:11,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:11,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:37:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:37:11,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744491205] [2024-10-14 02:37:11,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:11,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:37:11,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:37:11,823 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:37:11,827 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:37:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:11,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 02:37:11,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:37:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 02:37:12,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:37:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 02:37:12,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:37:12,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142235399] [2024-10-14 02:37:12,243 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:37:12,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744491205] [2024-10-14 02:37:12,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744491205] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:37:12,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 02:37:12,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-10-14 02:37:12,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288371505] [2024-10-14 02:37:12,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 02:37:12,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 02:37:12,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:37:12,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 02:37:12,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-14 02:37:12,247 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:37:12,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:37:12,393 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-10-14 02:37:12,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:37:12,394 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2024-10-14 02:37:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:37:12,395 INFO L225 Difference]: With dead ends: 48 [2024-10-14 02:37:12,395 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 02:37:12,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:37:12,396 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:37:12,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 82 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:37:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 02:37:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 02:37:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 02:37:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-10-14 02:37:12,411 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 21 [2024-10-14 02:37:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:37:12,411 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-10-14 02:37:12,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:37:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-10-14 02:37:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 02:37:12,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:37:12,413 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-10-14 02:37:12,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 02:37:12,613 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-14 02:37:12,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:37:12,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:37:12,614 INFO L85 PathProgramCache]: Analyzing trace with hash -795795011, now seen corresponding path program 2 times [2024-10-14 02:37:12,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:37:12,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580192179] [2024-10-14 02:37:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:12,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:37:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:12,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:37:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:12,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 02:37:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 02:37:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:12,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:37:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:37:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 02:37:12,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:37:12,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580192179] [2024-10-14 02:37:12,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580192179] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:37:12,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392949441] [2024-10-14 02:37:12,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 02:37:12,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:37:12,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:37:12,874 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:37:12,876 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:37:12,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 02:37:12,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:37:12,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 02:37:12,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:37:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:37:13,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:37:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 02:37:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392949441] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:37:13,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:37:13,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-10-14 02:37:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495407942] [2024-10-14 02:37:13,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:37:13,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 02:37:13,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:37:13,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 02:37:13,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-10-14 02:37:13,143 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-14 02:37:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:37:13,333 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2024-10-14 02:37:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 02:37:13,333 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 39 [2024-10-14 02:37:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:37:13,335 INFO L225 Difference]: With dead ends: 118 [2024-10-14 02:37:13,335 INFO L226 Difference]: Without dead ends: 113 [2024-10-14 02:37:13,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 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-14 02:37:13,341 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 97 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:37:13,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 94 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:37:13,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-14 02:37:13,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 88. [2024-10-14 02:37:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 02:37:13,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2024-10-14 02:37:13,367 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 39 [2024-10-14 02:37:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:37:13,367 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2024-10-14 02:37:13,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-14 02:37:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2024-10-14 02:37:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 02:37:13,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:37:13,372 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2024-10-14 02:37:13,391 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-14 02:37:13,572 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-14 02:37:13,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:37:13,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:37:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1312813826, now seen corresponding path program 2 times [2024-10-14 02:37:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:37:13,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218365898] [2024-10-14 02:37:13,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:13,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:37:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:37:13,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154016183] [2024-10-14 02:37:13,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 02:37:13,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:37:13,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:37:13,602 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-14 02:37:13,604 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-14 02:37:13,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 02:37:13,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:37:13,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-14 02:37:13,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:37:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 53 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:37:13,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:37:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 53 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:37:14,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:37:14,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218365898] [2024-10-14 02:37:14,189 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:37:14,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154016183] [2024-10-14 02:37:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154016183] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:37:14,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 02:37:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2024-10-14 02:37:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256990490] [2024-10-14 02:37:14,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 02:37:14,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 02:37:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:37:14,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 02:37:14,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-10-14 02:37:14,193 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 22 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 02:37:14,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:37:14,491 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-10-14 02:37:14,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:37:14,491 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 45 [2024-10-14 02:37:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:37:14,493 INFO L225 Difference]: With dead ends: 94 [2024-10-14 02:37:14,493 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 02:37:14,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2024-10-14 02:37:14,494 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:37:14,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 205 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 02:37:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 02:37:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 02:37:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 02:37:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2024-10-14 02:37:14,512 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 45 [2024-10-14 02:37:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:37:14,512 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2024-10-14 02:37:14,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 02:37:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2024-10-14 02:37:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 02:37:14,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:37:14,515 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-10-14 02:37:14,532 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-14 02:37:14,715 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-14 02:37:14,716 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:37:14,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:37:14,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1242040609, now seen corresponding path program 3 times [2024-10-14 02:37:14,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:37:14,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961085848] [2024-10-14 02:37:14,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:37:14,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:37:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:37:14,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [708334769] [2024-10-14 02:37:14,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 02:37:14,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:37:14,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:37:14,764 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-14 02:37:14,765 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-14 02:37:14,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-14 02:37:14,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 02:37:14,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 02:37:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 02:37:14,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 02:37:14,964 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 02:37:14,965 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 02:37:14,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 02:37:15,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:37:15,170 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-10-14 02:37:15,213 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 02:37:15,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:37:15 BoogieIcfgContainer [2024-10-14 02:37:15,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 02:37:15,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 02:37:15,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 02:37:15,216 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 02:37:15,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:37:09" (3/4) ... [2024-10-14 02:37:15,217 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 02:37:15,271 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 02:37:15,271 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 02:37:15,272 INFO L158 Benchmark]: Toolchain (without parser) took 6578.86ms. Allocated memory was 199.2MB in the beginning and 274.7MB in the end (delta: 75.5MB). Free memory was 129.0MB in the beginning and 185.4MB in the end (delta: -56.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 02:37:15,272 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 199.2MB. Free memory is still 166.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:37:15,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.51ms. Allocated memory is still 199.2MB. Free memory was 128.8MB in the beginning and 117.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 02:37:15,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.26ms. Allocated memory is still 199.2MB. Free memory was 117.1MB in the beginning and 115.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:37:15,273 INFO L158 Benchmark]: Boogie Preprocessor took 32.90ms. Allocated memory is still 199.2MB. Free memory was 115.7MB in the beginning and 114.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:37:15,273 INFO L158 Benchmark]: RCFGBuilder took 371.34ms. Allocated memory is still 199.2MB. Free memory was 113.9MB in the beginning and 163.6MB in the end (delta: -49.6MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-10-14 02:37:15,273 INFO L158 Benchmark]: TraceAbstraction took 5810.14ms. Allocated memory was 199.2MB in the beginning and 274.7MB in the end (delta: 75.5MB). Free memory was 163.6MB in the beginning and 189.6MB in the end (delta: -26.0MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2024-10-14 02:37:15,274 INFO L158 Benchmark]: Witness Printer took 56.04ms. Allocated memory is still 274.7MB. Free memory was 189.6MB in the beginning and 185.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 02:37:15,277 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 199.2MB. Free memory is still 166.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.51ms. Allocated memory is still 199.2MB. Free memory was 128.8MB in the beginning and 117.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.26ms. Allocated memory is still 199.2MB. Free memory was 117.1MB in the beginning and 115.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.90ms. Allocated memory is still 199.2MB. Free memory was 115.7MB in the beginning and 114.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.34ms. Allocated memory is still 199.2MB. Free memory was 113.9MB in the beginning and 163.6MB in the end (delta: -49.6MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5810.14ms. Allocated memory was 199.2MB in the beginning and 274.7MB in the end (delta: 75.5MB). Free memory was 163.6MB in the beginning and 189.6MB in the end (delta: -26.0MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Witness Printer took 56.04ms. Allocated memory is still 274.7MB. Free memory was 189.6MB in the beginning and 185.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L23] y = 0 [L24] x = 0 [L25] c = 0 VAL [c=0, counter=0, k=11, x=0, y=0] [L27] EXPR counter++ VAL [c=0, counter=1, k=11, x=0, y=0] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=1] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=0, counter=1, k=11, x=0, y=0] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=1, counter=1, k=11, x=1, y=1] [L27] EXPR counter++ VAL [c=1, counter=2, k=11, x=1, y=1] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=2] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=1, counter=2, k=11, x=1, y=1] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=2, counter=2, k=11, x=9, y=2] [L27] EXPR counter++ VAL [c=2, counter=3, k=11, x=9, y=2] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=3] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=2, counter=3, k=11, x=9, y=2] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=3, counter=3, k=11, x=36, y=3] [L27] EXPR counter++ VAL [c=3, counter=4, k=11, x=36, y=3] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=4] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=3, counter=4, k=11, x=36, y=3] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=4, counter=4, k=11, x=100, y=4] [L27] EXPR counter++ VAL [c=4, counter=5, k=11, x=100, y=4] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=5] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=4, counter=5, k=11, x=100, y=4] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=5, counter=5, k=11, x=225, y=5] [L27] EXPR counter++ VAL [c=5, counter=6, k=11, x=225, y=5] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=6] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=5, counter=6, k=11, x=225, y=5] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=6, counter=6, k=11, x=441, y=6] [L27] EXPR counter++ VAL [c=6, counter=7, k=11, x=441, y=6] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=7] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=6, counter=7, k=11, x=441, y=6] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=7, counter=7, k=11, x=784, y=7] [L27] EXPR counter++ VAL [c=7, counter=8, k=11, x=784, y=7] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=8] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=7, counter=8, k=11, x=784, y=7] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=8, counter=8, k=11, x=1296, y=8] [L27] EXPR counter++ VAL [c=8, counter=9, k=11, x=1296, y=8] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=9] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=8, counter=9, k=11, x=1296, y=8] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=9, counter=9, k=11, x=2025, y=9] [L27] EXPR counter++ VAL [c=9, counter=10, k=11, x=2025, y=9] [L27] COND TRUE counter++<10 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=10] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=9, counter=10, k=11, x=2025, y=9] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=10, counter=10, k=11, x=3025, y=10] [L27] EXPR counter++ VAL [c=10, counter=11, k=11, x=3025, y=10] [L27] COND FALSE !(counter++<10) [L37] CALL __VERIFIER_assert(k*y - (y*y) == 0) VAL [\old(cond)=0, counter=11] [L10] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L12] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 594 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 487 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 107 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 35 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 329 ConstructedInterpolants, 0 QuantifiedInterpolants, 1440 SizeOfPredicates, 13 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 165/418 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 02:37:15,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE