/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/Problem13_label51.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:11:55,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:11:55,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:11:55,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:11:55,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:11:55,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:11:55,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:11:55,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:11:55,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:11:55,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:11:55,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:11:55,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:11:55,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:11:55,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:11:55,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:11:55,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:11:55,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:11:55,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:11:55,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:11:55,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:11:55,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:11:55,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:11:55,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:11:55,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:11:55,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:11:55,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:11:55,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:11:55,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:11:55,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:11:55,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:11:55,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:11:55,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:11:55,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:11:55,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:11:55,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:11:55,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:11:55,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:11:55,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:11:55,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:11:55,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:11:55,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:11:55,956 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:11:55,982 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:11:55,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:11:55,982 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:11:55,982 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:11:55,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:11:55,983 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:11:55,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:11:55,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:11:55,984 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:11:55,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:11:55,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:11:55,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:11:55,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:11:55,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:11:55,985 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:11:55,985 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:11:55,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:11:55,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:11:55,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:11:55,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:11:55,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:11:55,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:11:55,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:11:55,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:11:55,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:11:55,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:11:55,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:11:55,987 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:11:55,987 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:11:55,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:11:55,988 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:11:56,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:11:56,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:11:56,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:11:56,225 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:11:56,228 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:11:56,229 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label51.c [2022-01-10 00:11:56,271 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e286b740a/dcfa39830e5b45c1adb05da505b2cf95/FLAG7792c4694 [2022-01-10 00:11:56,827 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:11:56,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label51.c [2022-01-10 00:11:56,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e286b740a/dcfa39830e5b45c1adb05da505b2cf95/FLAG7792c4694 [2022-01-10 00:11:57,001 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e286b740a/dcfa39830e5b45c1adb05da505b2cf95 [2022-01-10 00:11:57,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:11:57,005 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:11:57,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:11:57,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:11:57,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:11:57,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:11:57" (1/1) ... [2022-01-10 00:11:57,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@477bc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:57, skipping insertion in model container [2022-01-10 00:11:57,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:11:57" (1/1) ... [2022-01-10 00:11:57,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:11:57,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:11:57,348 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/Problem13_label51.c[3668,3681] [2022-01-10 00:11:57,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:11:57,960 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:11:57,983 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/Problem13_label51.c[3668,3681] [2022-01-10 00:11:58,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:11:58,377 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:11:58,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:58 WrapperNode [2022-01-10 00:11:58,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:11:58,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:11:58,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:11:58,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:11:58,385 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:11:58" (1/1) ... [2022-01-10 00:11:58,438 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:11:58" (1/1) ... [2022-01-10 00:11:58,872 INFO L137 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5583 [2022-01-10 00:11:58,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:11:58,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:11:58,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:11:58,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:11:58,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:58" (1/1) ... [2022-01-10 00:11:58,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:58" (1/1) ... [2022-01-10 00:11:59,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:58" (1/1) ... [2022-01-10 00:11:59,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:58" (1/1) ... [2022-01-10 00:11:59,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:58" (1/1) ... [2022-01-10 00:11:59,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:58" (1/1) ... [2022-01-10 00:11:59,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:58" (1/1) ... [2022-01-10 00:11:59,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:11:59,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:11:59,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:11:59,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:11:59,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:58" (1/1) ... [2022-01-10 00:11:59,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:11:59,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:11:59,369 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:11:59,402 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:11:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:11:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:11:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:11:59,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:11:59,484 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:11:59,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:12:03,788 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:12:03,802 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:12:03,803 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:12:03,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:12:03 BoogieIcfgContainer [2022-01-10 00:12:03,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:12:03,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:12:03,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:12:03,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:12:03,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:11:57" (1/3) ... [2022-01-10 00:12:03,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c17444c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:12:03, skipping insertion in model container [2022-01-10 00:12:03,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:11:58" (2/3) ... [2022-01-10 00:12:03,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c17444c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:12:03, skipping insertion in model container [2022-01-10 00:12:03,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:12:03" (3/3) ... [2022-01-10 00:12:03,812 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem13_label51.c [2022-01-10 00:12:03,817 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:12:03,817 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:12:03,864 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:12:03,869 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:03,870 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:12:03,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 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:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 00:12:03,904 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:03,904 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] [2022-01-10 00:12:03,905 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:03,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:03,910 INFO L85 PathProgramCache]: Analyzing trace with hash -593706766, now seen corresponding path program 1 times [2022-01-10 00:12:03,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:03,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350677844] [2022-01-10 00:12:03,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:03,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:04,157 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:04,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:04,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350677844] [2022-01-10 00:12:04,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350677844] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:04,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:04,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:12:04,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979521554] [2022-01-10 00:12:04,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:04,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:04,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:04,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:04,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:04,196 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 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 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:08,222 INFO L93 Difference]: Finished difference Result 3147 states and 5806 transitions. [2022-01-10 00:12:08,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:08,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2022-01-10 00:12:08,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:08,246 INFO L225 Difference]: With dead ends: 3147 [2022-01-10 00:12:08,247 INFO L226 Difference]: Without dead ends: 1964 [2022-01-10 00:12:08,254 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:08,257 INFO L933 BasicCegarLoop]: 764 mSDtfsCounter, 1155 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:08,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1155 Valid, 992 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-01-10 00:12:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2022-01-10 00:12:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2022-01-10 00:12:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 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:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2022-01-10 00:12:08,379 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 24 [2022-01-10 00:12:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:08,380 INFO L470 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2022-01-10 00:12:08,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2022-01-10 00:12:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-01-10 00:12:08,382 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:08,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:12:08,383 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:08,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1083970155, now seen corresponding path program 1 times [2022-01-10 00:12:08,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:08,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227644449] [2022-01-10 00:12:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:08,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:12:08,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:08,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227644449] [2022-01-10 00:12:08,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227644449] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:08,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:08,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:12:08,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744631434] [2022-01-10 00:12:08,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:08,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:08,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:08,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:08,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:08,488 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:12,376 INFO L93 Difference]: Finished difference Result 5542 states and 9222 transitions. [2022-01-10 00:12:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:12,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 95 [2022-01-10 00:12:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:12,391 INFO L225 Difference]: With dead ends: 5542 [2022-01-10 00:12:12,392 INFO L226 Difference]: Without dead ends: 3593 [2022-01-10 00:12:12,396 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:12,397 INFO L933 BasicCegarLoop]: 872 mSDtfsCounter, 924 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:12,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [924 Valid, 1009 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-01-10 00:12:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2022-01-10 00:12:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3581. [2022-01-10 00:12:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 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:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2022-01-10 00:12:12,482 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 95 [2022-01-10 00:12:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:12,485 INFO L470 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2022-01-10 00:12:12,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2022-01-10 00:12:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-10 00:12:12,492 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:12,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:12:12,493 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:12,493 INFO L85 PathProgramCache]: Analyzing trace with hash 19544424, now seen corresponding path program 1 times [2022-01-10 00:12:12,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:12,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186949349] [2022-01-10 00:12:12,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:12,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:12:12,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:12,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186949349] [2022-01-10 00:12:12,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186949349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:12,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:12,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:12:12,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134704353] [2022-01-10 00:12:12,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:12,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:12,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:12,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:12,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:12,582 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:16,551 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2022-01-10 00:12:16,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:16,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 109 [2022-01-10 00:12:16,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:16,580 INFO L225 Difference]: With dead ends: 10352 [2022-01-10 00:12:16,580 INFO L226 Difference]: Without dead ends: 6773 [2022-01-10 00:12:16,587 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:16,589 INFO L933 BasicCegarLoop]: 1021 mSDtfsCounter, 785 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:16,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [785 Valid, 1172 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-01-10 00:12:16,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2022-01-10 00:12:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2022-01-10 00:12:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 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:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 8943 transitions. [2022-01-10 00:12:16,743 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 8943 transitions. Word has length 109 [2022-01-10 00:12:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:16,744 INFO L470 AbstractCegarLoop]: Abstraction has 6749 states and 8943 transitions. [2022-01-10 00:12:16,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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:16,745 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 8943 transitions. [2022-01-10 00:12:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-01-10 00:12:16,749 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:16,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:12:16,750 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:16,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1515792606, now seen corresponding path program 1 times [2022-01-10 00:12:16,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:16,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502704161] [2022-01-10 00:12:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:16,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:12:16,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:16,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502704161] [2022-01-10 00:12:16,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502704161] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:16,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:16,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:12:16,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699145168] [2022-01-10 00:12:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:16,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:16,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:16,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:16,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:16,926 INFO L87 Difference]: Start difference. First operand 6749 states and 8943 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:20,582 INFO L93 Difference]: Finished difference Result 19804 states and 26220 transitions. [2022-01-10 00:12:20,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:20,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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 138 [2022-01-10 00:12:20,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:20,631 INFO L225 Difference]: With dead ends: 19804 [2022-01-10 00:12:20,631 INFO L226 Difference]: Without dead ends: 13057 [2022-01-10 00:12:20,645 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:20,646 INFO L933 BasicCegarLoop]: 883 mSDtfsCounter, 865 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:20,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 1035 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-01-10 00:12:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13057 states. [2022-01-10 00:12:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13057 to 13052. [2022-01-10 00:12:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13052 states, 13051 states have (on average 1.217914336066202) internal successors, (15895), 13051 states have internal predecessors, (15895), 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:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13052 states to 13052 states and 15895 transitions. [2022-01-10 00:12:20,955 INFO L78 Accepts]: Start accepts. Automaton has 13052 states and 15895 transitions. Word has length 138 [2022-01-10 00:12:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:20,957 INFO L470 AbstractCegarLoop]: Abstraction has 13052 states and 15895 transitions. [2022-01-10 00:12:20,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 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:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 13052 states and 15895 transitions. [2022-01-10 00:12:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-01-10 00:12:20,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:20,962 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:12:20,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:12:20,962 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:20,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:20,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1481177967, now seen corresponding path program 1 times [2022-01-10 00:12:20,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:20,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968393498] [2022-01-10 00:12:20,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:20,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-10 00:12:21,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:21,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968393498] [2022-01-10 00:12:21,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968393498] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:21,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:21,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:12:21,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880718710] [2022-01-10 00:12:21,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:21,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:21,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:21,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:21,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:21,188 INFO L87 Difference]: Start difference. First operand 13052 states and 15895 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 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:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:24,353 INFO L93 Difference]: Finished difference Result 26889 states and 32590 transitions. [2022-01-10 00:12:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:24,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 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 216 [2022-01-10 00:12:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:24,396 INFO L225 Difference]: With dead ends: 26889 [2022-01-10 00:12:24,397 INFO L226 Difference]: Without dead ends: 13839 [2022-01-10 00:12:24,412 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:24,413 INFO L933 BasicCegarLoop]: 1084 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:24,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 1213 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-10 00:12:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13839 states. [2022-01-10 00:12:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13839 to 13839. [2022-01-10 00:12:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13839 states, 13838 states have (on average 1.2058823529411764) internal successors, (16687), 13838 states have internal predecessors, (16687), 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:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13839 states to 13839 states and 16687 transitions. [2022-01-10 00:12:24,630 INFO L78 Accepts]: Start accepts. Automaton has 13839 states and 16687 transitions. Word has length 216 [2022-01-10 00:12:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:24,630 INFO L470 AbstractCegarLoop]: Abstraction has 13839 states and 16687 transitions. [2022-01-10 00:12:24,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 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:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 13839 states and 16687 transitions. [2022-01-10 00:12:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-01-10 00:12:24,633 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:24,634 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:12:24,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:12:24,634 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1840123782, now seen corresponding path program 1 times [2022-01-10 00:12:24,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:24,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576325018] [2022-01-10 00:12:24,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:24,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:12:24,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:24,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576325018] [2022-01-10 00:12:24,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576325018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:24,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:24,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:24,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286941715] [2022-01-10 00:12:24,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:24,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:24,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:24,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:24,770 INFO L87 Difference]: Start difference. First operand 13839 states and 16687 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:28,552 INFO L93 Difference]: Finished difference Result 33200 states and 41058 transitions. [2022-01-10 00:12:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:28,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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 223 [2022-01-10 00:12:28,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:28,591 INFO L225 Difference]: With dead ends: 33200 [2022-01-10 00:12:28,591 INFO L226 Difference]: Without dead ends: 20150 [2022-01-10 00:12:28,607 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:28,608 INFO L933 BasicCegarLoop]: 823 mSDtfsCounter, 861 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:28,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 943 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-01-10 00:12:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20150 states. [2022-01-10 00:12:28,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20150 to 20140. [2022-01-10 00:12:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20140 states, 20139 states have (on average 1.1898803316947217) internal successors, (23963), 20139 states have internal predecessors, (23963), 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:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20140 states to 20140 states and 23963 transitions. [2022-01-10 00:12:28,908 INFO L78 Accepts]: Start accepts. Automaton has 20140 states and 23963 transitions. Word has length 223 [2022-01-10 00:12:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:28,909 INFO L470 AbstractCegarLoop]: Abstraction has 20140 states and 23963 transitions. [2022-01-10 00:12:28,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 20140 states and 23963 transitions. [2022-01-10 00:12:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-01-10 00:12:28,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:28,916 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:12:28,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:12:28,917 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:28,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash -175401069, now seen corresponding path program 1 times [2022-01-10 00:12:28,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:28,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462825786] [2022-01-10 00:12:28,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:28,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:12:29,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:29,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462825786] [2022-01-10 00:12:29,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462825786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:29,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:29,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:29,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141962930] [2022-01-10 00:12:29,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:29,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:29,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:29,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:29,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:29,036 INFO L87 Difference]: Start difference. First operand 20140 states and 23963 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:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:32,599 INFO L93 Difference]: Finished difference Result 39361 states and 46953 transitions. [2022-01-10 00:12:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:32,601 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 238 [2022-01-10 00:12:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:32,634 INFO L225 Difference]: With dead ends: 39361 [2022-01-10 00:12:32,635 INFO L226 Difference]: Without dead ends: 20010 [2022-01-10 00:12:32,653 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:32,654 INFO L933 BasicCegarLoop]: 1505 mSDtfsCounter, 1037 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:32,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1037 Valid, 1642 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-01-10 00:12:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20010 states. [2022-01-10 00:12:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20010 to 19220. [2022-01-10 00:12:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19220 states, 19219 states have (on average 1.1321608824600655) internal successors, (21759), 19219 states have internal predecessors, (21759), 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:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19220 states to 19220 states and 21759 transitions. [2022-01-10 00:12:32,901 INFO L78 Accepts]: Start accepts. Automaton has 19220 states and 21759 transitions. Word has length 238 [2022-01-10 00:12:32,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:32,902 INFO L470 AbstractCegarLoop]: Abstraction has 19220 states and 21759 transitions. [2022-01-10 00:12:32,902 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:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 19220 states and 21759 transitions. [2022-01-10 00:12:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2022-01-10 00:12:32,909 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:32,910 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:12:32,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:12:32,910 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:32,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:32,911 INFO L85 PathProgramCache]: Analyzing trace with hash -523861264, now seen corresponding path program 1 times [2022-01-10 00:12:32,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:32,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134350873] [2022-01-10 00:12:32,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:32,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-01-10 00:12:33,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:33,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134350873] [2022-01-10 00:12:33,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134350873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:33,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:33,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:33,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109200041] [2022-01-10 00:12:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:33,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:33,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:33,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:33,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:33,061 INFO L87 Difference]: Start difference. First operand 19220 states and 21759 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) 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:36,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:36,905 INFO L93 Difference]: Finished difference Result 43955 states and 50452 transitions. [2022-01-10 00:12:36,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:36,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) 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 312 [2022-01-10 00:12:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:36,951 INFO L225 Difference]: With dead ends: 43955 [2022-01-10 00:12:36,951 INFO L226 Difference]: Without dead ends: 25524 [2022-01-10 00:12:36,969 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:36,970 INFO L933 BasicCegarLoop]: 1777 mSDtfsCounter, 844 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 3252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:36,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [844 Valid, 1919 Invalid, 3252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-01-10 00:12:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25524 states. [2022-01-10 00:12:37,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25524 to 24733. [2022-01-10 00:12:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24733 states, 24732 states have (on average 1.118591298722303) internal successors, (27665), 24732 states have internal predecessors, (27665), 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:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24733 states to 24733 states and 27665 transitions. [2022-01-10 00:12:37,483 INFO L78 Accepts]: Start accepts. Automaton has 24733 states and 27665 transitions. Word has length 312 [2022-01-10 00:12:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:37,485 INFO L470 AbstractCegarLoop]: Abstraction has 24733 states and 27665 transitions. [2022-01-10 00:12:37,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) 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:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 24733 states and 27665 transitions. [2022-01-10 00:12:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-01-10 00:12:37,489 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:37,490 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:12:37,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 00:12:37,491 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:37,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:37,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1968174890, now seen corresponding path program 1 times [2022-01-10 00:12:37,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:37,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200974645] [2022-01-10 00:12:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:37,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-10 00:12:37,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:37,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200974645] [2022-01-10 00:12:37,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200974645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:37,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:37,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:12:37,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823727502] [2022-01-10 00:12:37,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:37,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:12:37,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:37,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:12:37,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:12:37,613 INFO L87 Difference]: Start difference. First operand 24733 states and 27665 transitions. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 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,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:45,128 INFO L93 Difference]: Finished difference Result 91374 states and 102286 transitions. [2022-01-10 00:12:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:12:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 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 321 [2022-01-10 00:12:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:45,234 INFO L225 Difference]: With dead ends: 91374 [2022-01-10 00:12:45,234 INFO L226 Difference]: Without dead ends: 67430 [2022-01-10 00:12:45,266 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:45,266 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 1715 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 5999 mSolverCounterSat, 1099 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 7098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1099 IncrementalHoareTripleChecker+Valid, 5999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:45,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1715 Valid, 764 Invalid, 7098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1099 Valid, 5999 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-01-10 00:12:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67430 states. [2022-01-10 00:12:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67430 to 64161. [2022-01-10 00:12:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64161 states, 64160 states have (on average 1.1056577306733166) internal successors, (70939), 64160 states have internal predecessors, (70939), 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:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64161 states to 64161 states and 70939 transitions. [2022-01-10 00:12:46,024 INFO L78 Accepts]: Start accepts. Automaton has 64161 states and 70939 transitions. Word has length 321 [2022-01-10 00:12:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:46,024 INFO L470 AbstractCegarLoop]: Abstraction has 64161 states and 70939 transitions. [2022-01-10 00:12:46,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 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:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 64161 states and 70939 transitions. [2022-01-10 00:12:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2022-01-10 00:12:46,028 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:46,028 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-01-10 00:12:46,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 00:12:46,029 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:46,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash -752409273, now seen corresponding path program 1 times [2022-01-10 00:12:46,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:46,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63495138] [2022-01-10 00:12:46,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:46,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-01-10 00:12:46,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:46,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63495138] [2022-01-10 00:12:46,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63495138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:46,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:12:46,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:12:46,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641197606] [2022-01-10 00:12:46,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:46,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:46,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:46,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:46,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:12:46,140 INFO L87 Difference]: Start difference. First operand 64161 states and 70939 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 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,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:50,185 INFO L93 Difference]: Finished difference Result 140934 states and 155366 transitions. [2022-01-10 00:12:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:50,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 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 350 [2022-01-10 00:12:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:50,311 INFO L225 Difference]: With dead ends: 140934 [2022-01-10 00:12:50,312 INFO L226 Difference]: Without dead ends: 76775 [2022-01-10 00:12:50,417 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:50,418 INFO L933 BasicCegarLoop]: 1000 mSDtfsCounter, 728 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:50,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [728 Valid, 1175 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-10 00:12:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76775 states. [2022-01-10 00:12:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76775 to 75190. [2022-01-10 00:12:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75190 states, 75189 states have (on average 1.0959847850084454) internal successors, (82406), 75189 states have internal predecessors, (82406), 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,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75190 states to 75190 states and 82406 transitions. [2022-01-10 00:12:51,307 INFO L78 Accepts]: Start accepts. Automaton has 75190 states and 82406 transitions. Word has length 350 [2022-01-10 00:12:51,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:51,308 INFO L470 AbstractCegarLoop]: Abstraction has 75190 states and 82406 transitions. [2022-01-10 00:12:51,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 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,308 INFO L276 IsEmpty]: Start isEmpty. Operand 75190 states and 82406 transitions. [2022-01-10 00:12:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2022-01-10 00:12:51,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:51,312 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 00:12:51,313 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:51,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:51,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1408305103, now seen corresponding path program 1 times [2022-01-10 00:12:51,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:51,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22070428] [2022-01-10 00:12:51,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:51,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 266 proven. 113 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-10 00:12:51,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:51,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22070428] [2022-01-10 00:12:51,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22070428] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:12:51,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444430750] [2022-01-10 00:12:51,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:51,692 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:12:51,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:12:51,705 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:51,706 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:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:51,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:12:51,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:12:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-01-10 00:12:52,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:12:52,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444430750] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:52,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:12:52,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-01-10 00:12:52,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167869192] [2022-01-10 00:12:52,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:52,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:52,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:52,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:12:52,388 INFO L87 Difference]: Start difference. First operand 75190 states and 82406 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:12:55,534 INFO L93 Difference]: Finished difference Result 151934 states and 166950 transitions. [2022-01-10 00:12:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:12:55,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 379 [2022-01-10 00:12:55,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:12:55,663 INFO L225 Difference]: With dead ends: 151934 [2022-01-10 00:12:55,664 INFO L226 Difference]: Without dead ends: 88562 [2022-01-10 00:12:55,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:12:55,706 INFO L933 BasicCegarLoop]: 1739 mSDtfsCounter, 872 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:12:55,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [872 Valid, 1868 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 00:12:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88562 states. [2022-01-10 00:12:56,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88562 to 79901. [2022-01-10 00:12:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79901 states, 79900 states have (on average 1.0907259073842304) internal successors, (87149), 79900 states have internal predecessors, (87149), 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:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79901 states to 79901 states and 87149 transitions. [2022-01-10 00:12:56,882 INFO L78 Accepts]: Start accepts. Automaton has 79901 states and 87149 transitions. Word has length 379 [2022-01-10 00:12:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:12:56,883 INFO L470 AbstractCegarLoop]: Abstraction has 79901 states and 87149 transitions. [2022-01-10 00:12:56,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 79901 states and 87149 transitions. [2022-01-10 00:12:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2022-01-10 00:12:56,896 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:12:56,896 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 00:12:57,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 00:12:57,115 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:12:57,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:12:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1885680466, now seen corresponding path program 1 times [2022-01-10 00:12:57,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:12:57,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119999845] [2022-01-10 00:12:57,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:57,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:12:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 281 proven. 113 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-10 00:12:57,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:12:57,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119999845] [2022-01-10 00:12:57,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119999845] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:12:57,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123658029] [2022-01-10 00:12:57,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:12:57,521 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:12:57,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:12:57,522 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:57,523 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:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:12:57,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:12:57,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:12:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-01-10 00:12:58,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:12:58,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123658029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:12:58,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:12:58,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2022-01-10 00:12:58,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575399152] [2022-01-10 00:12:58,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:12:58,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:12:58,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:12:58,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:12:58,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:12:58,306 INFO L87 Difference]: Start difference. First operand 79901 states and 87149 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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)