/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test23-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:50:40,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:50:40,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:50:40,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:50:40,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:50:40,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:50:40,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:50:40,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:50:40,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:50:40,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:50:40,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:50:40,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:50:40,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:50:40,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:50:40,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:50:40,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:50:40,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:50:40,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:50:40,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:50:40,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:50:40,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:50:40,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:50:40,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:50:40,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:50:40,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:50:40,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:50:40,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:50:40,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:50:40,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:50:40,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:50:40,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:50:40,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:50:40,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:50:40,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:50:40,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:50:40,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:50:40,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:50:40,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:50:40,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:50:40,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:50:40,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:50:40,289 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:50:40,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:50:40,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:50:40,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:50:40,308 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:50:40,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:50:40,309 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:50:40,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:50:40,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:50:40,310 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:50:40,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:50:40,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:50:40,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:50:40,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:50:40,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:50:40,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:50:40,311 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:50:40,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:50:40,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:50:40,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:50:40,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:50:40,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:50:40,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:50:40,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:50:40,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:50:40,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:50:40,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:50:40,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:50:40,312 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:50:40,312 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:50:40,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:50:40,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 00:50:40,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:50:40,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:50:40,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:50:40,517 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:50:40,517 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:50:40,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test23-2.c [2022-01-10 00:50:40,584 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a2e0be17/e5b0bf7b5b6041fea02278403e277926/FLAGada7b3385 [2022-01-10 00:50:40,992 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:50:40,993 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-2.c [2022-01-10 00:50:41,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a2e0be17/e5b0bf7b5b6041fea02278403e277926/FLAGada7b3385 [2022-01-10 00:50:41,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a2e0be17/e5b0bf7b5b6041fea02278403e277926 [2022-01-10 00:50:41,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:50:41,381 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:50:41,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:50:41,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:50:41,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:50:41,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:50:41" (1/1) ... [2022-01-10 00:50:41,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@370d9b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41, skipping insertion in model container [2022-01-10 00:50:41,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:50:41" (1/1) ... [2022-01-10 00:50:41,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:50:41,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:50:41,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-2.c[1070,1083] [2022-01-10 00:50:41,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:50:41,555 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:50:41,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-2.c[1070,1083] [2022-01-10 00:50:41,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:50:41,604 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:50:41,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41 WrapperNode [2022-01-10 00:50:41,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:50:41,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:50:41,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:50:41,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:50:41,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41" (1/1) ... [2022-01-10 00:50:41,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41" (1/1) ... [2022-01-10 00:50:41,654 INFO L137 Inliner]: procedures = 16, calls = 57, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2022-01-10 00:50:41,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:50:41,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:50:41,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:50:41,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:50:41,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41" (1/1) ... [2022-01-10 00:50:41,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41" (1/1) ... [2022-01-10 00:50:41,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41" (1/1) ... [2022-01-10 00:50:41,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41" (1/1) ... [2022-01-10 00:50:41,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41" (1/1) ... [2022-01-10 00:50:41,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41" (1/1) ... [2022-01-10 00:50:41,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41" (1/1) ... [2022-01-10 00:50:41,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:50:41,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:50:41,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:50:41,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:50:41,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41" (1/1) ... [2022-01-10 00:50:41,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:50:41,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:41,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 00:50:41,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 00:50:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:50:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:50:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:50:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2022-01-10 00:50:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2022-01-10 00:50:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:50:41,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:50:41,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:50:41,812 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:50:41,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:50:41,944 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:50:41,950 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:50:41,950 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:50:41,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:41 BoogieIcfgContainer [2022-01-10 00:50:41,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:50:41,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:50:41,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:50:41,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:50:41,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:50:41" (1/3) ... [2022-01-10 00:50:41,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce77a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:50:41, skipping insertion in model container [2022-01-10 00:50:41,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:41" (2/3) ... [2022-01-10 00:50:41,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce77a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:50:41, skipping insertion in model container [2022-01-10 00:50:41,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:41" (3/3) ... [2022-01-10 00:50:41,959 INFO L111 eAbstractionObserver]: Analyzing ICFG test23-2.c [2022-01-10 00:50:41,964 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:50:41,964 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:50:42,004 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:50:42,010 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:50:42,011 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:50:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:50:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 00:50:42,029 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:42,030 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:42,030 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:42,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash -203522095, now seen corresponding path program 1 times [2022-01-10 00:50:42,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:42,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529637431] [2022-01-10 00:50:42,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:42,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:42,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:42,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529637431] [2022-01-10 00:50:42,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529637431] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:50:42,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:50:42,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:50:42,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063222413] [2022-01-10 00:50:42,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:50:42,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 00:50:42,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:42,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 00:50:42,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:50:42,354 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:50:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:42,374 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-01-10 00:50:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 00:50:42,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-01-10 00:50:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:42,390 INFO L225 Difference]: With dead ends: 32 [2022-01-10 00:50:42,390 INFO L226 Difference]: Without dead ends: 19 [2022-01-10 00:50:42,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:50:42,398 INFO L933 BasicCegarLoop]: 26 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, 26 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 [2022-01-10 00:50:42,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:50:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-10 00:50:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-01-10 00:50:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:50:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-01-10 00:50:42,438 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 21 [2022-01-10 00:50:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:42,445 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-01-10 00:50:42,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:50:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-01-10 00:50:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 00:50:42,447 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:42,447 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:42,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:50:42,448 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:42,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2074741797, now seen corresponding path program 1 times [2022-01-10 00:50:42,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:42,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924284005] [2022-01-10 00:50:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:42,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:43,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:43,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:43,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:43,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924284005] [2022-01-10 00:50:43,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924284005] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:50:43,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:50:43,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-10 00:50:43,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099770436] [2022-01-10 00:50:43,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:50:43,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 00:50:43,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:43,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 00:50:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-10 00:50:43,664 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:50:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:43,990 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-01-10 00:50:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 00:50:43,991 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-01-10 00:50:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:43,994 INFO L225 Difference]: With dead ends: 42 [2022-01-10 00:50:43,994 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 00:50:43,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-01-10 00:50:44,000 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:44,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 119 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:50:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 00:50:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-01-10 00:50:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 00:50:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-01-10 00:50:44,014 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2022-01-10 00:50:44,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:44,015 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-01-10 00:50:44,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:50:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-01-10 00:50:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 00:50:44,018 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:44,020 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:44,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:50:44,021 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash 80597091, now seen corresponding path program 1 times [2022-01-10 00:50:44,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:44,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768349538] [2022-01-10 00:50:44,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:44,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:44,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:44,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:44,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:44,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768349538] [2022-01-10 00:50:44,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768349538] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:44,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835366155] [2022-01-10 00:50:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:44,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:44,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:44,130 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) [2022-01-10 00:50:44,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 00:50:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:44,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 00:50:44,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:50:44,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:44,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835366155] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:44,751 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:44,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-01-10 00:50:44,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461293698] [2022-01-10 00:50:44,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:44,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-10 00:50:44,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:44,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-10 00:50:44,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2022-01-10 00:50:44,753 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 30 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 22 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:45,047 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-01-10 00:50:45,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 00:50:45,047 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 22 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 22 [2022-01-10 00:50:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:45,048 INFO L225 Difference]: With dead ends: 44 [2022-01-10 00:50:45,048 INFO L226 Difference]: Without dead ends: 35 [2022-01-10 00:50:45,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=1233, Unknown=0, NotChecked=0, Total=1406 [2022-01-10 00:50:45,050 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:45,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 340 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 00:50:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-10 00:50:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-01-10 00:50:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 00:50:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-10 00:50:45,057 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 22 [2022-01-10 00:50:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:45,057 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-10 00:50:45,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 22 states have internal predecessors, (42), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-10 00:50:45,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 00:50:45,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:45,058 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:45,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 00:50:45,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:45,287 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:45,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash 338762529, now seen corresponding path program 1 times [2022-01-10 00:50:45,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:45,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253911472] [2022-01-10 00:50:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:45,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:45,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:45,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:45,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:45,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253911472] [2022-01-10 00:50:45,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253911472] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:50:45,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:50:45,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-10 00:50:45,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871377001] [2022-01-10 00:50:45,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:50:45,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 00:50:45,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:45,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 00:50:45,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-10 00:50:45,945 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:50:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:46,181 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-01-10 00:50:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 00:50:46,182 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-01-10 00:50:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:46,183 INFO L225 Difference]: With dead ends: 42 [2022-01-10 00:50:46,183 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 00:50:46,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-01-10 00:50:46,184 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:46,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 172 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:50:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 00:50:46,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2022-01-10 00:50:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 00:50:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-01-10 00:50:46,191 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 22 [2022-01-10 00:50:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:46,191 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-01-10 00:50:46,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:50:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-01-10 00:50:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 00:50:46,195 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:46,196 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:46,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:50:46,196 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:46,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1823127190, now seen corresponding path program 1 times [2022-01-10 00:50:46,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:46,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17017478] [2022-01-10 00:50:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:46,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:47,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:47,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:47,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:47,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17017478] [2022-01-10 00:50:47,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17017478] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:47,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025759483] [2022-01-10 00:50:47,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:47,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:47,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:47,212 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) [2022-01-10 00:50:47,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 00:50:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:47,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-10 00:50:47,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:47,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-01-10 00:50:47,892 INFO L353 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-01-10 00:50:47,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 12 [2022-01-10 00:50:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:47,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:48,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2022-01-10 00:50:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:48,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025759483] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:48,543 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:48,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 39 [2022-01-10 00:50:48,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844700709] [2022-01-10 00:50:48,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:48,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-10 00:50:48,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:48,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-10 00:50:48,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1366, Unknown=0, NotChecked=0, Total=1482 [2022-01-10 00:50:48,545 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 39 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 33 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:49,294 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-01-10 00:50:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 00:50:49,294 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 33 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 24 [2022-01-10 00:50:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:49,295 INFO L225 Difference]: With dead ends: 45 [2022-01-10 00:50:49,295 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 00:50:49,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=272, Invalid=2484, Unknown=0, NotChecked=0, Total=2756 [2022-01-10 00:50:49,297 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:49,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 155 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 210 Invalid, 0 Unknown, 5 Unchecked, 0.1s Time] [2022-01-10 00:50:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 00:50:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-01-10 00:50:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 00:50:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-10 00:50:49,305 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2022-01-10 00:50:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:49,306 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-10 00:50:49,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 33 states have internal predecessors, (52), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-10 00:50:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 00:50:49,307 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:49,307 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:49,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 00:50:49,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:49,528 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash 810157357, now seen corresponding path program 1 times [2022-01-10 00:50:49,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:49,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654824669] [2022-01-10 00:50:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:49,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:49,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 00:50:49,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:49,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654824669] [2022-01-10 00:50:49,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654824669] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:49,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446470386] [2022-01-10 00:50:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:49,597 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:49,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:49,600 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) [2022-01-10 00:50:49,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 00:50:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:49,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 00:50:49,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 00:50:49,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 00:50:50,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446470386] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:50,091 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:50,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-01-10 00:50:50,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223782076] [2022-01-10 00:50:50,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:50,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-10 00:50:50,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:50,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-10 00:50:50,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2022-01-10 00:50:50,094 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 30 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 22 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:50,360 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-01-10 00:50:50,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 00:50:50,361 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 22 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2022-01-10 00:50:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:50,362 INFO L225 Difference]: With dead ends: 56 [2022-01-10 00:50:50,362 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 00:50:50,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=1233, Unknown=0, NotChecked=0, Total=1406 [2022-01-10 00:50:50,364 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:50,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 236 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 00:50:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 00:50:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2022-01-10 00:50:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 00:50:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-01-10 00:50:50,372 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 26 [2022-01-10 00:50:50,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:50,372 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-01-10 00:50:50,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 22 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-01-10 00:50:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 00:50:50,373 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:50,373 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:50,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 00:50:50,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:50,593 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:50,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1029012075, now seen corresponding path program 1 times [2022-01-10 00:50:50,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:50,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211004942] [2022-01-10 00:50:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:50,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:51,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:51,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:51,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:51,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211004942] [2022-01-10 00:50:51,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211004942] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:51,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295521030] [2022-01-10 00:50:51,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:51,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:51,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:51,631 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) [2022-01-10 00:50:51,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 00:50:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:51,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-10 00:50:51,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:52,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-01-10 00:50:52,351 INFO L353 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-01-10 00:50:52,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 12 [2022-01-10 00:50:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:52,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:52,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2022-01-10 00:50:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:52,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295521030] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:52,905 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:52,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2022-01-10 00:50:52,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965432370] [2022-01-10 00:50:52,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:52,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-10 00:50:52,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:52,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-10 00:50:52,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1512, Unknown=0, NotChecked=0, Total=1640 [2022-01-10 00:50:52,908 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 41 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 35 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:54,358 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-01-10 00:50:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-10 00:50:54,359 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 35 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2022-01-10 00:50:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:54,359 INFO L225 Difference]: With dead ends: 47 [2022-01-10 00:50:54,360 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 00:50:54,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=521, Invalid=3639, Unknown=0, NotChecked=0, Total=4160 [2022-01-10 00:50:54,361 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 66 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:54,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 345 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 419 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2022-01-10 00:50:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 00:50:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-01-10 00:50:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 00:50:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-01-10 00:50:54,371 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 26 [2022-01-10 00:50:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:54,371 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-01-10 00:50:54,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 35 states have internal predecessors, (55), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:50:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-01-10 00:50:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 00:50:54,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:54,372 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:54,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 00:50:54,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:54,587 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:54,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:54,588 INFO L85 PathProgramCache]: Analyzing trace with hash 381115444, now seen corresponding path program 2 times [2022-01-10 00:50:54,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:54,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423131039] [2022-01-10 00:50:54,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:54,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:55,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:55,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:55,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:55,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423131039] [2022-01-10 00:50:55,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423131039] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:55,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936466744] [2022-01-10 00:50:55,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:50:55,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:55,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:55,448 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) [2022-01-10 00:50:55,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 00:50:55,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:50:55,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:50:55,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-10 00:50:55,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:55,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-01-10 00:50:55,892 INFO L353 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-01-10 00:50:55,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 12 [2022-01-10 00:50:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:55,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:56,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936466744] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:56,084 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:56,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 29 [2022-01-10 00:50:56,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589234087] [2022-01-10 00:50:56,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:56,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-10 00:50:56,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:56,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-10 00:50:56,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-01-10 00:50:56,086 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 00:50:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:57,159 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-01-10 00:50:57,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-10 00:50:57,160 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-01-10 00:50:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:57,160 INFO L225 Difference]: With dead ends: 59 [2022-01-10 00:50:57,160 INFO L226 Difference]: Without dead ends: 54 [2022-01-10 00:50:57,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=414, Invalid=2342, Unknown=0, NotChecked=0, Total=2756 [2022-01-10 00:50:57,162 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:57,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 132 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 262 Invalid, 0 Unknown, 8 Unchecked, 0.2s Time] [2022-01-10 00:50:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-10 00:50:57,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2022-01-10 00:50:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.0625) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 00:50:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-01-10 00:50:57,173 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 28 [2022-01-10 00:50:57,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:57,173 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-01-10 00:50:57,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 27 states have internal predecessors, (50), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 00:50:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-01-10 00:50:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 00:50:57,174 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:57,174 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:57,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 00:50:57,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:57,388 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:57,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:57,388 INFO L85 PathProgramCache]: Analyzing trace with hash -250699064, now seen corresponding path program 3 times [2022-01-10 00:50:57,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:57,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681897977] [2022-01-10 00:50:57,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:57,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:58,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:58,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:50:58,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:58,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681897977] [2022-01-10 00:50:58,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681897977] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:58,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470115160] [2022-01-10 00:50:58,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 00:50:58,907 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:58,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:58,920 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) [2022-01-10 00:50:58,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 00:50:59,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 00:50:59,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:50:59,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-10 00:50:59,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:59,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-01-10 00:50:59,516 INFO L353 Elim1Store]: treesize reduction 68, result has 9.3 percent of original size [2022-01-10 00:50:59,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 43 [2022-01-10 00:50:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 00:50:59,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 00:51:02,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470115160] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:51:02,059 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:51:02,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9, 9] total 33 [2022-01-10 00:51:02,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814024519] [2022-01-10 00:51:02,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:51:02,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-10 00:51:02,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:02,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-10 00:51:02,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=974, Unknown=1, NotChecked=0, Total=1056 [2022-01-10 00:51:02,061 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 33 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 00:51:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:04,174 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-01-10 00:51:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-10 00:51:04,174 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2022-01-10 00:51:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:04,175 INFO L225 Difference]: With dead ends: 59 [2022-01-10 00:51:04,175 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 00:51:04,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=493, Invalid=2928, Unknown=1, NotChecked=0, Total=3422 [2022-01-10 00:51:04,176 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:04,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 134 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 231 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2022-01-10 00:51:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 00:51:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 00:51:04,177 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) [2022-01-10 00:51:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 00:51:04,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-01-10 00:51:04,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:04,177 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 00:51:04,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 00:51:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 00:51:04,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 00:51:04,180 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 00:51:04,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-10 00:51:04,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:04,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 00:51:05,996 INFO L858 garLoopResultBuilder]: For program point get_dummyFINAL(lines 23 26) no Hoare annotation was computed. [2022-01-10 00:51:05,997 INFO L858 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-01-10 00:51:05,997 INFO L861 garLoopResultBuilder]: At program point get_dummyENTRY(lines 23 26) the Hoare annotation is: true [2022-01-10 00:51:05,997 INFO L858 garLoopResultBuilder]: For program point get_dummyEXIT(lines 23 26) no Hoare annotation was computed. [2022-01-10 00:51:05,997 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 00:51:05,997 INFO L854 garLoopResultBuilder]: At program point L46(lines 34 54) the Hoare annotation is: false [2022-01-10 00:51:05,997 INFO L858 garLoopResultBuilder]: For program point L42-1(lines 42 44) no Hoare annotation was computed. [2022-01-10 00:51:05,997 INFO L854 garLoopResultBuilder]: At program point L42-3(lines 42 44) the Hoare annotation is: (and (<= 0 |~#d2~0.offset|) (= 5 |~#d2~0.base|) (<= |~#d2~0.offset| 0) (= 0 (mod (+ (* 3 |ULTIMATE.start_main_~pd2~0#1.offset|) |ULTIMATE.start_main_~pa~0#1.offset|) 4)) (or (and (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|)) (not (<= |ULTIMATE.start_main_~pd2~0#1.offset| |ULTIMATE.start_main_~pd1~0#1.offset|))) (<= |~#d1~0.base| 4) (< |ULTIMATE.start_main_~i~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~pa~0#1.base|) |ULTIMATE.start_main_~pa~0#1.offset|) 1)) (let ((.cse0 (div (+ (* (- 1) |ULTIMATE.start_main_~pd2~0#1.offset|) |ULTIMATE.start_main_~pa~0#1.offset| (- 8)) 4))) (= .cse0 (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) (+ (* .cse0 4) 8 |ULTIMATE.start_main_~pd2~0#1.offset|)))) (= |~#d1~0.offset| 0) (= |ULTIMATE.start_main_~pa~0#1.base| |ULTIMATE.start_main_~pd2~0#1.base|)) [2022-01-10 00:51:05,997 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 48) no Hoare annotation was computed. [2022-01-10 00:51:05,997 INFO L858 garLoopResultBuilder]: For program point L42-4(lines 42 44) no Hoare annotation was computed. [2022-01-10 00:51:05,998 INFO L854 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |~#d1~0.base|))) (let ((.cse0 (select .cse1 (+ 44 |~#d1~0.offset|)))) (and (= |~#d1~0.base| 4) (= 5 |~#d2~0.base|) (= .cse0 (select .cse1 (+ 32 |~#d1~0.offset|))) (<= |~#d1~0.offset| (* |~#d2~0.offset| 4)) (< |~#d2~0.offset| (+ |~#d1~0.offset| 1)) (= (select .cse1 (+ |~#d1~0.offset| 8)) 0) (= .cse0 0) (= |~#d1~0.offset| 0)))) [2022-01-10 00:51:05,998 INFO L858 garLoopResultBuilder]: For program point L38-2(lines 38 48) no Hoare annotation was computed. [2022-01-10 00:51:05,998 INFO L858 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2022-01-10 00:51:05,998 INFO L854 garLoopResultBuilder]: At program point L36-2(line 36) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |~#d1~0.base|))) (let ((.cse8 (select .cse9 (+ 44 |~#d1~0.offset|)))) (let ((.cse0 (= |~#d1~0.base| 4)) (.cse1 (= 5 |~#d2~0.base|)) (.cse2 (= .cse8 (select .cse9 (+ 32 |~#d1~0.offset|)))) (.cse4 (= (select .cse9 (+ |~#d1~0.offset| 8)) 0)) (.cse5 (= .cse8 0)) (.cse6 (= |~#d1~0.offset| 0)) (.cse3 (* |~#d2~0.offset| 4)) (.cse7 (= |ULTIMATE.start_main_~pd1~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (<= |~#d1~0.offset| .cse3) (< |~#d2~0.offset| (+ |~#d1~0.offset| 1)) (= |~#d1~0.base| |ULTIMATE.start_main_~pd1~0#1.base|) .cse4 .cse5 .cse6 .cse7) (and (= |~#d2~0.base| |ULTIMATE.start_main_~pd1~0#1.base|) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (= .cse3 0) .cse7))))) [2022-01-10 00:51:05,998 INFO L858 garLoopResultBuilder]: For program point L36-3(line 36) no Hoare annotation was computed. [2022-01-10 00:51:05,998 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 00:51:05,998 INFO L854 garLoopResultBuilder]: At program point L30(lines 28 31) the Hoare annotation is: (and (= |~#d2~0.offset| 0) (<= 1 |ULTIMATE.start_check_#res#1|) (= 5 |~#d2~0.base|) (or (and (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|)) (not (<= |ULTIMATE.start_main_~pd2~0#1.offset| |ULTIMATE.start_main_~pd1~0#1.offset|))) (<= |~#d1~0.base| 4) (<= |~#d1~0.offset| (* |~#d2~0.offset| 4)) (<= 0 |~#d1~0.offset|)) [2022-01-10 00:51:05,998 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 00:51:05,998 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 00:51:05,998 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2022-01-10 00:51:05,998 INFO L861 garLoopResultBuilder]: At program point L53(lines 33 54) the Hoare annotation is: true [2022-01-10 00:51:05,998 INFO L858 garLoopResultBuilder]: For program point L14(lines 14 21) no Hoare annotation was computed. [2022-01-10 00:51:05,999 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 47) no Hoare annotation was computed. [2022-01-10 00:51:06,001 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:06,002 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 00:51:06,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:51:06 BoogieIcfgContainer [2022-01-10 00:51:06,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 00:51:06,016 INFO L158 Benchmark]: Toolchain (without parser) took 24635.18ms. Allocated memory was 175.1MB in the beginning and 364.9MB in the end (delta: 189.8MB). Free memory was 117.9MB in the beginning and 162.5MB in the end (delta: -44.6MB). Peak memory consumption was 193.2MB. Max. memory is 8.0GB. [2022-01-10 00:51:06,016 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:51:06,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.28ms. Allocated memory was 175.1MB in the beginning and 252.7MB in the end (delta: 77.6MB). Free memory was 117.8MB in the beginning and 225.7MB in the end (delta: -108.0MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-01-10 00:51:06,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.06ms. Allocated memory is still 252.7MB. Free memory was 225.7MB in the beginning and 223.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 00:51:06,017 INFO L158 Benchmark]: Boogie Preprocessor took 20.41ms. Allocated memory is still 252.7MB. Free memory was 223.7MB in the beginning and 222.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 00:51:06,018 INFO L158 Benchmark]: RCFGBuilder took 276.66ms. Allocated memory is still 252.7MB. Free memory was 222.6MB in the beginning and 210.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 00:51:06,018 INFO L158 Benchmark]: TraceAbstraction took 24061.78ms. Allocated memory was 252.7MB in the beginning and 364.9MB in the end (delta: 112.2MB). Free memory was 209.5MB in the beginning and 162.5MB in the end (delta: 47.0MB). Peak memory consumption was 207.6MB. Max. memory is 8.0GB. [2022-01-10 00:51:06,019 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.28ms. Allocated memory was 175.1MB in the beginning and 252.7MB in the end (delta: 77.6MB). Free memory was 117.8MB in the beginning and 225.7MB in the end (delta: -108.0MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.06ms. Allocated memory is still 252.7MB. Free memory was 225.7MB in the beginning and 223.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.41ms. Allocated memory is still 252.7MB. Free memory was 223.7MB in the beginning and 222.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 276.66ms. Allocated memory is still 252.7MB. Free memory was 222.6MB in the beginning and 210.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 24061.78ms. Allocated memory was 252.7MB in the beginning and 364.9MB in the end (delta: 112.2MB). Free memory was 209.5MB in the beginning and 162.5MB in the end (delta: 47.0MB). Peak memory consumption was 207.6MB. Max. memory is 8.0GB. * 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: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.0s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 1659 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 146 IncrementalHoareTripleChecker+Unchecked, 1496 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1945 IncrementalHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 163 mSDtfsCounter, 1945 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 580 GetRequests, 241 SyntacticMatches, 9 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2642 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=8, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 68 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 28 NumberOfFragments, 278 HoareAnnotationTreeSize, 9 FomulaSimplifications, 480 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 27170 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 389 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 530 ConstructedInterpolants, 31 QuantifiedInterpolants, 5499 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1404 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 149/330 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: 28]: Loop Invariant Derived loop invariant: (((((d2 == 0 && 1 <= \result) && 5 == d2) && ((pd1 == pd2 && pd2 == pd1) || !(pd2 <= pd1))) && d1 <= 4) && d1 <= d2 * 4) && 0 <= d1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((0 <= d2 && 5 == d2) && d2 <= 0) && 0 == (3 * pd2 + pa) % 4) && ((pd1 == pd2 && pd2 == pd1) || !(pd2 <= pd1))) && d1 <= 4) && i < unknown-#memory_int-unknown[pa][pa] + 1) && (-1 * pd2 + pa + -8) / 4 == unknown-#memory_int-unknown[pd2][(-1 * pd2 + pa + -8) / 4 * 4 + 8 + pd2]) && d1 == 0) && pa == pd2 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 00:51:06,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...