./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/hard-u_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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/hard-u_valuebound1.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 2205701c87619eed0a8a76ebf684289d4e97e42556aa5e531d0e97f394ad4619 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:26:31,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:26:31,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:26:31,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:26:31,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:26:31,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:26:31,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:26:31,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:26:31,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:26:31,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:26:31,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:26:31,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:26:31,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:26:31,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:26:31,232 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:26:31,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:26:31,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:26:31,233 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:26:31,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:26:31,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:26:31,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:26:31,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:26:31,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:26:31,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:26:31,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:26:31,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:26:31,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:26:31,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:26:31,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:26:31,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:26:31,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:26:31,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:26:31,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:26:31,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:26:31,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:26:31,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:26:31,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:26:31,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:26:31,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:26:31,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:26:31,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:26:31,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:26:31,242 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 -> 2205701c87619eed0a8a76ebf684289d4e97e42556aa5e531d0e97f394ad4619 [2024-11-19 21:26:31,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:26:31,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:26:31,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:26:31,520 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:26:31,521 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:26:31,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c [2024-11-19 21:26:32,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:26:33,101 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:26:33,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c [2024-11-19 21:26:33,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8db49f3f/19aecd37dd154a1e8709f228a23b3e41/FLAGc5a2f9ed0 [2024-11-19 21:26:33,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8db49f3f/19aecd37dd154a1e8709f228a23b3e41 [2024-11-19 21:26:33,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:26:33,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:26:33,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:26:33,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:26:33,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:26:33,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b375c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33, skipping insertion in model container [2024-11-19 21:26:33,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:26:33,722 WARN L250 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/hard-u_valuebound1.c[537,550] [2024-11-19 21:26:33,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:26:33,753 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:26:33,766 WARN L250 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/hard-u_valuebound1.c[537,550] [2024-11-19 21:26:33,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:26:33,799 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:26:33,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33 WrapperNode [2024-11-19 21:26:33,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:26:33,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:26:33,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:26:33,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:26:33,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,828 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-19 21:26:33,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:26:33,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:26:33,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:26:33,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:26:33,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,857 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-11-19 21:26:33,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,865 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:26:33,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:26:33,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:26:33,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:26:33,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (1/1) ... [2024-11-19 21:26:33,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:26:33,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:26:33,917 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-11-19 21:26:33,938 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-11-19 21:26:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:26:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 21:26:33,992 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 21:26:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:26:33,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:26:33,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:26:33,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 21:26:34,004 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 21:26:34,061 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:26:34,063 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:26:34,249 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-19 21:26:34,250 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:26:34,265 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:26:34,266 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 21:26:34,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:26:34 BoogieIcfgContainer [2024-11-19 21:26:34,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:26:34,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:26:34,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:26:34,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:26:34,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:26:33" (1/3) ... [2024-11-19 21:26:34,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5d7d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:26:34, skipping insertion in model container [2024-11-19 21:26:34,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:33" (2/3) ... [2024-11-19 21:26:34,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5d7d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:26:34, skipping insertion in model container [2024-11-19 21:26:34,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:26:34" (3/3) ... [2024-11-19 21:26:34,278 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound1.c [2024-11-19 21:26:34,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:26:34,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:26:34,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:26:34,368 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;@1c02ab93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:26:34,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:26:34,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 21:26:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 21:26:34,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:26:34,382 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:26:34,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:26:34,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:26:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash -487550744, now seen corresponding path program 1 times [2024-11-19 21:26:34,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:26:34,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029558699] [2024-11-19 21:26:34,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:26:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:34,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:26:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:34,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:26:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:34,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:26:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 21:26:34,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:26:34,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029558699] [2024-11-19 21:26:34,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029558699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:26:34,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:26:34,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 21:26:34,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899984771] [2024-11-19 21:26:34,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:26:34,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:26:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:26:34,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:26:34,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 21:26:34,590 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 21:26:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:26:34,617 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2024-11-19 21:26:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:26:34,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-11-19 21:26:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:26:34,626 INFO L225 Difference]: With dead ends: 63 [2024-11-19 21:26:34,626 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 21:26:34,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-11-19 21:26:34,635 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:26:34,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:26:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 21:26:34,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-19 21:26:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 21:26:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-11-19 21:26:34,682 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 24 [2024-11-19 21:26:34,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:26:34,683 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-11-19 21:26:34,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 21:26:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-19 21:26:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 21:26:34,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:26:34,685 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:26:34,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 21:26:34,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:26:34,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:26:34,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1636258074, now seen corresponding path program 1 times [2024-11-19 21:26:34,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:26:34,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008716565] [2024-11-19 21:26:34,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:34,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:26:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:35,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:26:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:35,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:26:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:35,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:26:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 21:26:35,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:26:35,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008716565] [2024-11-19 21:26:35,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008716565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:26:35,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:26:35,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 21:26:35,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767912286] [2024-11-19 21:26:35,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:26:35,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:26:35,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:26:35,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:26:35,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:26:35,120 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 21:26:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:26:35,214 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2024-11-19 21:26:35,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:26:35,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-11-19 21:26:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:26:35,216 INFO L225 Difference]: With dead ends: 42 [2024-11-19 21:26:35,216 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 21:26:35,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-11-19 21:26:35,217 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:26:35,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 126 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:26:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 21:26:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2024-11-19 21:26:35,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 21:26:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-19 21:26:35,233 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 24 [2024-11-19 21:26:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:26:35,233 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-19 21:26:35,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 21:26:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-19 21:26:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 21:26:35,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:26:35,235 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:26:35,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 21:26:35,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:26:35,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:26:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash 906849917, now seen corresponding path program 1 times [2024-11-19 21:26:35,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:26:35,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231822546] [2024-11-19 21:26:35,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:35,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:26:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:35,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:26:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:35,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:26:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:35,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:26:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:35,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 21:26:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 21:26:35,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:26:35,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231822546] [2024-11-19 21:26:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231822546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:26:35,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:26:35,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 21:26:35,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197064413] [2024-11-19 21:26:35,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:26:35,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:26:35,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:26:35,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:26:35,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 21:26:35,601 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 21:26:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:26:35,695 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-11-19 21:26:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:26:35,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-11-19 21:26:35,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:26:35,700 INFO L225 Difference]: With dead ends: 46 [2024-11-19 21:26:35,700 INFO L226 Difference]: Without dead ends: 44 [2024-11-19 21:26:35,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-11-19 21:26:35,702 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:26:35,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 123 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:26:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-19 21:26:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2024-11-19 21:26:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 21:26:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-11-19 21:26:35,714 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 29 [2024-11-19 21:26:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:26:35,715 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-11-19 21:26:35,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 21:26:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-11-19 21:26:35,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 21:26:35,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:26:35,716 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:26:35,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 21:26:35,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:26:35,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:26:35,717 INFO L85 PathProgramCache]: Analyzing trace with hash 710995206, now seen corresponding path program 1 times [2024-11-19 21:26:35,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:26:35,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476615595] [2024-11-19 21:26:35,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:35,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:26:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:26:35,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897381277] [2024-11-19 21:26:35,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:35,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:26:35,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:26:35,751 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-11-19 21:26:35,752 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-11-19 21:26:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:35,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 21:26:35,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:26:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 21:26:36,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:26:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:26:36,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476615595] [2024-11-19 21:26:36,010 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:26:36,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897381277] [2024-11-19 21:26:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897381277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:26:36,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:26:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:26:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143690921] [2024-11-19 21:26:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:26:36,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:26:36,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:26:36,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:26:36,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:26:36,013 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 21:26:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:26:36,266 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2024-11-19 21:26:36,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:26:36,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2024-11-19 21:26:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:26:36,268 INFO L225 Difference]: With dead ends: 63 [2024-11-19 21:26:36,268 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 21:26:36,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:26:36,272 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:26:36,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 169 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 21:26:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 21:26:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-19 21:26:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 21:26:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2024-11-19 21:26:36,294 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 34 [2024-11-19 21:26:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:26:36,294 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-11-19 21:26:36,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 21:26:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2024-11-19 21:26:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 21:26:36,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:26:36,299 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:26:36,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 21:26:36,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:26:36,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:26:36,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:26:36,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1829555286, now seen corresponding path program 1 times [2024-11-19 21:26:36,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:26:36,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934222371] [2024-11-19 21:26:36,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:36,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:26:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:26:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426636104] [2024-11-19 21:26:36,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:36,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:26:36,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:26:36,539 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-11-19 21:26:36,542 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-11-19 21:26:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:36,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 21:26:36,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:26:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 21:26:36,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:26:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:26:37,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:26:38,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934222371] [2024-11-19 21:26:38,000 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:26:38,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426636104] [2024-11-19 21:26:38,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426636104] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:26:38,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 21:26:38,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-11-19 21:26:38,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359859258] [2024-11-19 21:26:38,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 21:26:38,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 21:26:38,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:26:38,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 21:26:38,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:26:38,002 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-19 21:26:39,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 21:26:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:26:39,986 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2024-11-19 21:26:39,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 21:26:39,987 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) Word has length 41 [2024-11-19 21:26:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:26:39,989 INFO L225 Difference]: With dead ends: 68 [2024-11-19 21:26:39,990 INFO L226 Difference]: Without dead ends: 60 [2024-11-19 21:26:39,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-11-19 21:26:39,992 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:26:39,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 157 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 21:26:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-19 21:26:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-19 21:26:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 21:26:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2024-11-19 21:26:40,022 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 41 [2024-11-19 21:26:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:26:40,023 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-19 21:26:40,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-19 21:26:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2024-11-19 21:26:40,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 21:26:40,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:26:40,024 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:26:40,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 21:26:40,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:26:40,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:26:40,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:26:40,228 INFO L85 PathProgramCache]: Analyzing trace with hash 105343995, now seen corresponding path program 1 times [2024-11-19 21:26:40,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:26:40,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938081558] [2024-11-19 21:26:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:40,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:26:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:26:40,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010675961] [2024-11-19 21:26:40,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:40,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:26:40,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:26:40,269 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-11-19 21:26:40,272 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-11-19 21:26:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:40,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 21:26:40,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:26:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:26:40,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:26:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:26:41,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:26:41,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938081558] [2024-11-19 21:26:41,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:26:41,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010675961] [2024-11-19 21:26:41,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010675961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:26:41,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 21:26:41,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2024-11-19 21:26:41,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019739491] [2024-11-19 21:26:41,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 21:26:41,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 21:26:41,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:26:41,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 21:26:41,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:26:41,222 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 9 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-19 21:26:43,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 21:26:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:26:44,127 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2024-11-19 21:26:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:26:44,128 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 9 states have call predecessors, (16), 5 states have call successors, (16) Word has length 51 [2024-11-19 21:26:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:26:44,131 INFO L225 Difference]: With dead ends: 87 [2024-11-19 21:26:44,131 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 21:26:44,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-11-19 21:26:44,132 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:26:44,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 235 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 21:26:44,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 21:26:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-19 21:26:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 21:26:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2024-11-19 21:26:44,164 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 51 [2024-11-19 21:26:44,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:26:44,164 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2024-11-19 21:26:44,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 9 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-19 21:26:44,165 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2024-11-19 21:26:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 21:26:44,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:26:44,167 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:26:44,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 21:26:44,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:26:44,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:26:44,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:26:44,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1754894755, now seen corresponding path program 1 times [2024-11-19 21:26:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:26:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983662387] [2024-11-19 21:26:44,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:26:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:26:44,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220577261] [2024-11-19 21:26:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:44,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:26:44,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:26:44,429 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-11-19 21:26:44,430 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-11-19 21:26:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:44,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 21:26:44,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:26:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 33 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-19 21:26:45,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:26:54,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:26:54,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983662387] [2024-11-19 21:26:54,881 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:26:54,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220577261] [2024-11-19 21:26:54,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220577261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:26:54,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:26:54,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-11-19 21:26:54,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942940188] [2024-11-19 21:26:54,881 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 21:26:54,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 21:26:54,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:26:54,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 21:26:54,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=277, Unknown=2, NotChecked=0, Total=342 [2024-11-19 21:26:54,883 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-19 21:26:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:26:55,306 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2024-11-19 21:26:55,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:26:55,307 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 71 [2024-11-19 21:26:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:26:55,309 INFO L225 Difference]: With dead ends: 130 [2024-11-19 21:26:55,309 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 21:26:55,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=69, Invalid=309, Unknown=2, NotChecked=0, Total=380 [2024-11-19 21:26:55,310 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 27 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:26:55,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 211 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 21:26:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 21:26:55,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-11-19 21:26:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 58 states have internal predecessors, (61), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-19 21:26:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2024-11-19 21:26:55,338 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 71 [2024-11-19 21:26:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:26:55,339 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2024-11-19 21:26:55,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-19 21:26:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2024-11-19 21:26:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 21:26:55,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:26:55,343 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:26:55,352 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-11-19 21:26:55,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:26:55,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:26:55,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:26:55,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1620227847, now seen corresponding path program 1 times [2024-11-19 21:26:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:26:55,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990400278] [2024-11-19 21:26:55,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:55,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:26:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 21:26:55,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1370113696] [2024-11-19 21:26:55,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:26:55,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:26:55,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:26:55,578 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-11-19 21:26:55,579 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-11-19 21:26:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:26:55,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 21:26:55,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:26:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 36 proven. 47 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-19 21:26:56,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:27:05,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:27:05,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990400278] [2024-11-19 21:27:05,679 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 21:27:05,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370113696] [2024-11-19 21:27:05,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370113696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:27:05,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:27:05,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-19 21:27:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441847270] [2024-11-19 21:27:05,681 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 21:27:05,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 21:27:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:27:05,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 21:27:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=372, Unknown=2, NotChecked=0, Total=462 [2024-11-19 21:27:05,685 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-19 21:27:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:27:06,382 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2024-11-19 21:27:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 21:27:06,383 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 82 [2024-11-19 21:27:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:27:06,384 INFO L225 Difference]: With dead ends: 108 [2024-11-19 21:27:06,384 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 21:27:06,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=149, Invalid=605, Unknown=2, NotChecked=0, Total=756 [2024-11-19 21:27:06,387 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:27:06,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 282 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 21:27:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 21:27:06,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-11-19 21:27:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 51 states have internal predecessors, (51), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 21:27:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-11-19 21:27:06,404 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 82 [2024-11-19 21:27:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:27:06,405 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-11-19 21:27:06,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-19 21:27:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-19 21:27:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 21:27:06,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:27:06,409 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:27:06,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 21:27:06,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:27:06,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:27:06,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:27:06,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1086391547, now seen corresponding path program 1 times [2024-11-19 21:27:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:27:06,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694580298] [2024-11-19 21:27:06,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:27:06,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:27:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:27:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:27:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:27:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 21:27:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:27:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:27:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:27:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 21:27:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:27:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-19 21:27:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:27:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:27:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:27:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-19 21:27:17,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:27:17,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694580298] [2024-11-19 21:27:17,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694580298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:27:17,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942980271] [2024-11-19 21:27:17,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:27:17,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:27:17,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:27:17,647 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-11-19 21:27:17,648 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-11-19 21:27:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:17,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 21:27:17,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:27:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-19 21:27:17,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:27:18,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942980271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:27:18,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 21:27:18,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2024-11-19 21:27:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454588351] [2024-11-19 21:27:18,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 21:27:18,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 21:27:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:27:18,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 21:27:18,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:27:18,059 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 7 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2024-11-19 21:27:23,717 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 82 DAG size of output: 70 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-19 21:27:28,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 21:27:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:27:37,444 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-11-19 21:27:37,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:27:37,445 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 7 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) Word has length 82 [2024-11-19 21:27:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:27:37,446 INFO L225 Difference]: With dead ends: 94 [2024-11-19 21:27:37,446 INFO L226 Difference]: Without dead ends: 72 [2024-11-19 21:27:37,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-19 21:27:37,447 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:27:37,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 292 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 194 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2024-11-19 21:27:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-19 21:27:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-19 21:27:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.0) internal successors, (46), 46 states have internal predecessors, (46), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 21:27:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-11-19 21:27:37,467 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 82 [2024-11-19 21:27:37,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:27:37,468 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-11-19 21:27:37,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 7 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2024-11-19 21:27:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-11-19 21:27:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 21:27:37,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:27:37,469 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:27:37,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 21:27:37,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:27:37,674 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:27:37,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:27:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1729716470, now seen corresponding path program 1 times [2024-11-19 21:27:37,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:27:37,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852028800] [2024-11-19 21:27:37,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:27:37,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:27:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:27:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:27:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:27:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 21:27:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:27:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:27:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:27:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 21:27:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:27:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-19 21:27:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:27:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:27:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:27:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:27:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-19 21:27:38,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:27:38,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852028800] [2024-11-19 21:27:38,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852028800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:27:38,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996169462] [2024-11-19 21:27:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:27:38,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:27:38,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:27:38,248 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-11-19 21:27:38,249 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-11-19 21:27:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:27:38,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-19 21:27:38,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:27:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 49 proven. 54 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-19 21:27:39,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:27:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-19 21:27:41,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996169462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:27:41,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:27:41,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 17] total 35 [2024-11-19 21:27:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071036125] [2024-11-19 21:27:41,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:27:41,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 21:27:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:27:41,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 21:27:41,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 21:27:41,131 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 35 states, 30 states have (on average 1.8) internal successors, (54), 25 states have internal predecessors, (54), 19 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 23 states have call predecessors, (39), 18 states have call successors, (39) [2024-11-19 21:27:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:27:46,148 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2024-11-19 21:27:46,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 21:27:46,148 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 1.8) internal successors, (54), 25 states have internal predecessors, (54), 19 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 23 states have call predecessors, (39), 18 states have call successors, (39) Word has length 87 [2024-11-19 21:27:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:27:46,149 INFO L225 Difference]: With dead ends: 72 [2024-11-19 21:27:46,149 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 21:27:46,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=259, Invalid=1381, Unknown=0, NotChecked=0, Total=1640 [2024-11-19 21:27:46,150 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:27:46,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 461 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 21:27:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 21:27:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 21:27:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 21:27:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 21:27:46,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2024-11-19 21:27:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:27:46,151 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 21:27:46,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 1.8) internal successors, (54), 25 states have internal predecessors, (54), 19 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 23 states have call predecessors, (39), 18 states have call successors, (39) [2024-11-19 21:27:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 21:27:46,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 21:27:46,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 21:27:46,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 21:27:46,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:27:46,358 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:27:46,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 21:27:56,725 WARN L286 SmtUtils]: Spent 9.13s on a formula simplification. DAG size of input: 53 DAG size of output: 31 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-19 21:27:57,110 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 21:27:57,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:27:57 BoogieIcfgContainer [2024-11-19 21:27:57,140 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 21:27:57,140 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 21:27:57,140 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 21:27:57,141 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 21:27:57,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:26:34" (3/4) ... [2024-11-19 21:27:57,143 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 21:27:57,147 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-19 21:27:57,147 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-19 21:27:57,151 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-19 21:27:57,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 21:27:57,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 21:27:57,152 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 21:27:57,246 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 21:27:57,246 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 21:27:57,246 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 21:27:57,247 INFO L158 Benchmark]: Toolchain (without parser) took 83728.32ms. Allocated memory was 163.6MB in the beginning and 199.2MB in the end (delta: 35.7MB). Free memory was 91.1MB in the beginning and 137.7MB in the end (delta: -46.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 21:27:57,247 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 21:27:57,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.26ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 78.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 21:27:57,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.70ms. Allocated memory is still 163.6MB. Free memory was 78.3MB in the beginning and 76.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 21:27:57,248 INFO L158 Benchmark]: Boogie Preprocessor took 48.07ms. Allocated memory is still 163.6MB. Free memory was 76.7MB in the beginning and 74.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 21:27:57,248 INFO L158 Benchmark]: RCFGBuilder took 387.80ms. Allocated memory was 163.6MB in the beginning and 199.2MB in the end (delta: 35.7MB). Free memory was 74.9MB in the beginning and 161.6MB in the end (delta: -86.7MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-11-19 21:27:57,248 INFO L158 Benchmark]: TraceAbstraction took 82870.34ms. Allocated memory is still 199.2MB. Free memory was 161.6MB in the beginning and 143.0MB in the end (delta: 18.6MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. [2024-11-19 21:27:57,248 INFO L158 Benchmark]: Witness Printer took 106.08ms. Allocated memory is still 199.2MB. Free memory was 143.0MB in the beginning and 137.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 21:27:57,253 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.19ms. Allocated memory is still 163.6MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.26ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 78.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.70ms. Allocated memory is still 163.6MB. Free memory was 78.3MB in the beginning and 76.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.07ms. Allocated memory is still 163.6MB. Free memory was 76.7MB in the beginning and 74.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 387.80ms. Allocated memory was 163.6MB in the beginning and 199.2MB in the end (delta: 35.7MB). Free memory was 74.9MB in the beginning and 161.6MB in the end (delta: -86.7MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * TraceAbstraction took 82870.34ms. Allocated memory is still 199.2MB. Free memory was 161.6MB in the beginning and 143.0MB in the end (delta: 18.6MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. * Witness Printer took 106.08ms. Allocated memory is still 199.2MB. Free memory was 143.0MB in the beginning and 137.7MB in the end (delta: 5.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 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.0s, OverallIterations: 10, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 2099 SdHoareTripleChecker+Invalid, 11.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1795 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1898 IncrementalHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 304 mSDtfsCounter, 1898 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 819 GetRequests, 653 SyntacticMatches, 12 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 45.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=7, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 38.3s InterpolantComputationTime, 973 NumberOfCodeBlocks, 973 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 858 ConstructedInterpolants, 0 QuantifiedInterpolants, 5519 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1003 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 1607/1849 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((r <= 0) && (p == 1)) && (B == d)) && (q == 0)) && (A == r)) && (d == 1)) || ((((((d == 1) && (p == 1)) && (A == 1)) && (B == 1)) && (q == 1)) && (((long long) r + 1) == A))) || (((((((((((d + (((((unsigned long long) 4294967295 * d) + B) + r) % 4294967296)) + 1) + d) <= (((long long) 2 * B) + ((long long) 3 * r))) && (A <= 1)) && (2 == p)) && (B <= ((d / 2) + 1))) && (B == 1)) && (q == 0)) && (A == r)) && (((long long) r + 1) <= d))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((p == 1) && (A <= 1)) && (B == d)) && (q == 0)) && (A == r)) && (d == 1)) || (((((((((((d + (((((unsigned long long) 4294967295 * d) + B) + r) % 4294967296)) + 1) + d) <= (((long long) 2 * B) + ((long long) 3 * r))) && (A <= 1)) && (2 == p)) && (B <= ((d / 2) + 1))) && (B == 1)) && (q == 0)) && (A == r)) && (((long long) r + 1) <= d))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-11-19 21:27:57,390 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 Result: TRUE