/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/eca-rers2012/Problem14_label23.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:13:42,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:13:42,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:13:42,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:13:42,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:13:42,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:13:42,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:13:42,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:13:42,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:13:42,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:13:42,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:13:42,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:13:42,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:13:42,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:13:42,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:13:42,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:13:42,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:13:42,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:13:42,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:13:42,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:13:42,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:13:42,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:13:42,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:13:42,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:13:42,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:13:42,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:13:42,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:13:42,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:13:42,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:13:42,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:13:42,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:13:42,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:13:42,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:13:42,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:13:42,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:13:42,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:13:42,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:13:42,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:13:42,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:13:42,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:13:42,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:13:42,418 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:13:42,432 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:13:42,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:13:42,432 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:13:42,433 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:13:42,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:13:42,433 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:13:42,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:13:42,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:13:42,434 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:13:42,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:13:42,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:13:42,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:13:42,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:13:42,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:13:42,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:13:42,435 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:13:42,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:13:42,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:13:42,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:13:42,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:13:42,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:13:42,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:13:42,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:13:42,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:13:42,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:13:42,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:13:42,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:13:42,436 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:13:42,437 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:13:42,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:13:42,437 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:13:42,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:13:42,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:13:42,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:13:42,615 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:13:42,616 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:13:42,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label23.c [2022-01-10 00:13:42,673 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c52a928bf/996b556e15c947db80a264b3d8c639df/FLAGe77058b74 [2022-01-10 00:13:43,075 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:13:43,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label23.c [2022-01-10 00:13:43,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c52a928bf/996b556e15c947db80a264b3d8c639df/FLAGe77058b74 [2022-01-10 00:13:43,414 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c52a928bf/996b556e15c947db80a264b3d8c639df [2022-01-10 00:13:43,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:13:43,417 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:13:43,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:13:43,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:13:43,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:13:43,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:13:43" (1/1) ... [2022-01-10 00:13:43,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1082bbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:13:43, skipping insertion in model container [2022-01-10 00:13:43,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:13:43" (1/1) ... [2022-01-10 00:13:43,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:13:43,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:13:43,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label23.c[3423,3436] [2022-01-10 00:13:43,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:13:43,851 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:13:43,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label23.c[3423,3436] [2022-01-10 00:13:43,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:13:43,958 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:13:43,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:13:43 WrapperNode [2022-01-10 00:13:43,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:13:43,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:13:43,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:13:43,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:13:43,967 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:13:43" (1/1) ... [2022-01-10 00:13:43,992 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:13:43" (1/1) ... [2022-01-10 00:13:44,043 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 858 [2022-01-10 00:13:44,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:13:44,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:13:44,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:13:44,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:13:44,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:13:43" (1/1) ... [2022-01-10 00:13:44,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:13:43" (1/1) ... [2022-01-10 00:13:44,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:13:43" (1/1) ... [2022-01-10 00:13:44,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:13:43" (1/1) ... [2022-01-10 00:13:44,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:13:43" (1/1) ... [2022-01-10 00:13:44,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:13:43" (1/1) ... [2022-01-10 00:13:44,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:13:43" (1/1) ... [2022-01-10 00:13:44,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:13:44,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:13:44,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:13:44,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:13:44,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:13:43" (1/1) ... [2022-01-10 00:13:44,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:13:44,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:13:44,201 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:13:44,231 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:13:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:13:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:13:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:13:44,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:13:44,313 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:13:44,315 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:13:45,215 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:13:45,224 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:13:45,225 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:13:45,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:13:45 BoogieIcfgContainer [2022-01-10 00:13:45,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:13:45,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:13:45,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:13:45,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:13:45,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:13:43" (1/3) ... [2022-01-10 00:13:45,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fde8091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:13:45, skipping insertion in model container [2022-01-10 00:13:45,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:13:43" (2/3) ... [2022-01-10 00:13:45,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fde8091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:13:45, skipping insertion in model container [2022-01-10 00:13:45,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:13:45" (3/3) ... [2022-01-10 00:13:45,234 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label23.c [2022-01-10 00:13:45,238 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:13:45,238 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:13:45,283 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:13:45,289 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:13:45,290 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:13:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 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:13:45,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 00:13:45,320 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:45,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:45,321 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:45,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:45,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2022-01-10 00:13:45,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:45,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004268065] [2022-01-10 00:13:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:45,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:13:45,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:45,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004268065] [2022-01-10 00:13:45,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004268065] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:45,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:45,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:13:45,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300685565] [2022-01-10 00:13:45,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:45,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:45,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:45,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:45,565 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 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) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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:13:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:46,364 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2022-01-10 00:13:46,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:46,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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) Word has length 32 [2022-01-10 00:13:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:46,374 INFO L225 Difference]: With dead ends: 669 [2022-01-10 00:13:46,374 INFO L226 Difference]: Without dead ends: 360 [2022-01-10 00:13:46,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:46,383 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:46,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 94 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 00:13:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-01-10 00:13:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2022-01-10 00:13:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.5208913649025069) internal successors, (546), 359 states have internal predecessors, (546), 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:13:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2022-01-10 00:13:46,419 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 32 [2022-01-10 00:13:46,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:46,420 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2022-01-10 00:13:46,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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:13:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2022-01-10 00:13:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 00:13:46,423 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:46,423 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:46,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:13:46,423 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1737883567, now seen corresponding path program 1 times [2022-01-10 00:13:46,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:46,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300933188] [2022-01-10 00:13:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:46,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:13:46,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:46,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300933188] [2022-01-10 00:13:46,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300933188] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:46,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:46,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:13:46,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146142175] [2022-01-10 00:13:46,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:46,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:46,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:46,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:46,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:46,534 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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:13:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:47,132 INFO L93 Difference]: Finished difference Result 1076 states and 1634 transitions. [2022-01-10 00:13:47,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:47,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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) Word has length 107 [2022-01-10 00:13:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:47,136 INFO L225 Difference]: With dead ends: 1076 [2022-01-10 00:13:47,136 INFO L226 Difference]: Without dead ends: 718 [2022-01-10 00:13:47,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:47,138 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 124 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:47,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 96 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:13:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-01-10 00:13:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 716. [2022-01-10 00:13:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.3552447552447553) internal successors, (969), 715 states have internal predecessors, (969), 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:13:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 969 transitions. [2022-01-10 00:13:47,158 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 969 transitions. Word has length 107 [2022-01-10 00:13:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:47,159 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 969 transitions. [2022-01-10 00:13:47,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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:13:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 969 transitions. [2022-01-10 00:13:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 00:13:47,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:47,160 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:47,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:13:47,161 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1430044837, now seen corresponding path program 1 times [2022-01-10 00:13:47,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:47,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977148493] [2022-01-10 00:13:47,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:47,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:47,293 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:13:47,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:47,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977148493] [2022-01-10 00:13:47,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977148493] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:47,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:47,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:13:47,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77561325] [2022-01-10 00:13:47,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:47,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:13:47,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:47,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:13:47,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:13:47,302 INFO L87 Difference]: Start difference. First operand 716 states and 969 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 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:13:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:48,042 INFO L93 Difference]: Finished difference Result 1966 states and 2575 transitions. [2022-01-10 00:13:48,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:13:48,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 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) Word has length 111 [2022-01-10 00:13:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:48,046 INFO L225 Difference]: With dead ends: 1966 [2022-01-10 00:13:48,047 INFO L226 Difference]: Without dead ends: 1252 [2022-01-10 00:13:48,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:13:48,048 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 420 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:48,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [420 Valid, 123 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 00:13:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-01-10 00:13:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1250. [2022-01-10 00:13:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.2377902321857486) internal successors, (1546), 1249 states have internal predecessors, (1546), 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:13:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1546 transitions. [2022-01-10 00:13:48,082 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1546 transitions. Word has length 111 [2022-01-10 00:13:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:48,082 INFO L470 AbstractCegarLoop]: Abstraction has 1250 states and 1546 transitions. [2022-01-10 00:13:48,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 3 states have internal predecessors, (111), 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:13:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1546 transitions. [2022-01-10 00:13:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-01-10 00:13:48,085 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:48,085 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:48,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:13:48,085 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:48,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:48,086 INFO L85 PathProgramCache]: Analyzing trace with hash 872689753, now seen corresponding path program 1 times [2022-01-10 00:13:48,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:48,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604104201] [2022-01-10 00:13:48,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:48,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:13:48,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:48,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604104201] [2022-01-10 00:13:48,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604104201] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:48,194 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:48,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:13:48,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96607841] [2022-01-10 00:13:48,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:48,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:13:48,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:48,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:13:48,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:13:48,195 INFO L87 Difference]: Start difference. First operand 1250 states and 1546 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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:13:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:48,743 INFO L93 Difference]: Finished difference Result 2707 states and 3359 transitions. [2022-01-10 00:13:48,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:13:48,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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) Word has length 191 [2022-01-10 00:13:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:48,748 INFO L225 Difference]: With dead ends: 2707 [2022-01-10 00:13:48,749 INFO L226 Difference]: Without dead ends: 1608 [2022-01-10 00:13:48,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:13:48,750 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 120 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:48,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 121 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:13:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2022-01-10 00:13:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1606. [2022-01-10 00:13:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.12398753894081) internal successors, (1804), 1605 states have internal predecessors, (1804), 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:13:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1804 transitions. [2022-01-10 00:13:48,772 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1804 transitions. Word has length 191 [2022-01-10 00:13:48,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:48,772 INFO L470 AbstractCegarLoop]: Abstraction has 1606 states and 1804 transitions. [2022-01-10 00:13:48,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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:13:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1804 transitions. [2022-01-10 00:13:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2022-01-10 00:13:48,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:48,775 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:48,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:13:48,775 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:48,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash -925926840, now seen corresponding path program 1 times [2022-01-10 00:13:48,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:48,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539425421] [2022-01-10 00:13:48,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:48,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 137 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-10 00:13:48,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:48,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539425421] [2022-01-10 00:13:48,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539425421] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:13:48,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206838043] [2022-01-10 00:13:48,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:48,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:48,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:13:48,903 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:13:48,907 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:13:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:49,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:13:49,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:13:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-01-10 00:13:49,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:13:49,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206838043] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:49,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:13:49,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-01-10 00:13:49,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143855984] [2022-01-10 00:13:49,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:49,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:49,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:49,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:49,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:13:49,610 INFO L87 Difference]: Start difference. First operand 1606 states and 1804 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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:13:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:49,948 INFO L93 Difference]: Finished difference Result 3388 states and 3907 transitions. [2022-01-10 00:13:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:49,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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) Word has length 318 [2022-01-10 00:13:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:49,953 INFO L225 Difference]: With dead ends: 3388 [2022-01-10 00:13:49,953 INFO L226 Difference]: Without dead ends: 1962 [2022-01-10 00:13:49,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:13:49,955 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:49,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 00:13:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2022-01-10 00:13:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2022-01-10 00:13:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.122386537480877) internal successors, (2201), 1961 states have internal predecessors, (2201), 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:13:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2201 transitions. [2022-01-10 00:13:49,983 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2201 transitions. Word has length 318 [2022-01-10 00:13:49,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:49,983 INFO L470 AbstractCegarLoop]: Abstraction has 1962 states and 2201 transitions. [2022-01-10 00:13:49,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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:13:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2201 transitions. [2022-01-10 00:13:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-01-10 00:13:49,986 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:49,986 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:50,010 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:13:50,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:50,201 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:50,202 INFO L85 PathProgramCache]: Analyzing trace with hash 831866558, now seen corresponding path program 1 times [2022-01-10 00:13:50,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:50,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190450445] [2022-01-10 00:13:50,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:50,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-01-10 00:13:50,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:50,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190450445] [2022-01-10 00:13:50,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190450445] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:50,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:50,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:13:50,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563449821] [2022-01-10 00:13:50,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:50,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:50,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:50,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:50,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:50,319 INFO L87 Difference]: Start difference. First operand 1962 states and 2201 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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:13:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:50,727 INFO L93 Difference]: Finished difference Result 4100 states and 4648 transitions. [2022-01-10 00:13:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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) Word has length 322 [2022-01-10 00:13:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:50,733 INFO L225 Difference]: With dead ends: 4100 [2022-01-10 00:13:50,733 INFO L226 Difference]: Without dead ends: 2318 [2022-01-10 00:13:50,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:50,739 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 101 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:50,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 77 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:13:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-01-10 00:13:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2022-01-10 00:13:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.1204143288735433) internal successors, (2596), 2317 states have internal predecessors, (2596), 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:13:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2596 transitions. [2022-01-10 00:13:50,773 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2596 transitions. Word has length 322 [2022-01-10 00:13:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:50,773 INFO L470 AbstractCegarLoop]: Abstraction has 2318 states and 2596 transitions. [2022-01-10 00:13:50,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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:13:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2596 transitions. [2022-01-10 00:13:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2022-01-10 00:13:50,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:50,777 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2022-01-10 00:13:50,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:13:50,777 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:50,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash -376217468, now seen corresponding path program 1 times [2022-01-10 00:13:50,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:50,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899962766] [2022-01-10 00:13:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:50,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-01-10 00:13:50,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:50,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899962766] [2022-01-10 00:13:50,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899962766] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:13:50,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116526574] [2022-01-10 00:13:50,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:50,936 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:50,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:13:50,940 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:13:50,941 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:13:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:51,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:13:51,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:13:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2022-01-10 00:13:51,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:13:51,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116526574] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:51,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:13:51,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-01-10 00:13:51,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995858920] [2022-01-10 00:13:51,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:51,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:51,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:51,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:51,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:13:51,575 INFO L87 Difference]: Start difference. First operand 2318 states and 2596 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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:13:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:51,958 INFO L93 Difference]: Finished difference Result 2854 states and 3202 transitions. [2022-01-10 00:13:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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) Word has length 349 [2022-01-10 00:13:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:51,965 INFO L225 Difference]: With dead ends: 2854 [2022-01-10 00:13:51,965 INFO L226 Difference]: Without dead ends: 2852 [2022-01-10 00:13:51,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:13:51,966 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 90 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:51,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 24 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:13:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2022-01-10 00:13:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2496. [2022-01-10 00:13:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.1254509018036072) internal successors, (2808), 2495 states have internal predecessors, (2808), 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:13:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2808 transitions. [2022-01-10 00:13:52,001 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2808 transitions. Word has length 349 [2022-01-10 00:13:52,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:52,002 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 2808 transitions. [2022-01-10 00:13:52,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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:13:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2808 transitions. [2022-01-10 00:13:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2022-01-10 00:13:52,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:52,005 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:52,025 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:13:52,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-01-10 00:13:52,212 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash 255466610, now seen corresponding path program 1 times [2022-01-10 00:13:52,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:52,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729039796] [2022-01-10 00:13:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:52,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-01-10 00:13:52,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:52,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729039796] [2022-01-10 00:13:52,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729039796] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:52,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:52,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:13:52,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608732858] [2022-01-10 00:13:52,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:52,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:13:52,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:52,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:13:52,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:13:52,317 INFO L87 Difference]: Start difference. First operand 2496 states and 2808 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 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:13:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:52,767 INFO L93 Difference]: Finished difference Result 5048 states and 5689 transitions. [2022-01-10 00:13:52,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:13:52,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 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) Word has length 402 [2022-01-10 00:13:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:52,774 INFO L225 Difference]: With dead ends: 5048 [2022-01-10 00:13:52,774 INFO L226 Difference]: Without dead ends: 2674 [2022-01-10 00:13:52,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:13:52,777 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:52,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 17 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:13:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2022-01-10 00:13:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2496. [2022-01-10 00:13:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.0849699398797594) internal successors, (2707), 2495 states have internal predecessors, (2707), 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:13:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2707 transitions. [2022-01-10 00:13:52,810 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2707 transitions. Word has length 402 [2022-01-10 00:13:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:52,810 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 2707 transitions. [2022-01-10 00:13:52,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 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:13:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2707 transitions. [2022-01-10 00:13:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2022-01-10 00:13:52,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:52,815 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:52,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 00:13:52,815 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:52,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash 371450483, now seen corresponding path program 2 times [2022-01-10 00:13:52,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:52,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740914908] [2022-01-10 00:13:52,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:52,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 369 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-01-10 00:13:52,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:52,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740914908] [2022-01-10 00:13:52,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740914908] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:13:52,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949258822] [2022-01-10 00:13:52,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:13:52,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:52,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:13:52,962 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:13:52,963 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:13:53,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:13:53,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:13:53,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 00:13:53,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:13:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2022-01-10 00:13:53,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:13:53,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949258822] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:53,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:13:53,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-01-10 00:13:53,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339612377] [2022-01-10 00:13:53,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:53,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:13:53,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:53,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:13:53,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:13:53,823 INFO L87 Difference]: Start difference. First operand 2496 states and 2707 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 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:13:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:54,377 INFO L93 Difference]: Finished difference Result 5524 states and 6045 transitions. [2022-01-10 00:13:54,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:13:54,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 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) Word has length 428 [2022-01-10 00:13:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:54,385 INFO L225 Difference]: With dead ends: 5524 [2022-01-10 00:13:54,386 INFO L226 Difference]: Without dead ends: 3208 [2022-01-10 00:13:54,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:13:54,389 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 191 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:54,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 15 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:13:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2022-01-10 00:13:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2852. [2022-01-10 00:13:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.0771659066994037) internal successors, (3071), 2851 states have internal predecessors, (3071), 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:13:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3071 transitions. [2022-01-10 00:13:54,427 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3071 transitions. Word has length 428 [2022-01-10 00:13:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:54,428 INFO L470 AbstractCegarLoop]: Abstraction has 2852 states and 3071 transitions. [2022-01-10 00:13:54,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 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:13:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3071 transitions. [2022-01-10 00:13:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2022-01-10 00:13:54,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:54,432 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:54,452 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:13:54,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:54,650 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:54,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash -628974162, now seen corresponding path program 1 times [2022-01-10 00:13:54,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:54,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033612563] [2022-01-10 00:13:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:54,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2022-01-10 00:13:54,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:54,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033612563] [2022-01-10 00:13:54,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033612563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:54,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:54,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:13:54,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348214786] [2022-01-10 00:13:54,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:54,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:54,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:54,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:54,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:54,747 INFO L87 Difference]: Start difference. First operand 2852 states and 3071 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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:13:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:55,125 INFO L93 Difference]: Finished difference Result 6058 states and 6601 transitions. [2022-01-10 00:13:55,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:55,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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) Word has length 435 [2022-01-10 00:13:55,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:55,135 INFO L225 Difference]: With dead ends: 6058 [2022-01-10 00:13:55,136 INFO L226 Difference]: Without dead ends: 3386 [2022-01-10 00:13:55,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:55,139 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 103 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:55,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 220 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 00:13:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2022-01-10 00:13:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3208. [2022-01-10 00:13:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.079513564078578) internal successors, (3462), 3207 states have internal predecessors, (3462), 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:13:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3462 transitions. [2022-01-10 00:13:55,180 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3462 transitions. Word has length 435 [2022-01-10 00:13:55,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:55,191 INFO L470 AbstractCegarLoop]: Abstraction has 3208 states and 3462 transitions. [2022-01-10 00:13:55,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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:13:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3462 transitions. [2022-01-10 00:13:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2022-01-10 00:13:55,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:55,197 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:55,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 00:13:55,197 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:55,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1105193589, now seen corresponding path program 1 times [2022-01-10 00:13:55,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:55,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105441074] [2022-01-10 00:13:55,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:55,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 369 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-01-10 00:13:55,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:55,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105441074] [2022-01-10 00:13:55,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105441074] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:13:55,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567959560] [2022-01-10 00:13:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:55,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:55,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:13:55,340 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:13:55,341 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:13:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:55,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 00:13:55,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:13:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-01-10 00:13:56,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:13:56,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567959560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:56,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:13:56,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-01-10 00:13:56,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723510929] [2022-01-10 00:13:56,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:56,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:56,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:56,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:56,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:13:56,129 INFO L87 Difference]: Start difference. First operand 3208 states and 3462 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 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:13:56,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:56,518 INFO L93 Difference]: Finished difference Result 6592 states and 7125 transitions. [2022-01-10 00:13:56,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:56,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 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) Word has length 480 [2022-01-10 00:13:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:56,532 INFO L225 Difference]: With dead ends: 6592 [2022-01-10 00:13:56,532 INFO L226 Difference]: Without dead ends: 3742 [2022-01-10 00:13:56,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:13:56,535 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:56,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 50 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 00:13:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2022-01-10 00:13:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3386. [2022-01-10 00:13:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.076218611521418) internal successors, (3643), 3385 states have internal predecessors, (3643), 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:13:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3643 transitions. [2022-01-10 00:13:56,586 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3643 transitions. Word has length 480 [2022-01-10 00:13:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:56,586 INFO L470 AbstractCegarLoop]: Abstraction has 3386 states and 3643 transitions. [2022-01-10 00:13:56,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 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:13:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3643 transitions. [2022-01-10 00:13:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-01-10 00:13:56,589 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:56,590 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:56,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 00:13:56,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:56,807 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:56,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1647363477, now seen corresponding path program 1 times [2022-01-10 00:13:56,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:56,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974915159] [2022-01-10 00:13:56,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:56,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 630 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2022-01-10 00:13:56,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:56,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974915159] [2022-01-10 00:13:56,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974915159] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:56,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:56,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:13:56,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040730770] [2022-01-10 00:13:56,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:56,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:56,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:56,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:56,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:56,919 INFO L87 Difference]: Start difference. First operand 3386 states and 3643 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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:13:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:57,237 INFO L93 Difference]: Finished difference Result 6592 states and 7105 transitions. [2022-01-10 00:13:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:57,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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) Word has length 497 [2022-01-10 00:13:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:57,245 INFO L225 Difference]: With dead ends: 6592 [2022-01-10 00:13:57,245 INFO L226 Difference]: Without dead ends: 3386 [2022-01-10 00:13:57,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:57,248 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:57,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 244 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 00:13:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2022-01-10 00:13:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 2674. [2022-01-10 00:13:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.08791619902731) internal successors, (2908), 2673 states have internal predecessors, (2908), 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:13:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2908 transitions. [2022-01-10 00:13:57,303 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2908 transitions. Word has length 497 [2022-01-10 00:13:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:57,304 INFO L470 AbstractCegarLoop]: Abstraction has 2674 states and 2908 transitions. [2022-01-10 00:13:57,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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:13:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2908 transitions. [2022-01-10 00:13:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2022-01-10 00:13:57,308 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:57,308 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:57,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 00:13:57,308 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:57,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1065417453, now seen corresponding path program 1 times [2022-01-10 00:13:57,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:57,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642464023] [2022-01-10 00:13:57,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:57,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 754 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2022-01-10 00:13:57,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:57,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642464023] [2022-01-10 00:13:57,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642464023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:57,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:57,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:13:57,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165805277] [2022-01-10 00:13:57,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:57,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:57,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:57,431 INFO L87 Difference]: Start difference. First operand 2674 states and 2908 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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:13:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:57,785 INFO L93 Difference]: Finished difference Result 6236 states and 6831 transitions. [2022-01-10 00:13:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:57,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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) Word has length 545 [2022-01-10 00:13:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:57,794 INFO L225 Difference]: With dead ends: 6236 [2022-01-10 00:13:57,794 INFO L226 Difference]: Without dead ends: 3742 [2022-01-10 00:13:57,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:57,797 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:57,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 00:13:57,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2022-01-10 00:13:57,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2022-01-10 00:13:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.0815290029403903) internal successors, (4046), 3741 states have internal predecessors, (4046), 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:13:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4046 transitions. [2022-01-10 00:13:57,832 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4046 transitions. Word has length 545 [2022-01-10 00:13:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:57,833 INFO L470 AbstractCegarLoop]: Abstraction has 3742 states and 4046 transitions. [2022-01-10 00:13:57,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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:13:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4046 transitions. [2022-01-10 00:13:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2022-01-10 00:13:57,836 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:57,836 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:57,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 00:13:57,837 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:57,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1511983654, now seen corresponding path program 1 times [2022-01-10 00:13:57,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:57,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121923926] [2022-01-10 00:13:57,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:57,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 967 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2022-01-10 00:13:57,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:57,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121923926] [2022-01-10 00:13:57,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121923926] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:57,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:13:57,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:13:57,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447376886] [2022-01-10 00:13:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:57,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:57,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:57,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:57,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:57,978 INFO L87 Difference]: Start difference. First operand 3742 states and 4046 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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:13:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:58,336 INFO L93 Difference]: Finished difference Result 7482 states and 8092 transitions. [2022-01-10 00:13:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:58,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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) Word has length 581 [2022-01-10 00:13:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:13:58,344 INFO L225 Difference]: With dead ends: 7482 [2022-01-10 00:13:58,344 INFO L226 Difference]: Without dead ends: 3920 [2022-01-10 00:13:58,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:13:58,347 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 102 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:13:58,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 243 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 00:13:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2022-01-10 00:13:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2022-01-10 00:13:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.0692328254477412) internal successors, (4000), 3741 states have internal predecessors, (4000), 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:13:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4000 transitions. [2022-01-10 00:13:58,383 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4000 transitions. Word has length 581 [2022-01-10 00:13:58,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:13:58,383 INFO L470 AbstractCegarLoop]: Abstraction has 3742 states and 4000 transitions. [2022-01-10 00:13:58,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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:13:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4000 transitions. [2022-01-10 00:13:58,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 769 [2022-01-10 00:13:58,389 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:13:58,390 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:13:58,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 00:13:58,390 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:13:58,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:13:58,390 INFO L85 PathProgramCache]: Analyzing trace with hash 979607870, now seen corresponding path program 1 times [2022-01-10 00:13:58,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:13:58,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631840576] [2022-01-10 00:13:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:58,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:13:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 1204 proven. 155 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2022-01-10 00:13:58,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:13:58,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631840576] [2022-01-10 00:13:58,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631840576] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:13:58,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987617805] [2022-01-10 00:13:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:13:58,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:13:58,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:13:58,588 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:13:58,589 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:13:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:13:58,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:13:58,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:13:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2022-01-10 00:13:59,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:13:59,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987617805] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:13:59,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:13:59,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 00:13:59,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084538558] [2022-01-10 00:13:59,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:13:59,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:13:59,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:13:59,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:13:59,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:13:59,608 INFO L87 Difference]: Start difference. First operand 3742 states and 4000 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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:13:59,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:13:59,996 INFO L93 Difference]: Finished difference Result 4990 states and 5307 transitions. [2022-01-10 00:13:59,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:13:59,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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) Word has length 768 [2022-01-10 00:13:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:14:00,003 INFO L225 Difference]: With dead ends: 4990 [2022-01-10 00:14:00,003 INFO L226 Difference]: Without dead ends: 4988 [2022-01-10 00:14:00,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 768 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:14:00,006 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 170 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:14:00,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 17 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:14:00,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2022-01-10 00:14:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 3920. [2022-01-10 00:14:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.0722122990558816) internal successors, (4202), 3919 states have internal predecessors, (4202), 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:14:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4202 transitions. [2022-01-10 00:14:00,052 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4202 transitions. Word has length 768 [2022-01-10 00:14:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:14:00,052 INFO L470 AbstractCegarLoop]: Abstraction has 3920 states and 4202 transitions. [2022-01-10 00:14:00,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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:14:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4202 transitions. [2022-01-10 00:14:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 777 [2022-01-10 00:14:00,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:14:00,059 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:14:00,076 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:14:00,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-10 00:14:00,280 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:14:00,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:14:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash 352584362, now seen corresponding path program 1 times [2022-01-10 00:14:00,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:14:00,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155690415] [2022-01-10 00:14:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:14:00,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:14:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:14:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 1244 proven. 155 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2022-01-10 00:14:00,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:14:00,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155690415] [2022-01-10 00:14:00,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155690415] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:14:00,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293868567] [2022-01-10 00:14:00,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:14:00,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:14:00,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:14:00,502 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:14:00,503 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:14:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:14:00,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:14:00,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:14:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2022-01-10 00:14:01,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:14:01,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293868567] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:14:01,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:14:01,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 00:14:01,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261465521] [2022-01-10 00:14:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:14:01,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:14:01,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:14:01,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:14:01,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:14:01,451 INFO L87 Difference]: Start difference. First operand 3920 states and 4202 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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:14:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:14:01,825 INFO L93 Difference]: Finished difference Result 8370 states and 9034 transitions. [2022-01-10 00:14:01,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:14:01,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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) Word has length 776 [2022-01-10 00:14:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:14:01,836 INFO L225 Difference]: With dead ends: 8370 [2022-01-10 00:14:01,836 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 00:14:01,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 776 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:14:01,841 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 149 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:14:01,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 232 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 00:14:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 00:14:01,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 00:14:01,842 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:14:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 00:14:01,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 776 [2022-01-10 00:14:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:14:01,842 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 00:14:01,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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:14:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 00:14:01,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 00:14:01,845 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 00:14:01,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 00:14:02,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-10 00:14:02,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 00:14:02,618 INFO L858 garLoopResultBuilder]: For program point L762(lines 762 880) no Hoare annotation was computed. [2022-01-10 00:14:02,618 INFO L858 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2022-01-10 00:14:02,618 INFO L858 garLoopResultBuilder]: For program point L829(lines 829 880) no Hoare annotation was computed. [2022-01-10 00:14:02,618 INFO L858 garLoopResultBuilder]: For program point L631(lines 631 880) no Hoare annotation was computed. [2022-01-10 00:14:02,618 INFO L858 garLoopResultBuilder]: For program point L565(lines 565 880) no Hoare annotation was computed. [2022-01-10 00:14:02,618 INFO L858 garLoopResultBuilder]: For program point L169-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,618 INFO L858 garLoopResultBuilder]: For program point L103-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,618 INFO L858 garLoopResultBuilder]: For program point L37-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,618 INFO L858 garLoopResultBuilder]: For program point L698(lines 698 880) no Hoare annotation was computed. [2022-01-10 00:14:02,618 INFO L858 garLoopResultBuilder]: For program point L500(lines 500 880) no Hoare annotation was computed. [2022-01-10 00:14:02,618 INFO L858 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2022-01-10 00:14:02,618 INFO L858 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-01-10 00:14:02,619 INFO L858 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-01-10 00:14:02,619 INFO L858 garLoopResultBuilder]: For program point L369(lines 369 880) no Hoare annotation was computed. [2022-01-10 00:14:02,619 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 880) no Hoare annotation was computed. [2022-01-10 00:14:02,619 INFO L858 garLoopResultBuilder]: For program point L436(lines 436 880) no Hoare annotation was computed. [2022-01-10 00:14:02,619 INFO L858 garLoopResultBuilder]: For program point L172-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,619 INFO L858 garLoopResultBuilder]: For program point L106-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,619 INFO L858 garLoopResultBuilder]: For program point L40-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,619 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 880) no Hoare annotation was computed. [2022-01-10 00:14:02,619 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-01-10 00:14:02,619 INFO L858 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-01-10 00:14:02,619 INFO L858 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L768(lines 768 880) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L636(lines 636 880) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L835(lines 835 880) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L571(lines 571 880) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L505(lines 505 880) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L175-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L109-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L43-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L704(lines 704 880) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-01-10 00:14:02,620 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 880) no Hoare annotation was computed. [2022-01-10 00:14:02,621 INFO L858 garLoopResultBuilder]: For program point L442(lines 442 880) no Hoare annotation was computed. [2022-01-10 00:14:02,622 INFO L858 garLoopResultBuilder]: For program point L376(lines 376 880) no Hoare annotation was computed. [2022-01-10 00:14:02,622 INFO L858 garLoopResultBuilder]: For program point L178-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,622 INFO L858 garLoopResultBuilder]: For program point L112-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,622 INFO L858 garLoopResultBuilder]: For program point L46-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,622 INFO L858 garLoopResultBuilder]: For program point L245(lines 245 880) no Hoare annotation was computed. [2022-01-10 00:14:02,622 INFO L858 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-01-10 00:14:02,622 INFO L858 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-01-10 00:14:02,622 INFO L858 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-01-10 00:14:02,622 INFO L858 garLoopResultBuilder]: For program point L774(lines 774 880) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L642(lines 642 880) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 880) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L841(lines 841 880) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L181-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L115-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L710(lines 710 880) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L578(lines 578 880) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L182(line 182) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 880) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L448(lines 448 880) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 880) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L184-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L118-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,623 INFO L858 garLoopResultBuilder]: For program point L52-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L251(lines 251 880) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L119(line 119) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L648(lines 648 880) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 880) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L847(lines 847 880) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L781(lines 781 880) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L583(lines 583 880) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L187-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L121-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L55-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L716(lines 716 880) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L321(lines 321 880) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 880) no Hoare annotation was computed. [2022-01-10 00:14:02,625 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 880) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L190-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L124-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L58-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L257(lines 257 880) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L191(line 191) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L852(lines 852 880) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L654(lines 654 880) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L522(lines 522 880) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L787(lines 787 880) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L589(lines 589 880) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L193-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L127-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L61-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L722(lines 722 880) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-01-10 00:14:02,626 INFO L858 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L459(lines 459 880) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L327(lines 327 880) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 880) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 880) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L196-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L130-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L64-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L197(line 197) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L858(lines 858 880) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L660(lines 660 880) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L528(lines 528 880) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L793(lines 793 880) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 880) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L199-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L133-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,627 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L728(lines 728 880) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L464(lines 464 880) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L200(line 200) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L333(lines 333 880) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 880) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 880) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L202-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L136-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L70-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-01-10 00:14:02,628 INFO L858 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L864(lines 864 880) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L666(lines 666 880) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L534(lines 534 880) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L799(lines 799 880) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 880) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L205-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L139-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L73-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L734(lines 734 880) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L470(lines 470 880) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L206(line 206) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 880) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 880) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L274(lines 274 880) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L208-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,629 INFO L858 garLoopResultBuilder]: For program point L142-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L76-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L869(lines 869 880) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L209(line 209) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L672(lines 672 880) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 880) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L805(lines 805 880) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L607(lines 607 880) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L211-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L145-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L79-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L740(lines 740 880) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 880) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L345(lines 345 880) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L279(lines 279 880) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L412(lines 412 880) no Hoare annotation was computed. [2022-01-10 00:14:02,630 INFO L858 garLoopResultBuilder]: For program point L148-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L82-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L875(lines 875 880) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L678(lines 678 880) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L546(lines 546 880) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L811(lines 811 880) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L745(lines 745 880) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L613(lines 613 880) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L151-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L85-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L482(lines 482 880) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L351(lines 351 880) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 880) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L418(lines 418 880) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L154-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,631 INFO L858 garLoopResultBuilder]: For program point L88-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L854 garLoopResultBuilder]: At program point L881(lines 30 882) the Hoare annotation is: (let ((.cse0 (= ~a24~0 1)) (.cse1 (<= ~a21~0 7))) (or (and (<= 7 ~a15~0) .cse0) (and (<= ~a15~0 8) .cse1 (<= (+ 49 ~a12~0) 0)) (and .cse0 (not (<= (+ ~a12~0 43) 0))) (and (<= 9 ~a21~0) (<= ~a21~0 9) .cse0) (and .cse0 .cse1))) [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L551(lines 551 880) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L221(lines 221 880) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L684(lines 684 880) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L817(lines 817 880) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L751(lines 751 880) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L619(lines 619 880) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L157-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L91-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L861 garLoopResultBuilder]: At program point L884(lines 884 900) the Hoare annotation is: true [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 880) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L290(lines 290 880) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L687(lines 687 880) no Hoare annotation was computed. [2022-01-10 00:14:02,632 INFO L858 garLoopResultBuilder]: For program point L357(lines 357 880) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L424(lines 424 880) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L160-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L94-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L557(lines 557 880) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 880) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L161(line 161) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L757(lines 757 880) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L625(lines 625 880) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L163-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L97-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 33) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L31-2(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,633 INFO L858 garLoopResultBuilder]: For program point L824(lines 824 880) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L854 garLoopResultBuilder]: At program point L890-2(lines 890 899) the Hoare annotation is: (let ((.cse0 (= ~a24~0 1)) (.cse1 (<= ~a21~0 7))) (or (and (<= 7 ~a15~0) .cse0) (and (<= ~a15~0 8) .cse1 (<= (+ 49 ~a12~0) 0)) (and .cse0 (not (<= (+ ~a12~0 43) 0))) (and (<= 9 ~a21~0) (<= ~a21~0 9) .cse0) (and .cse0 .cse1))) [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 880) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 880) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L693(lines 693 880) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 880) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 880) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L430(lines 430 880) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L166-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L100-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L34-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 880) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L167(line 167) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2022-01-10 00:14:02,634 INFO L858 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-01-10 00:14:02,639 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:14:02,640 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 00:14:02,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:14:02 BoogieIcfgContainer [2022-01-10 00:14:02,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 00:14:02,658 INFO L158 Benchmark]: Toolchain (without parser) took 19241.09ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 119.4MB in the beginning and 222.8MB in the end (delta: -103.4MB). Peak memory consumption was 211.5MB. Max. memory is 8.0GB. [2022-01-10 00:14:02,658 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:14:02,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.52ms. Allocated memory was 178.3MB in the beginning and 242.2MB in the end (delta: 64.0MB). Free memory was 119.2MB in the beginning and 193.1MB in the end (delta: -73.8MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-01-10 00:14:02,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.53ms. Allocated memory is still 242.2MB. Free memory was 193.1MB in the beginning and 183.1MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 00:14:02,659 INFO L158 Benchmark]: Boogie Preprocessor took 84.98ms. Allocated memory is still 242.2MB. Free memory was 183.1MB in the beginning and 177.3MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-10 00:14:02,659 INFO L158 Benchmark]: RCFGBuilder took 1096.85ms. Allocated memory is still 242.2MB. Free memory was 177.3MB in the beginning and 101.8MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. [2022-01-10 00:14:02,659 INFO L158 Benchmark]: TraceAbstraction took 17428.52ms. Allocated memory was 242.2MB in the beginning and 373.3MB in the end (delta: 131.1MB). Free memory was 101.3MB in the beginning and 222.8MB in the end (delta: -121.5MB). Peak memory consumption was 129.6MB. Max. memory is 8.0GB. [2022-01-10 00:14:02,660 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.10ms. Allocated memory is still 178.3MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 542.52ms. Allocated memory was 178.3MB in the beginning and 242.2MB in the end (delta: 64.0MB). Free memory was 119.2MB in the beginning and 193.1MB in the end (delta: -73.8MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.53ms. Allocated memory is still 242.2MB. Free memory was 193.1MB in the beginning and 183.1MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 84.98ms. Allocated memory is still 242.2MB. Free memory was 183.1MB in the beginning and 177.3MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1096.85ms. Allocated memory is still 242.2MB. Free memory was 177.3MB in the beginning and 101.8MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. * TraceAbstraction took 17428.52ms. Allocated memory was 242.2MB in the beginning and 373.3MB in the end (delta: 131.1MB). Free memory was 101.3MB in the beginning and 222.8MB in the end (delta: -121.5MB). Peak memory consumption was 129.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: 110]: 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 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2184 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2184 mSDsluCounter, 1670 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 1003 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8292 IncrementalHoareTripleChecker+Invalid, 9295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1003 mSolverCounterUnsat, 1582 mSDtfsCounter, 8292 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3167 GetRequests, 3129 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3920occurred in iteration=15, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 3388 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 63 NumberOfFragments, 95 HoareAnnotationTreeSize, 3 FomulaSimplifications, 786 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3398 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 9461 NumberOfCodeBlocks, 9461 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 9439 ConstructedInterpolants, 0 QuantifiedInterpolants, 32791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4061 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 15369/16342 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: 30]: Loop Invariant Derived loop invariant: ((((7 <= a15 && a24 == 1) || ((a15 <= 8 && a21 <= 7) && 49 + a12 <= 0)) || (a24 == 1 && !(a12 + 43 <= 0))) || ((9 <= a21 && a21 <= 9) && a24 == 1)) || (a24 == 1 && a21 <= 7) - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((7 <= a15 && a24 == 1) || ((a15 <= 8 && a21 <= 7) && 49 + a12 <= 0)) || (a24 == 1 && !(a12 + 43 <= 0))) || ((9 <= a21 && a21 <= 9) && a24 == 1)) || (a24 == 1 && a21 <= 7) RESULT: Ultimate proved your program to be correct! [2022-01-10 00:14:02,682 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...