/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_label03.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:12:35,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:12:35,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:12:35,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:12:35,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:12:35,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:12:35,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:12:35,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:12:35,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:12:35,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:12:35,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:12:35,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:12:35,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:12:35,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:12:35,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:12:35,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:12:35,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:12:35,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:12:35,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:12:35,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:12:35,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:12:35,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:12:35,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:12:35,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:12:35,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:12:35,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:12:35,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:12:35,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:12:35,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:12:35,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:12:35,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:12:35,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:12:35,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:12:35,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:12:35,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:12:35,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:12:35,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:12:35,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:12:35,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:12:35,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:12:35,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:12:35,717 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:12:35,747 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:12:35,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:12:35,748 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:12:35,748 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:12:35,749 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:12:35,749 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:12:35,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:12:35,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:12:35,750 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:12:35,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:12:35,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:12:35,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:12:35,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:12:35,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:12:35,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:12:35,752 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:12:35,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:12:35,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:12:35,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:12:35,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:12:35,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:12:35,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:12:35,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:12:35,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:12:35,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:12:35,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:12:35,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:12:35,755 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:12:35,755 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:12:35,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:12:35,755 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:12:35,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:12:35,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:12:35,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:12:35,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:12:35,983 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:12:35,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label03.c [2022-01-10 00:12:36,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8307df4a/4bb8354625444fb781b582b3447f0838/FLAGedde5224c [2022-01-10 00:12:36,526 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:12:36,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label03.c [2022-01-10 00:12:36,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8307df4a/4bb8354625444fb781b582b3447f0838/FLAGedde5224c [2022-01-10 00:12:36,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8307df4a/4bb8354625444fb781b582b3447f0838 [2022-01-10 00:12:36,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:12:36,836 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:12:36,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:12:36,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:12:36,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:12:36,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:12:36" (1/1) ... [2022-01-10 00:12:36,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7d8054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:36, skipping insertion in model container [2022-01-10 00:12:36,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:12:36" (1/1) ... [2022-01-10 00:12:36,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:12:36,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:12:37,117 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_label03.c[5277,5290] [2022-01-10 00:12:37,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:12:37,295 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:12:37,326 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_label03.c[5277,5290] [2022-01-10 00:12:37,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:12:37,412 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:12:37,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:37 WrapperNode [2022-01-10 00:12:37,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:12:37,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:12:37,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:12:37,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:12:37,421 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:12:37" (1/1) ... [2022-01-10 00:12:37,459 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:12:37" (1/1) ... [2022-01-10 00:12:37,529 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 858 [2022-01-10 00:12:37,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:12:37,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:12:37,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:12:37,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:12:37,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:37" (1/1) ... [2022-01-10 00:12:37,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:37" (1/1) ... [2022-01-10 00:12:37,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:37" (1/1) ... [2022-01-10 00:12:37,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:37" (1/1) ... [2022-01-10 00:12:37,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:37" (1/1) ... [2022-01-10 00:12:37,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:37" (1/1) ... [2022-01-10 00:12:37,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:37" (1/1) ... [2022-01-10 00:12:37,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:12:37,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:12:37,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:12:37,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:12:37,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:37" (1/1) ... [2022-01-10 00:12:37,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:12:37,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:12:37,660 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:12:37,688 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:12:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:12:37,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:12:37,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:12:37,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:12:37,769 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:12:37,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:12:38,741 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:12:38,753 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:12:38,754 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:12:38,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:12:38 BoogieIcfgContainer [2022-01-10 00:12:38,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:12:38,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:12:38,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:12:38,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:12:38,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:12:36" (1/3) ... [2022-01-10 00:12:38,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b940f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:12:38, skipping insertion in model container [2022-01-10 00:12:38,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:12:37" (2/3) ... [2022-01-10 00:12:38,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b940f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:12:38, skipping insertion in model container [2022-01-10 00:12:38,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:12:38" (3/3) ... [2022-01-10 00:12:38,766 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label03.c [2022-01-10 00:12:38,772 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:12:38,772 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:12:38,817 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:12:38,823 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:12:38,824 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:12:38,842 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:12:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 00:12:38,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:38,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:12:38,860 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:38,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:38,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2122806209, now seen corresponding path program 1 times [2022-01-10 00:12:38,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:38,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603655912] [2022-01-10 00:12:38,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:38,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:39,158 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:12:39,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:39,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603655912] [2022-01-10 00:12:39,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603655912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:39,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:39,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:12:39,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848992683] [2022-01-10 00:12:39,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:39,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:39,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:39,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:39,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:39,203 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 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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:12:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:40,142 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2022-01-10 00:12:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:40,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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 51 [2022-01-10 00:12:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:40,160 INFO L225 Difference]: With dead ends: 669 [2022-01-10 00:12:40,160 INFO L226 Difference]: Without dead ends: 360 [2022-01-10 00:12:40,164 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:12:40,167 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 159 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 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.8s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:40,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 94 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 00:12:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-01-10 00:12:40,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2022-01-10 00:12:40,219 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:12:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2022-01-10 00:12:40,222 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 51 [2022-01-10 00:12:40,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:40,222 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2022-01-10 00:12:40,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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:12:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2022-01-10 00:12:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-01-10 00:12:40,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:40,227 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, 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] [2022-01-10 00:12:40,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:12:40,228 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:40,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:40,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1080800965, now seen corresponding path program 1 times [2022-01-10 00:12:40,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:40,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66078807] [2022-01-10 00:12:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:40,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:12:40,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:40,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66078807] [2022-01-10 00:12:40,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66078807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:40,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:40,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:12:40,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362270489] [2022-01-10 00:12:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:40,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:40,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:40,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:40,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:40,335 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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:12:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:40,986 INFO L93 Difference]: Finished difference Result 1076 states and 1634 transitions. [2022-01-10 00:12:40,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:40,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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 126 [2022-01-10 00:12:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:40,992 INFO L225 Difference]: With dead ends: 1076 [2022-01-10 00:12:40,992 INFO L226 Difference]: Without dead ends: 718 [2022-01-10 00:12:40,998 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:12:40,999 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 124 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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:12:41,000 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:12:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-01-10 00:12:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 716. [2022-01-10 00:12:41,021 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:12:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 969 transitions. [2022-01-10 00:12:41,023 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 969 transitions. Word has length 126 [2022-01-10 00:12:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:41,024 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 969 transitions. [2022-01-10 00:12:41,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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:12:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 969 transitions. [2022-01-10 00:12:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-10 00:12:41,028 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:41,028 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, 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] [2022-01-10 00:12:41,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:12:41,028 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:41,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1002073487, now seen corresponding path program 1 times [2022-01-10 00:12:41,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:41,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939423589] [2022-01-10 00:12:41,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:41,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:12:41,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:41,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939423589] [2022-01-10 00:12:41,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939423589] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:41,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:41,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:41,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303143244] [2022-01-10 00:12:41,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:41,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:12:41,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:41,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:12:41,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:12:41,153 INFO L87 Difference]: Start difference. First operand 716 states and 969 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 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:12:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:42,069 INFO L93 Difference]: Finished difference Result 1966 states and 2575 transitions. [2022-01-10 00:12:42,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:12:42,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 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 130 [2022-01-10 00:12:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:42,079 INFO L225 Difference]: With dead ends: 1966 [2022-01-10 00:12:42,080 INFO L226 Difference]: Without dead ends: 1252 [2022-01-10 00:12:42,081 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:12:42,088 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 420 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:42,090 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.9s Time] [2022-01-10 00:12:42,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-01-10 00:12:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1250. [2022-01-10 00:12:42,119 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:12:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1546 transitions. [2022-01-10 00:12:42,124 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1546 transitions. Word has length 130 [2022-01-10 00:12:42,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:42,125 INFO L470 AbstractCegarLoop]: Abstraction has 1250 states and 1546 transitions. [2022-01-10 00:12:42,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 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:12:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1546 transitions. [2022-01-10 00:12:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-01-10 00:12:42,132 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:42,133 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:12:42,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:12:42,133 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:42,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash 313256988, now seen corresponding path program 1 times [2022-01-10 00:12:42,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:42,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325890699] [2022-01-10 00:12:42,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:42,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 00:12:42,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:42,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325890699] [2022-01-10 00:12:42,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325890699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:42,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:42,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:42,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929330233] [2022-01-10 00:12:42,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:42,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:12:42,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:42,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:12:42,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:12:42,344 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:12:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:43,016 INFO L93 Difference]: Finished difference Result 2707 states and 3359 transitions. [2022-01-10 00:12:43,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:12:43,024 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 210 [2022-01-10 00:12:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:43,030 INFO L225 Difference]: With dead ends: 2707 [2022-01-10 00:12:43,030 INFO L226 Difference]: Without dead ends: 1608 [2022-01-10 00:12:43,032 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:12:43,033 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 120 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:43,033 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.6s Time] [2022-01-10 00:12:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2022-01-10 00:12:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1606. [2022-01-10 00:12:43,063 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:12:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1804 transitions. [2022-01-10 00:12:43,068 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1804 transitions. Word has length 210 [2022-01-10 00:12:43,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:43,069 INFO L470 AbstractCegarLoop]: Abstraction has 1606 states and 1804 transitions. [2022-01-10 00:12:43,069 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:12:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1804 transitions. [2022-01-10 00:12:43,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-01-10 00:12:43,073 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:43,074 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, 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, 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:12:43,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:12:43,074 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:43,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:43,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1682054282, now seen corresponding path program 1 times [2022-01-10 00:12:43,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:43,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289732204] [2022-01-10 00:12:43,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:43,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 194 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-01-10 00:12:43,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:43,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289732204] [2022-01-10 00:12:43,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289732204] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:12:43,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826664109] [2022-01-10 00:12:43,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:43,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:12:43,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:12:43,303 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:12:43,325 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:12:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:43,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:12:43,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:12:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2022-01-10 00:12:44,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:12:44,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826664109] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:44,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:12:44,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-01-10 00:12:44,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220875076] [2022-01-10 00:12:44,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:44,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:44,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:44,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:44,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:12:44,233 INFO L87 Difference]: Start difference. First operand 1606 states and 1804 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 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:12:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:44,755 INFO L93 Difference]: Finished difference Result 3388 states and 3907 transitions. [2022-01-10 00:12:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:44,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 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 337 [2022-01-10 00:12:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:44,763 INFO L225 Difference]: With dead ends: 3388 [2022-01-10 00:12:44,763 INFO L226 Difference]: Without dead ends: 1962 [2022-01-10 00:12:44,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 336 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:12:44,767 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:44,767 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.5s Time] [2022-01-10 00:12:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2022-01-10 00:12:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2022-01-10 00:12:44,799 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:12:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2201 transitions. [2022-01-10 00:12:44,805 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2201 transitions. Word has length 337 [2022-01-10 00:12:44,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:44,805 INFO L470 AbstractCegarLoop]: Abstraction has 1962 states and 2201 transitions. [2022-01-10 00:12:44,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 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:12:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2201 transitions. [2022-01-10 00:12:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2022-01-10 00:12:44,809 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:44,809 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, 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, 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:12:44,838 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:12:45,034 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:12:45,035 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:45,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:45,036 INFO L85 PathProgramCache]: Analyzing trace with hash 514746580, now seen corresponding path program 1 times [2022-01-10 00:12:45,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:45,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193810555] [2022-01-10 00:12:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:45,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-01-10 00:12:45,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:45,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193810555] [2022-01-10 00:12:45,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193810555] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:45,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:45,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:45,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413269711] [2022-01-10 00:12:45,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:45,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:45,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:45,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:45,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:45,201 INFO L87 Difference]: Start difference. First operand 1962 states and 2201 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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:12:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:45,671 INFO L93 Difference]: Finished difference Result 4100 states and 4648 transitions. [2022-01-10 00:12:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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 341 [2022-01-10 00:12:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:45,680 INFO L225 Difference]: With dead ends: 4100 [2022-01-10 00:12:45,680 INFO L226 Difference]: Without dead ends: 2318 [2022-01-10 00:12:45,683 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:12:45,683 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 101 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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:12:45,684 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:12:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-01-10 00:12:45,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2022-01-10 00:12:45,719 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:12:45,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2596 transitions. [2022-01-10 00:12:45,725 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2596 transitions. Word has length 341 [2022-01-10 00:12:45,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:45,725 INFO L470 AbstractCegarLoop]: Abstraction has 2318 states and 2596 transitions. [2022-01-10 00:12:45,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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:12:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2596 transitions. [2022-01-10 00:12:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2022-01-10 00:12:45,730 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:45,730 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, 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, 2, 2, 1, 1, 1, 1, 1] [2022-01-10 00:12:45,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:12:45,731 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:45,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:45,731 INFO L85 PathProgramCache]: Analyzing trace with hash -591060880, now seen corresponding path program 1 times [2022-01-10 00:12:45,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:45,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465997804] [2022-01-10 00:12:45,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:45,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-01-10 00:12:45,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:45,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465997804] [2022-01-10 00:12:45,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465997804] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:12:45,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526208901] [2022-01-10 00:12:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:45,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:12:45,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:12:45,916 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:12:45,917 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:12:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:46,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:12:46,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:12:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2022-01-10 00:12:46,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:12:46,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526208901] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:46,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:12:46,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2022-01-10 00:12:46,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344540175] [2022-01-10 00:12:46,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:46,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:46,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:46,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:46,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:12:46,738 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:12:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:47,203 INFO L93 Difference]: Finished difference Result 2854 states and 3202 transitions. [2022-01-10 00:12:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:47,203 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 368 [2022-01-10 00:12:47,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:47,213 INFO L225 Difference]: With dead ends: 2854 [2022-01-10 00:12:47,213 INFO L226 Difference]: Without dead ends: 2852 [2022-01-10 00:12:47,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 367 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:12:47,216 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:12:47,216 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:12:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2022-01-10 00:12:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2496. [2022-01-10 00:12:47,258 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:12:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2808 transitions. [2022-01-10 00:12:47,266 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2808 transitions. Word has length 368 [2022-01-10 00:12:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:47,266 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 2808 transitions. [2022-01-10 00:12:47,267 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:12:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2808 transitions. [2022-01-10 00:12:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2022-01-10 00:12:47,272 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:47,273 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, 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, 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:12:47,301 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:12:47,498 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:12:47,498 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:47,499 INFO L85 PathProgramCache]: Analyzing trace with hash 262542689, now seen corresponding path program 1 times [2022-01-10 00:12:47,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:47,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519475969] [2022-01-10 00:12:47,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:47,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2022-01-10 00:12:47,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:47,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519475969] [2022-01-10 00:12:47,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519475969] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:47,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:47,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:47,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863025743] [2022-01-10 00:12:47,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:47,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:12:47,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:47,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:12:47,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:12:47,672 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:12:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:48,242 INFO L93 Difference]: Finished difference Result 5048 states and 5689 transitions. [2022-01-10 00:12:48,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:12:48,243 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 421 [2022-01-10 00:12:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:48,252 INFO L225 Difference]: With dead ends: 5048 [2022-01-10 00:12:48,252 INFO L226 Difference]: Without dead ends: 2674 [2022-01-10 00:12:48,256 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:12:48,256 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 125 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:48,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 17 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:12:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2022-01-10 00:12:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2496. [2022-01-10 00:12:48,294 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:12:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2707 transitions. [2022-01-10 00:12:48,298 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2707 transitions. Word has length 421 [2022-01-10 00:12:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:48,299 INFO L470 AbstractCegarLoop]: Abstraction has 2496 states and 2707 transitions. [2022-01-10 00:12:48,299 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:12:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2707 transitions. [2022-01-10 00:12:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2022-01-10 00:12:48,306 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:48,306 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, 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, 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:12:48,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 00:12:48,307 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:48,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:48,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1515068160, now seen corresponding path program 2 times [2022-01-10 00:12:48,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:48,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358319250] [2022-01-10 00:12:48,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:48,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 445 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-01-10 00:12:48,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:48,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358319250] [2022-01-10 00:12:48,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358319250] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:12:48,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263672113] [2022-01-10 00:12:48,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:12:48,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:12:48,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:12:48,498 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:12:48,500 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:12:48,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:12:48,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:12:48,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 00:12:48,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:12:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2022-01-10 00:12:49,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:12:49,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263672113] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:49,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:12:49,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-01-10 00:12:49,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048366849] [2022-01-10 00:12:49,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:49,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:12:49,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:49,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:12:49,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:12:49,778 INFO L87 Difference]: Start difference. First operand 2496 states and 2707 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 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:12:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:50,490 INFO L93 Difference]: Finished difference Result 5524 states and 6045 transitions. [2022-01-10 00:12:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:12:50,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 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 447 [2022-01-10 00:12:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:50,501 INFO L225 Difference]: With dead ends: 5524 [2022-01-10 00:12:50,501 INFO L226 Difference]: Without dead ends: 3208 [2022-01-10 00:12:50,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 445 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:12:50,504 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 191 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:50,505 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.7s Time] [2022-01-10 00:12:50,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2022-01-10 00:12:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2852. [2022-01-10 00:12:50,549 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:12:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3071 transitions. [2022-01-10 00:12:50,555 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3071 transitions. Word has length 447 [2022-01-10 00:12:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:50,555 INFO L470 AbstractCegarLoop]: Abstraction has 2852 states and 3071 transitions. [2022-01-10 00:12:50,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 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:12:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3071 transitions. [2022-01-10 00:12:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2022-01-10 00:12:50,558 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:50,559 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, 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, 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:12:50,587 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:12:50,783 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:12:50,784 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:50,784 INFO L85 PathProgramCache]: Analyzing trace with hash 284431623, now seen corresponding path program 1 times [2022-01-10 00:12:50,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:50,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122508591] [2022-01-10 00:12:50,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:50,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2022-01-10 00:12:50,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:50,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122508591] [2022-01-10 00:12:50,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122508591] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:50,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:50,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:50,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955922004] [2022-01-10 00:12:50,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:50,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:50,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:50,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:50,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:50,952 INFO L87 Difference]: Start difference. First operand 2852 states and 3071 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:12:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:51,421 INFO L93 Difference]: Finished difference Result 6058 states and 6601 transitions. [2022-01-10 00:12:51,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:51,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 454 [2022-01-10 00:12:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:51,434 INFO L225 Difference]: With dead ends: 6058 [2022-01-10 00:12:51,434 INFO L226 Difference]: Without dead ends: 3386 [2022-01-10 00:12:51,438 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:12:51,439 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.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:51,440 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.4s Time] [2022-01-10 00:12:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2022-01-10 00:12:51,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3208. [2022-01-10 00:12:51,490 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:12:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3462 transitions. [2022-01-10 00:12:51,497 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3462 transitions. Word has length 454 [2022-01-10 00:12:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:51,498 INFO L470 AbstractCegarLoop]: Abstraction has 3208 states and 3462 transitions. [2022-01-10 00:12:51,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:12:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3462 transitions. [2022-01-10 00:12:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2022-01-10 00:12:51,503 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:51,503 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, 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, 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:12:51,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 00:12:51,504 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:51,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:51,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1246091326, now seen corresponding path program 1 times [2022-01-10 00:12:51,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:51,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017438445] [2022-01-10 00:12:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:51,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 445 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-01-10 00:12:51,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:51,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017438445] [2022-01-10 00:12:51,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017438445] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:12:51,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068565822] [2022-01-10 00:12:51,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:51,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:12:51,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:12:51,724 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:12:51,769 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:12:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:51,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:12:51,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:12:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-01-10 00:12:52,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:12:52,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068565822] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:52,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:12:52,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-01-10 00:12:52,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510170657] [2022-01-10 00:12:52,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:52,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:52,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:52,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:52,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:12:52,494 INFO L87 Difference]: Start difference. First operand 3208 states and 3462 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:12:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:52,911 INFO L93 Difference]: Finished difference Result 3922 states and 4228 transitions. [2022-01-10 00:12:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:52,912 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 499 [2022-01-10 00:12:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:52,923 INFO L225 Difference]: With dead ends: 3922 [2022-01-10 00:12:52,923 INFO L226 Difference]: Without dead ends: 3920 [2022-01-10 00:12:52,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:12:52,925 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 151 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:52,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 11 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:12:52,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2022-01-10 00:12:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3208. [2022-01-10 00:12:52,969 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:12:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3462 transitions. [2022-01-10 00:12:52,974 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3462 transitions. Word has length 499 [2022-01-10 00:12:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:52,974 INFO L470 AbstractCegarLoop]: Abstraction has 3208 states and 3462 transitions. [2022-01-10 00:12:52,974 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:12:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3462 transitions. [2022-01-10 00:12:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2022-01-10 00:12:52,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:52,981 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, 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, 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, 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:12:53,008 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:12:53,205 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:12:53,205 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:53,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash 324332960, now seen corresponding path program 1 times [2022-01-10 00:12:53,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:53,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255720415] [2022-01-10 00:12:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:53,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 924 proven. 195 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-10 00:12:53,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:53,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255720415] [2022-01-10 00:12:53,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255720415] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:12:53,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942020016] [2022-01-10 00:12:53,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:53,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:12:53,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:12:53,449 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:12:53,498 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:12:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:53,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:12:53,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:12:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 1029 trivial. 0 not checked. [2022-01-10 00:12:54,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:12:54,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942020016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:54,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:12:54,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-01-10 00:12:54,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495894922] [2022-01-10 00:12:54,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:54,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:54,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:54,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:54,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:12:54,517 INFO L87 Difference]: Start difference. First operand 3208 states and 3462 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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:12:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:54,966 INFO L93 Difference]: Finished difference Result 7126 states and 7765 transitions. [2022-01-10 00:12:54,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:54,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 641 [2022-01-10 00:12:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:54,980 INFO L225 Difference]: With dead ends: 7126 [2022-01-10 00:12:54,980 INFO L226 Difference]: Without dead ends: 4276 [2022-01-10 00:12:54,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:12:54,984 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 140 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:54,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 216 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:12:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2022-01-10 00:12:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2022-01-10 00:12:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.078105931169148) internal successors, (4417), 4097 states have internal predecessors, (4417), 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:12:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4417 transitions. [2022-01-10 00:12:55,061 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4417 transitions. Word has length 641 [2022-01-10 00:12:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:55,061 INFO L470 AbstractCegarLoop]: Abstraction has 4098 states and 4417 transitions. [2022-01-10 00:12:55,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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:12:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4417 transitions. [2022-01-10 00:12:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2022-01-10 00:12:55,070 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:55,070 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, 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, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2022-01-10 00:12:55,095 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:12:55,287 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,SelfDestructingSolverStorable11 [2022-01-10 00:12:55,288 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:55,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:55,288 INFO L85 PathProgramCache]: Analyzing trace with hash -316771125, now seen corresponding path program 1 times [2022-01-10 00:12:55,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:55,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235448541] [2022-01-10 00:12:55,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:55,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 1005 proven. 195 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-10 00:12:55,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:55,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235448541] [2022-01-10 00:12:55,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235448541] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:12:55,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525457309] [2022-01-10 00:12:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:55,566 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:12:55,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:12:55,568 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:12:55,569 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:12:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:55,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 00:12:55,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:12:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 655 proven. 0 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2022-01-10 00:12:56,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:12:56,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525457309] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:56,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:12:56,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-01-10 00:12:56,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290555952] [2022-01-10 00:12:56,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:56,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:56,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:56,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:56,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:12:56,761 INFO L87 Difference]: Start difference. First operand 4098 states and 4417 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 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:12:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:57,139 INFO L93 Difference]: Finished difference Result 8906 states and 9616 transitions. [2022-01-10 00:12:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:57,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 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 671 [2022-01-10 00:12:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:57,150 INFO L225 Difference]: With dead ends: 8906 [2022-01-10 00:12:57,150 INFO L226 Difference]: Without dead ends: 5166 [2022-01-10 00:12:57,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 670 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:12:57,156 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:12:57,156 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:12:57,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2022-01-10 00:12:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4632. [2022-01-10 00:12:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0773051176851651) internal successors, (4989), 4631 states have internal predecessors, (4989), 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:12:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4989 transitions. [2022-01-10 00:12:57,230 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4989 transitions. Word has length 671 [2022-01-10 00:12:57,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:57,231 INFO L470 AbstractCegarLoop]: Abstraction has 4632 states and 4989 transitions. [2022-01-10 00:12:57,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 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:12:57,231 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4989 transitions. [2022-01-10 00:12:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2022-01-10 00:12:57,240 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:57,241 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, 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, 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, 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:12:57,268 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:12:57,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:12:57,466 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:57,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:57,467 INFO L85 PathProgramCache]: Analyzing trace with hash -590297812, now seen corresponding path program 1 times [2022-01-10 00:12:57,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:57,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074229426] [2022-01-10 00:12:57,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:57,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 966 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-01-10 00:12:57,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:57,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074229426] [2022-01-10 00:12:57,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074229426] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:57,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:57,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:57,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276674958] [2022-01-10 00:12:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:57,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:57,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:57,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:57,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:57,659 INFO L87 Difference]: Start difference. First operand 4632 states and 4989 transitions. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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:12:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:58,121 INFO L93 Difference]: Finished difference Result 9618 states and 10429 transitions. [2022-01-10 00:12:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:58,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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 675 [2022-01-10 00:12:58,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:58,129 INFO L225 Difference]: With dead ends: 9618 [2022-01-10 00:12:58,129 INFO L226 Difference]: Without dead ends: 5344 [2022-01-10 00:12:58,133 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:12:58,133 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:58,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 50 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:12:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2022-01-10 00:12:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5344. [2022-01-10 00:12:58,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5344 states, 5343 states have (on average 1.0733670222721317) internal successors, (5735), 5343 states have internal predecessors, (5735), 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:12:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5735 transitions. [2022-01-10 00:12:58,192 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5735 transitions. Word has length 675 [2022-01-10 00:12:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:58,193 INFO L470 AbstractCegarLoop]: Abstraction has 5344 states and 5735 transitions. [2022-01-10 00:12:58,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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:12:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5735 transitions. [2022-01-10 00:12:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2022-01-10 00:12:58,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:58,203 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, 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, 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, 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:12:58,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 00:12:58,203 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:58,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:58,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1194627754, now seen corresponding path program 1 times [2022-01-10 00:12:58,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:58,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688870719] [2022-01-10 00:12:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:58,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1708 backedges. 1171 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-01-10 00:12:58,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:58,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688870719] [2022-01-10 00:12:58,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688870719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:58,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:58,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:58,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349024285] [2022-01-10 00:12:58,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:58,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:58,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:58,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:58,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:58,376 INFO L87 Difference]: Start difference. First operand 5344 states and 5735 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:12:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:58,793 INFO L93 Difference]: Finished difference Result 10508 states and 11289 transitions. [2022-01-10 00:12:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:58,794 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 688 [2022-01-10 00:12:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:58,801 INFO L225 Difference]: With dead ends: 10508 [2022-01-10 00:12:58,802 INFO L226 Difference]: Without dead ends: 5344 [2022-01-10 00:12:58,806 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:12:58,806 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:58,810 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.4s Time] [2022-01-10 00:12:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2022-01-10 00:12:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4632. [2022-01-10 00:12:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0796804145972791) internal successors, (5000), 4631 states have internal predecessors, (5000), 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:12:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 5000 transitions. [2022-01-10 00:12:58,872 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 5000 transitions. Word has length 688 [2022-01-10 00:12:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:58,872 INFO L470 AbstractCegarLoop]: Abstraction has 4632 states and 5000 transitions. [2022-01-10 00:12:58,873 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:12:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 5000 transitions. [2022-01-10 00:12:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2022-01-10 00:12:58,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:58,882 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:12:58,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 00:12:58,882 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:58,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:58,883 INFO L85 PathProgramCache]: Analyzing trace with hash 569441928, now seen corresponding path program 1 times [2022-01-10 00:12:58,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:58,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183737791] [2022-01-10 00:12:58,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:58,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 1618 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2022-01-10 00:12:59,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:59,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183737791] [2022-01-10 00:12:59,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183737791] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:59,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:59,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:59,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812075185] [2022-01-10 00:12:59,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:59,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:59,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:59,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:59,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:59,077 INFO L87 Difference]: Start difference. First operand 4632 states and 5000 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:12:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:59,449 INFO L93 Difference]: Finished difference Result 9260 states and 9999 transitions. [2022-01-10 00:12:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:59,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 772 [2022-01-10 00:12:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:59,450 INFO L225 Difference]: With dead ends: 9260 [2022-01-10 00:12:59,450 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 00:12:59,456 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:12:59,457 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 102 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:59,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 240 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 00:12:59,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 00:12:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 00:12:59,458 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:12:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 00:12:59,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 772 [2022-01-10 00:12:59,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:59,458 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 00:12:59,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:12:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 00:12:59,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 00:12:59,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 00:12:59,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 00:12:59,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 00:13:00,203 INFO L858 garLoopResultBuilder]: For program point L762(lines 762 880) no Hoare annotation was computed. [2022-01-10 00:13:00,203 INFO L858 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2022-01-10 00:13:00,203 INFO L858 garLoopResultBuilder]: For program point L829(lines 829 880) no Hoare annotation was computed. [2022-01-10 00:13:00,203 INFO L858 garLoopResultBuilder]: For program point L631(lines 631 880) no Hoare annotation was computed. [2022-01-10 00:13:00,203 INFO L858 garLoopResultBuilder]: For program point L565(lines 565 880) no Hoare annotation was computed. [2022-01-10 00:13:00,203 INFO L858 garLoopResultBuilder]: For program point L169-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,203 INFO L858 garLoopResultBuilder]: For program point L103-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,203 INFO L858 garLoopResultBuilder]: For program point L37-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L698(lines 698 880) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L500(lines 500 880) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L369(lines 369 880) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 880) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L436(lines 436 880) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L172-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L106-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L40-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 880) no Hoare annotation was computed. [2022-01-10 00:13:00,204 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L768(lines 768 880) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L636(lines 636 880) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L835(lines 835 880) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L571(lines 571 880) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L505(lines 505 880) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L175-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L109-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L43-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L704(lines 704 880) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-01-10 00:13:00,205 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 880) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L442(lines 442 880) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L376(lines 376 880) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L178-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L112-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L46-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L245(lines 245 880) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L774(lines 774 880) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L642(lines 642 880) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 880) no Hoare annotation was computed. [2022-01-10 00:13:00,206 INFO L858 garLoopResultBuilder]: For program point L841(lines 841 880) no Hoare annotation was computed. [2022-01-10 00:13:00,207 INFO L858 garLoopResultBuilder]: For program point L181-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,207 INFO L858 garLoopResultBuilder]: For program point L115-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,207 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,207 INFO L858 garLoopResultBuilder]: For program point L710(lines 710 880) no Hoare annotation was computed. [2022-01-10 00:13:00,207 INFO L858 garLoopResultBuilder]: For program point L578(lines 578 880) no Hoare annotation was computed. [2022-01-10 00:13:00,207 INFO L858 garLoopResultBuilder]: For program point L182(line 182) no Hoare annotation was computed. [2022-01-10 00:13:00,207 INFO L858 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-01-10 00:13:00,207 INFO L858 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-01-10 00:13:00,207 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 880) no Hoare annotation was computed. [2022-01-10 00:13:00,207 INFO L858 garLoopResultBuilder]: For program point L448(lines 448 880) no Hoare annotation was computed. [2022-01-10 00:13:00,207 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 880) no Hoare annotation was computed. [2022-01-10 00:13:00,207 INFO L858 garLoopResultBuilder]: For program point L184-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L118-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L52-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L251(lines 251 880) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L119(line 119) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L648(lines 648 880) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 880) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L847(lines 847 880) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L781(lines 781 880) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L583(lines 583 880) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L187-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,208 INFO L858 garLoopResultBuilder]: For program point L121-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point L55-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point L716(lines 716 880) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point L321(lines 321 880) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 880) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 880) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point L190-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point L124-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point L58-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,209 INFO L858 garLoopResultBuilder]: For program point L257(lines 257 880) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L191(line 191) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L852(lines 852 880) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L654(lines 654 880) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L522(lines 522 880) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L787(lines 787 880) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L589(lines 589 880) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L193-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L127-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L61-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L722(lines 722 880) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-01-10 00:13:00,210 INFO L858 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L459(lines 459 880) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L327(lines 327 880) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L394(lines 394 880) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 880) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L196-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L130-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L64-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L197(line 197) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 00:13:00,211 INFO L858 garLoopResultBuilder]: For program point L858(lines 858 880) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 167) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point L660(lines 660 880) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point L528(lines 528 880) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point L793(lines 793 880) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 880) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point L199-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point L133-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point L728(lines 728 880) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point L464(lines 464 880) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point L200(line 200) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2022-01-10 00:13:00,212 INFO L858 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L333(lines 333 880) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 880) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 880) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L202-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L136-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L70-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L864(lines 864 880) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L666(lines 666 880) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L534(lines 534 880) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L799(lines 799 880) no Hoare annotation was computed. [2022-01-10 00:13:00,213 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 880) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L205-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L139-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L73-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L734(lines 734 880) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L470(lines 470 880) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L206(line 206) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 880) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 880) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L274(lines 274 880) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L208-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L142-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,214 INFO L858 garLoopResultBuilder]: For program point L76-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L869(lines 869 880) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L209(line 209) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L672(lines 672 880) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 880) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L805(lines 805 880) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L607(lines 607 880) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L211-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L145-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L79-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L740(lines 740 880) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-01-10 00:13:00,215 INFO L858 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 880) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L345(lines 345 880) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L279(lines 279 880) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L412(lines 412 880) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L148-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L82-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L875(lines 875 880) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L678(lines 678 880) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L546(lines 546 880) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L811(lines 811 880) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L745(lines 745 880) no Hoare annotation was computed. [2022-01-10 00:13:00,216 INFO L858 garLoopResultBuilder]: For program point L613(lines 613 880) no Hoare annotation was computed. [2022-01-10 00:13:00,217 INFO L858 garLoopResultBuilder]: For program point L151-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,217 INFO L858 garLoopResultBuilder]: For program point L85-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,217 INFO L858 garLoopResultBuilder]: For program point L482(lines 482 880) no Hoare annotation was computed. [2022-01-10 00:13:00,217 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 00:13:00,217 INFO L858 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed. [2022-01-10 00:13:00,217 INFO L858 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-01-10 00:13:00,217 INFO L858 garLoopResultBuilder]: For program point L351(lines 351 880) no Hoare annotation was computed. [2022-01-10 00:13:00,217 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 880) no Hoare annotation was computed. [2022-01-10 00:13:00,217 INFO L858 garLoopResultBuilder]: For program point L418(lines 418 880) no Hoare annotation was computed. [2022-01-10 00:13:00,217 INFO L858 garLoopResultBuilder]: For program point L154-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,217 INFO L858 garLoopResultBuilder]: For program point L88-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,218 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 (<= 6 ~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:13:00,218 INFO L858 garLoopResultBuilder]: For program point L551(lines 551 880) no Hoare annotation was computed. [2022-01-10 00:13:00,218 INFO L858 garLoopResultBuilder]: For program point L221(lines 221 880) no Hoare annotation was computed. [2022-01-10 00:13:00,218 INFO L858 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-01-10 00:13:00,218 INFO L858 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-01-10 00:13:00,218 INFO L858 garLoopResultBuilder]: For program point L684(lines 684 880) no Hoare annotation was computed. [2022-01-10 00:13:00,218 INFO L858 garLoopResultBuilder]: For program point L817(lines 817 880) no Hoare annotation was computed. [2022-01-10 00:13:00,218 INFO L858 garLoopResultBuilder]: For program point L751(lines 751 880) no Hoare annotation was computed. [2022-01-10 00:13:00,218 INFO L858 garLoopResultBuilder]: For program point L619(lines 619 880) no Hoare annotation was computed. [2022-01-10 00:13:00,218 INFO L858 garLoopResultBuilder]: For program point L157-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,218 INFO L858 garLoopResultBuilder]: For program point L91-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,218 INFO L861 garLoopResultBuilder]: At program point L884(lines 884 900) the Hoare annotation is: true [2022-01-10 00:13:00,218 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 880) no Hoare annotation was computed. [2022-01-10 00:13:00,218 INFO L858 garLoopResultBuilder]: For program point L290(lines 290 880) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point L687(lines 687 880) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point L357(lines 357 880) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point L424(lines 424 880) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point L160-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point L94-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point L557(lines 557 880) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 880) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point L161(line 161) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2022-01-10 00:13:00,219 INFO L858 garLoopResultBuilder]: For program point L757(lines 757 880) no Hoare annotation was computed. [2022-01-10 00:13:00,220 INFO L858 garLoopResultBuilder]: For program point L625(lines 625 880) no Hoare annotation was computed. [2022-01-10 00:13:00,220 INFO L858 garLoopResultBuilder]: For program point L163-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,220 INFO L858 garLoopResultBuilder]: For program point L97-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,220 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 33) no Hoare annotation was computed. [2022-01-10 00:13:00,220 INFO L858 garLoopResultBuilder]: For program point L31-2(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,220 INFO L858 garLoopResultBuilder]: For program point L824(lines 824 880) no Hoare annotation was computed. [2022-01-10 00:13:00,220 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 (<= 6 ~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:13:00,220 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 880) no Hoare annotation was computed. [2022-01-10 00:13:00,220 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 880) no Hoare annotation was computed. [2022-01-10 00:13:00,220 INFO L858 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-01-10 00:13:00,220 INFO L858 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-01-10 00:13:00,220 INFO L858 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-01-10 00:13:00,220 INFO L858 garLoopResultBuilder]: For program point L693(lines 693 880) no Hoare annotation was computed. [2022-01-10 00:13:00,221 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 880) no Hoare annotation was computed. [2022-01-10 00:13:00,221 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 880) no Hoare annotation was computed. [2022-01-10 00:13:00,221 INFO L858 garLoopResultBuilder]: For program point L430(lines 430 880) no Hoare annotation was computed. [2022-01-10 00:13:00,221 INFO L858 garLoopResultBuilder]: For program point L166-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,221 INFO L858 garLoopResultBuilder]: For program point L100-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,221 INFO L858 garLoopResultBuilder]: For program point L34-1(lines 30 882) no Hoare annotation was computed. [2022-01-10 00:13:00,221 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 880) no Hoare annotation was computed. [2022-01-10 00:13:00,221 INFO L858 garLoopResultBuilder]: For program point L167(line 167) no Hoare annotation was computed. [2022-01-10 00:13:00,221 INFO L858 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2022-01-10 00:13:00,221 INFO L858 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-01-10 00:13:00,224 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:13:00,225 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 00:13:00,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:13:00 BoogieIcfgContainer [2022-01-10 00:13:00,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 00:13:00,239 INFO L158 Benchmark]: Toolchain (without parser) took 23403.62ms. Allocated memory was 175.1MB in the beginning and 402.7MB in the end (delta: 227.5MB). Free memory was 118.1MB in the beginning and 169.2MB in the end (delta: -51.2MB). Peak memory consumption was 187.8MB. Max. memory is 8.0GB. [2022-01-10 00:13:00,239 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:13:00,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.30ms. Allocated memory was 175.1MB in the beginning and 231.7MB in the end (delta: 56.6MB). Free memory was 117.8MB in the beginning and 182.0MB in the end (delta: -64.2MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-01-10 00:13:00,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.36ms. Allocated memory is still 231.7MB. Free memory was 182.0MB in the beginning and 172.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 00:13:00,240 INFO L158 Benchmark]: Boogie Preprocessor took 95.44ms. Allocated memory is still 231.7MB. Free memory was 172.6MB in the beginning and 166.8MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 00:13:00,240 INFO L158 Benchmark]: RCFGBuilder took 1130.14ms. Allocated memory is still 231.7MB. Free memory was 166.8MB in the beginning and 91.9MB in the end (delta: 75.0MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. [2022-01-10 00:13:00,241 INFO L158 Benchmark]: TraceAbstraction took 21480.41ms. Allocated memory was 231.7MB in the beginning and 402.7MB in the end (delta: 170.9MB). Free memory was 91.3MB in the beginning and 169.2MB in the end (delta: -77.9MB). Peak memory consumption was 105.0MB. Max. memory is 8.0GB. [2022-01-10 00:13:00,242 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.12ms. Allocated memory is still 175.1MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 569.30ms. Allocated memory was 175.1MB in the beginning and 231.7MB in the end (delta: 56.6MB). Free memory was 117.8MB in the beginning and 182.0MB in the end (delta: -64.2MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 115.36ms. Allocated memory is still 231.7MB. Free memory was 182.0MB in the beginning and 172.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 95.44ms. Allocated memory is still 231.7MB. Free memory was 172.6MB in the beginning and 166.8MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1130.14ms. Allocated memory is still 231.7MB. Free memory was 166.8MB in the beginning and 91.9MB in the end (delta: 75.0MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. * TraceAbstraction took 21480.41ms. Allocated memory was 231.7MB in the beginning and 402.7MB in the end (delta: 170.9MB). Free memory was 91.3MB in the beginning and 169.2MB in the end (delta: -77.9MB). Peak memory consumption was 105.0MB. 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: 167]: 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: 21.4s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2055 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2055 mSDsluCounter, 1645 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 1011 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8281 IncrementalHoareTripleChecker+Invalid, 9292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1011 mSolverCounterUnsat, 1557 mSDtfsCounter, 8281 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3013 GetRequests, 2971 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5344occurred in iteration=14, 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.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 3210 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 65 NumberOfFragments, 95 HoareAnnotationTreeSize, 3 FomulaSimplifications, 722 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3728 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 9794 NumberOfCodeBlocks, 9794 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 9772 ConstructedInterpolants, 0 QuantifiedInterpolants, 39883 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3849 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 16272/17330 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: ((((6 <= 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: ((((6 <= 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:13:00,262 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...