/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/Problem11_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:01:58,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:01:58,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:01:58,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:01:58,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:01:58,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:01:58,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:01:58,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:01:58,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:01:58,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:01:58,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:01:58,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:01:58,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:01:58,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:01:58,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:01:58,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:01:58,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:01:58,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:01:58,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:01:58,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:01:58,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:01:58,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:01:58,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:01:58,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:01:58,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:01:58,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:01:58,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:01:58,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:01:58,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:01:58,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:01:58,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:01:58,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:01:58,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:01:58,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:01:58,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:01:58,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:01:58,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:01:58,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:01:58,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:01:58,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:01:58,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:01:58,108 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:01:58,133 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:01:58,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:01:58,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:01:58,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:01:58,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:01:58,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:01:58,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:01:58,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:01:58,135 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:01:58,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:01:58,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:01:58,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:01:58,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:01:58,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:01:58,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:01:58,136 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:01:58,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:01:58,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:01:58,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:01:58,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:01:58,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:01:58,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:01:58,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:01:58,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:01:58,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:01:58,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:01:58,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:01:58,137 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:01:58,137 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:01:58,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:01:58,137 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:01:58,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:01:58,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:01:58,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:01:58,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:01:58,339 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:01:58,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label24.c [2022-01-10 00:01:58,397 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed04352e4/0b1af4f8e9df427aaddfbe40d952e1b2/FLAG402412e9d [2022-01-10 00:01:58,802 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:01:58,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label24.c [2022-01-10 00:01:58,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed04352e4/0b1af4f8e9df427aaddfbe40d952e1b2/FLAG402412e9d [2022-01-10 00:01:59,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed04352e4/0b1af4f8e9df427aaddfbe40d952e1b2 [2022-01-10 00:01:59,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:01:59,150 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:01:59,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:01:59,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:01:59,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:01:59,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:01:59" (1/1) ... [2022-01-10 00:01:59,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2645b8f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:01:59, skipping insertion in model container [2022-01-10 00:01:59,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:01:59" (1/1) ... [2022-01-10 00:01:59,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:01:59,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:01:59,372 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/Problem11_label24.c[7451,7464] [2022-01-10 00:01:59,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:01:59,534 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:01:59,552 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/Problem11_label24.c[7451,7464] [2022-01-10 00:01:59,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:01:59,677 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:01:59,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:01:59 WrapperNode [2022-01-10 00:01:59,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:01:59,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:01:59,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:01:59,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:01:59,684 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:01:59" (1/1) ... [2022-01-10 00:01:59,699 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:01:59" (1/1) ... [2022-01-10 00:01:59,776 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2022-01-10 00:01:59,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:01:59,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:01:59,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:01:59,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:01:59,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:01:59" (1/1) ... [2022-01-10 00:01:59,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:01:59" (1/1) ... [2022-01-10 00:01:59,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:01:59" (1/1) ... [2022-01-10 00:01:59,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:01:59" (1/1) ... [2022-01-10 00:01:59,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:01:59" (1/1) ... [2022-01-10 00:01:59,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:01:59" (1/1) ... [2022-01-10 00:01:59,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:01:59" (1/1) ... [2022-01-10 00:01:59,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:01:59,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:01:59,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:01:59,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:01:59,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:01:59" (1/1) ... [2022-01-10 00:01:59,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:01:59,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:01:59,897 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:01:59,899 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:01:59,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:01:59,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:01:59,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:01:59,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:01:59,973 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:01:59,974 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:02:01,108 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:02:01,115 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:02:01,115 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:02:01,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:02:01 BoogieIcfgContainer [2022-01-10 00:02:01,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:02:01,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:02:01,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:02:01,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:02:01,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:01:59" (1/3) ... [2022-01-10 00:02:01,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cb8e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:02:01, skipping insertion in model container [2022-01-10 00:02:01,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:01:59" (2/3) ... [2022-01-10 00:02:01,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cb8e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:02:01, skipping insertion in model container [2022-01-10 00:02:01,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:02:01" (3/3) ... [2022-01-10 00:02:01,123 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label24.c [2022-01-10 00:02:01,127 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:02:01,127 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:02:01,165 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:02:01,170 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:02:01,170 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:02:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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:02:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 00:02:01,192 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:01,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:01,193 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:01,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:01,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2122806209, now seen corresponding path program 1 times [2022-01-10 00:02:01,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:01,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878110177] [2022-01-10 00:02:01,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:01,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:01,420 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:02:01,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:01,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878110177] [2022-01-10 00:02:01,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878110177] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:01,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:01,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:02:01,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458507043] [2022-01-10 00:02:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:01,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:01,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:01,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:01,468 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:02:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:02,341 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2022-01-10 00:02:02,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-10 00:02:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:02,356 INFO L225 Difference]: With dead ends: 776 [2022-01-10 00:02:02,356 INFO L226 Difference]: Without dead ends: 413 [2022-01-10 00:02:02,359 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:02:02,361 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 176 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:02,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 00:02:02,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-01-10 00:02:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2022-01-10 00:02:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 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:02:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2022-01-10 00:02:02,405 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 51 [2022-01-10 00:02:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:02,405 INFO L470 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2022-01-10 00:02:02,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:02:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2022-01-10 00:02:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-10 00:02:02,408 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:02,408 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:02,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:02:02,408 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1424628072, now seen corresponding path program 1 times [2022-01-10 00:02:02,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:02,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038076802] [2022-01-10 00:02:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:02,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:02,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:02,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038076802] [2022-01-10 00:02:02,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038076802] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:02,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:02,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:02:02,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493493856] [2022-01-10 00:02:02,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:02,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:02,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:02,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:02,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:02,517 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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:02:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:03,175 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2022-01-10 00:02:03,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:03,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 119 [2022-01-10 00:02:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:03,178 INFO L225 Difference]: With dead ends: 1209 [2022-01-10 00:02:03,178 INFO L226 Difference]: Without dead ends: 800 [2022-01-10 00:02:03,180 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:02:03,180 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:03,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:02:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-01-10 00:02:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2022-01-10 00:02:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 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:02:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2022-01-10 00:02:03,205 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 119 [2022-01-10 00:02:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:03,205 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2022-01-10 00:02:03,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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:02:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2022-01-10 00:02:03,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 00:02:03,208 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:03,209 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:03,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:02:03,209 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:03,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:03,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1033925576, now seen corresponding path program 1 times [2022-01-10 00:02:03,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:03,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024891039] [2022-01-10 00:02:03,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:03,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:03,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:03,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024891039] [2022-01-10 00:02:03,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024891039] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:03,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:03,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:02:03,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242521388] [2022-01-10 00:02:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:03,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:03,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:03,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:03,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:03,315 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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:02:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:03,914 INFO L93 Difference]: Finished difference Result 1942 states and 2631 transitions. [2022-01-10 00:02:03,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:03,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 120 [2022-01-10 00:02:03,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:03,922 INFO L225 Difference]: With dead ends: 1942 [2022-01-10 00:02:03,922 INFO L226 Difference]: Without dead ends: 1157 [2022-01-10 00:02:03,924 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:02:03,926 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:03,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:02:03,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-01-10 00:02:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2022-01-10 00:02:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277922077922078) internal successors, (1476), 1155 states have internal predecessors, (1476), 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:02:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1476 transitions. [2022-01-10 00:02:03,949 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1476 transitions. Word has length 120 [2022-01-10 00:02:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:03,951 INFO L470 AbstractCegarLoop]: Abstraction has 1156 states and 1476 transitions. [2022-01-10 00:02:03,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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:02:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1476 transitions. [2022-01-10 00:02:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 00:02:03,955 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:03,955 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:03,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:02:03,956 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:03,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash -289166940, now seen corresponding path program 1 times [2022-01-10 00:02:03,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:03,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713352086] [2022-01-10 00:02:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:03,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:04,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:04,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713352086] [2022-01-10 00:02:04,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713352086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:04,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:04,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:04,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496037287] [2022-01-10 00:02:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:04,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:04,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:04,072 INFO L87 Difference]: Start difference. First operand 1156 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:02:04,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:04,737 INFO L93 Difference]: Finished difference Result 2691 states and 3515 transitions. [2022-01-10 00:02:04,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:04,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 163 [2022-01-10 00:02:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:04,744 INFO L225 Difference]: With dead ends: 2691 [2022-01-10 00:02:04,745 INFO L226 Difference]: Without dead ends: 1721 [2022-01-10 00:02:04,746 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:02:04,754 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 155 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:04,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 336 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:02:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2022-01-10 00:02:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1528. [2022-01-10 00:02:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1527 states have (on average 1.261296660117878) internal successors, (1926), 1527 states have internal predecessors, (1926), 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:02:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1926 transitions. [2022-01-10 00:02:04,781 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1926 transitions. Word has length 163 [2022-01-10 00:02:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:04,783 INFO L470 AbstractCegarLoop]: Abstraction has 1528 states and 1926 transitions. [2022-01-10 00:02:04,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:02:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1926 transitions. [2022-01-10 00:02:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-10 00:02:04,785 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:04,785 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:04,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:02:04,786 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:04,789 INFO L85 PathProgramCache]: Analyzing trace with hash -933543605, now seen corresponding path program 1 times [2022-01-10 00:02:04,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:04,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732278832] [2022-01-10 00:02:04,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:04,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:04,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:04,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732278832] [2022-01-10 00:02:04,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732278832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:04,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:04,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:02:04,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6438604] [2022-01-10 00:02:04,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:04,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:04,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:04,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:04,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:04,919 INFO L87 Difference]: Start difference. First operand 1528 states and 1926 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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:02:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:05,481 INFO L93 Difference]: Finished difference Result 4158 states and 5316 transitions. [2022-01-10 00:02:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:05,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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 178 [2022-01-10 00:02:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:05,489 INFO L225 Difference]: With dead ends: 4158 [2022-01-10 00:02:05,489 INFO L226 Difference]: Without dead ends: 2632 [2022-01-10 00:02:05,491 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:02:05,491 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:05,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 155 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:02:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2022-01-10 00:02:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 2448. [2022-01-10 00:02:05,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 2447 states have (on average 1.2174090723334696) internal successors, (2979), 2447 states have internal predecessors, (2979), 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:02:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 2979 transitions. [2022-01-10 00:02:05,525 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 2979 transitions. Word has length 178 [2022-01-10 00:02:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:05,526 INFO L470 AbstractCegarLoop]: Abstraction has 2448 states and 2979 transitions. [2022-01-10 00:02:05,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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:02:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 2979 transitions. [2022-01-10 00:02:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-01-10 00:02:05,528 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:05,528 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:05,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:02:05,528 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:05,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1329847317, now seen corresponding path program 1 times [2022-01-10 00:02:05,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:05,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182701156] [2022-01-10 00:02:05,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:05,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-01-10 00:02:05,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:05,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182701156] [2022-01-10 00:02:05,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182701156] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:05,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:05,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:02:05,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294133564] [2022-01-10 00:02:05,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:05,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:05,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:05,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:05,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:05,621 INFO L87 Difference]: Start difference. First operand 2448 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 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:02:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:06,116 INFO L93 Difference]: Finished difference Result 5452 states and 6620 transitions. [2022-01-10 00:02:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:06,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 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 194 [2022-01-10 00:02:06,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:06,124 INFO L225 Difference]: With dead ends: 5452 [2022-01-10 00:02:06,124 INFO L226 Difference]: Without dead ends: 3006 [2022-01-10 00:02:06,126 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:02:06,127 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 75 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:06,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 154 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:02:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2022-01-10 00:02:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 3005. [2022-01-10 00:02:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3005 states, 3004 states have (on average 1.2113848202396804) internal successors, (3639), 3004 states have internal predecessors, (3639), 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:02:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 3639 transitions. [2022-01-10 00:02:06,166 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 3639 transitions. Word has length 194 [2022-01-10 00:02:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:06,167 INFO L470 AbstractCegarLoop]: Abstraction has 3005 states and 3639 transitions. [2022-01-10 00:02:06,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 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:02:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 3639 transitions. [2022-01-10 00:02:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-10 00:02:06,169 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:06,169 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:06,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:02:06,169 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:06,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:06,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1440418757, now seen corresponding path program 1 times [2022-01-10 00:02:06,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:06,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665369905] [2022-01-10 00:02:06,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:06,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:06,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:06,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665369905] [2022-01-10 00:02:06,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665369905] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:06,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:06,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:02:06,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73498604] [2022-01-10 00:02:06,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:06,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:02:06,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:02:06,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:02:06,270 INFO L87 Difference]: Start difference. First operand 3005 states and 3639 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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:02:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:07,369 INFO L93 Difference]: Finished difference Result 8783 states and 10795 transitions. [2022-01-10 00:02:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:02:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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 232 [2022-01-10 00:02:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:07,385 INFO L225 Difference]: With dead ends: 8783 [2022-01-10 00:02:07,386 INFO L226 Difference]: Without dead ends: 5780 [2022-01-10 00:02:07,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:02:07,391 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 319 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:07,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 119 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 00:02:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5780 states. [2022-01-10 00:02:07,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5780 to 5404. [2022-01-10 00:02:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5404 states, 5403 states have (on average 1.2121043864519712) internal successors, (6549), 5403 states have internal predecessors, (6549), 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:02:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 6549 transitions. [2022-01-10 00:02:07,469 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 6549 transitions. Word has length 232 [2022-01-10 00:02:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:07,469 INFO L470 AbstractCegarLoop]: Abstraction has 5404 states and 6549 transitions. [2022-01-10 00:02:07,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 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:02:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 6549 transitions. [2022-01-10 00:02:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-01-10 00:02:07,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:07,471 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:07,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:02:07,472 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:07,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1400544816, now seen corresponding path program 1 times [2022-01-10 00:02:07,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:07,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265310541] [2022-01-10 00:02:07,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:07,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-01-10 00:02:07,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:07,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265310541] [2022-01-10 00:02:07,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265310541] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:07,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:07,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:07,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664802358] [2022-01-10 00:02:07,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:07,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:07,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:07,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:07,591 INFO L87 Difference]: Start difference. First operand 5404 states and 6549 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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:02:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:08,371 INFO L93 Difference]: Finished difference Result 11919 states and 14623 transitions. [2022-01-10 00:02:08,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:08,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 233 [2022-01-10 00:02:08,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:08,396 INFO L225 Difference]: With dead ends: 11919 [2022-01-10 00:02:08,396 INFO L226 Difference]: Without dead ends: 6885 [2022-01-10 00:02:08,404 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:02:08,404 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 146 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:08,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 390 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 00:02:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6885 states. [2022-01-10 00:02:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6885 to 6692. [2022-01-10 00:02:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6692 states, 6691 states have (on average 1.1927962935286205) internal successors, (7981), 6691 states have internal predecessors, (7981), 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:02:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6692 states to 6692 states and 7981 transitions. [2022-01-10 00:02:08,516 INFO L78 Accepts]: Start accepts. Automaton has 6692 states and 7981 transitions. Word has length 233 [2022-01-10 00:02:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:08,517 INFO L470 AbstractCegarLoop]: Abstraction has 6692 states and 7981 transitions. [2022-01-10 00:02:08,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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:02:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 6692 states and 7981 transitions. [2022-01-10 00:02:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-01-10 00:02:08,521 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:08,521 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:08,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 00:02:08,521 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash 826529202, now seen corresponding path program 1 times [2022-01-10 00:02:08,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:08,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401576977] [2022-01-10 00:02:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:08,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:08,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:08,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401576977] [2022-01-10 00:02:08,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401576977] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:08,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:08,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:08,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849058558] [2022-01-10 00:02:08,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:08,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:02:08,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:08,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:02:08,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:02:08,613 INFO L87 Difference]: Start difference. First operand 6692 states and 7981 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 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:02:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:09,722 INFO L93 Difference]: Finished difference Result 14861 states and 17819 transitions. [2022-01-10 00:02:09,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:02:09,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 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 243 [2022-01-10 00:02:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:09,747 INFO L225 Difference]: With dead ends: 14861 [2022-01-10 00:02:09,748 INFO L226 Difference]: Without dead ends: 8539 [2022-01-10 00:02:09,755 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:02:09,755 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 254 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:09,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 141 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 00:02:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8539 states. [2022-01-10 00:02:09,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8539 to 8534. [2022-01-10 00:02:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8534 states, 8533 states have (on average 1.1736786593226298) internal successors, (10015), 8533 states have internal predecessors, (10015), 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:02:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8534 states to 8534 states and 10015 transitions. [2022-01-10 00:02:09,878 INFO L78 Accepts]: Start accepts. Automaton has 8534 states and 10015 transitions. Word has length 243 [2022-01-10 00:02:09,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:09,878 INFO L470 AbstractCegarLoop]: Abstraction has 8534 states and 10015 transitions. [2022-01-10 00:02:09,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 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:02:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 8534 states and 10015 transitions. [2022-01-10 00:02:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-10 00:02:09,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:09,882 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:02:09,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 00:02:09,882 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:09,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:09,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1535621630, now seen corresponding path program 1 times [2022-01-10 00:02:09,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:09,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265474568] [2022-01-10 00:02:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:09,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-01-10 00:02:09,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:09,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265474568] [2022-01-10 00:02:09,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265474568] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:09,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:09,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:09,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316849606] [2022-01-10 00:02:09,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:09,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:09,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:09,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:09,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:09,980 INFO L87 Difference]: Start difference. First operand 8534 states and 10015 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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:02:10,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:10,545 INFO L93 Difference]: Finished difference Result 18740 states and 22056 transitions. [2022-01-10 00:02:10,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:10,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 253 [2022-01-10 00:02:10,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:10,561 INFO L225 Difference]: With dead ends: 18740 [2022-01-10 00:02:10,561 INFO L226 Difference]: Without dead ends: 10576 [2022-01-10 00:02:10,569 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:02:10,570 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 151 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:10,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 190 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:02:10,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10576 states. [2022-01-10 00:02:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10576 to 10190. [2022-01-10 00:02:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10190 states, 10189 states have (on average 1.1690057905584454) internal successors, (11911), 10189 states have internal predecessors, (11911), 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:02:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10190 states to 10190 states and 11911 transitions. [2022-01-10 00:02:10,684 INFO L78 Accepts]: Start accepts. Automaton has 10190 states and 11911 transitions. Word has length 253 [2022-01-10 00:02:10,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:10,685 INFO L470 AbstractCegarLoop]: Abstraction has 10190 states and 11911 transitions. [2022-01-10 00:02:10,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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:02:10,685 INFO L276 IsEmpty]: Start isEmpty. Operand 10190 states and 11911 transitions. [2022-01-10 00:02:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-01-10 00:02:10,689 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:10,689 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:10,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 00:02:10,690 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash 943642801, now seen corresponding path program 1 times [2022-01-10 00:02:10,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:10,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266558726] [2022-01-10 00:02:10,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:10,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-01-10 00:02:10,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:10,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266558726] [2022-01-10 00:02:10,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266558726] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:10,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:10,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:10,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993292066] [2022-01-10 00:02:10,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:10,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:10,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:10,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:10,811 INFO L87 Difference]: Start difference. First operand 10190 states and 11911 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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:02:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:11,521 INFO L93 Difference]: Finished difference Result 20567 states and 24033 transitions. [2022-01-10 00:02:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:11,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 281 [2022-01-10 00:02:11,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:11,539 INFO L225 Difference]: With dead ends: 20567 [2022-01-10 00:02:11,540 INFO L226 Difference]: Without dead ends: 10563 [2022-01-10 00:02:11,551 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:02:11,552 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 150 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:11,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 361 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:02:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10563 states. [2022-01-10 00:02:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10563 to 10557. [2022-01-10 00:02:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10557 states, 10556 states have (on average 1.139920424403183) internal successors, (12033), 10556 states have internal predecessors, (12033), 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:02:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10557 states to 10557 states and 12033 transitions. [2022-01-10 00:02:11,681 INFO L78 Accepts]: Start accepts. Automaton has 10557 states and 12033 transitions. Word has length 281 [2022-01-10 00:02:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:11,682 INFO L470 AbstractCegarLoop]: Abstraction has 10557 states and 12033 transitions. [2022-01-10 00:02:11,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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:02:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 10557 states and 12033 transitions. [2022-01-10 00:02:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2022-01-10 00:02:11,691 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:11,691 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 00:02:11,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 00:02:11,696 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:11,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2146355781, now seen corresponding path program 1 times [2022-01-10 00:02:11,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:11,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036183133] [2022-01-10 00:02:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:11,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-01-10 00:02:11,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:11,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036183133] [2022-01-10 00:02:11,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036183133] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:11,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:11,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:11,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565074266] [2022-01-10 00:02:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:11,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:11,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:11,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:11,841 INFO L87 Difference]: Start difference. First operand 10557 states and 12033 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:02:12,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:12,489 INFO L93 Difference]: Finished difference Result 23886 states and 27410 transitions. [2022-01-10 00:02:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:12,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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 314 [2022-01-10 00:02:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:12,508 INFO L225 Difference]: With dead ends: 23886 [2022-01-10 00:02:12,508 INFO L226 Difference]: Without dead ends: 13699 [2022-01-10 00:02:12,518 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:02:12,519 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 142 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:12,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 135 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:02:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13699 states. [2022-01-10 00:02:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13699 to 13694. [2022-01-10 00:02:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13694 states, 13693 states have (on average 1.1337179580807712) internal successors, (15524), 13693 states have internal predecessors, (15524), 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:02:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13694 states to 13694 states and 15524 transitions. [2022-01-10 00:02:12,655 INFO L78 Accepts]: Start accepts. Automaton has 13694 states and 15524 transitions. Word has length 314 [2022-01-10 00:02:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:12,655 INFO L470 AbstractCegarLoop]: Abstraction has 13694 states and 15524 transitions. [2022-01-10 00:02:12,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:02:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 13694 states and 15524 transitions. [2022-01-10 00:02:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-01-10 00:02:12,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:12,693 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:02:12,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 00:02:12,693 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash 263747274, now seen corresponding path program 1 times [2022-01-10 00:02:12,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:12,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830309300] [2022-01-10 00:02:12,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:12,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-01-10 00:02:12,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:12,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830309300] [2022-01-10 00:02:12,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830309300] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:12,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:12,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:12,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998457467] [2022-01-10 00:02:12,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:12,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:12,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:12,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:12,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:12,775 INFO L87 Difference]: Start difference. First operand 13694 states and 15524 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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:02:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:13,466 INFO L93 Difference]: Finished difference Result 30517 states and 34553 transitions. [2022-01-10 00:02:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:13,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2022-01-10 00:02:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:13,492 INFO L225 Difference]: With dead ends: 30517 [2022-01-10 00:02:13,493 INFO L226 Difference]: Without dead ends: 17193 [2022-01-10 00:02:13,509 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:02:13,510 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 156 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:13,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 73 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:02:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2022-01-10 00:02:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 17190. [2022-01-10 00:02:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17190 states, 17189 states have (on average 1.1226365698993543) internal successors, (19297), 17189 states have internal predecessors, (19297), 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:02:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17190 states to 17190 states and 19297 transitions. [2022-01-10 00:02:13,747 INFO L78 Accepts]: Start accepts. Automaton has 17190 states and 19297 transitions. Word has length 322 [2022-01-10 00:02:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:13,747 INFO L470 AbstractCegarLoop]: Abstraction has 17190 states and 19297 transitions. [2022-01-10 00:02:13,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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:02:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 17190 states and 19297 transitions. [2022-01-10 00:02:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2022-01-10 00:02:13,755 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:13,755 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 00:02:13,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 00:02:13,755 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:13,756 INFO L85 PathProgramCache]: Analyzing trace with hash -379447870, now seen corresponding path program 1 times [2022-01-10 00:02:13,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:13,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435059901] [2022-01-10 00:02:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:13,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 227 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:13,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:13,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435059901] [2022-01-10 00:02:13,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435059901] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:02:13,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418216912] [2022-01-10 00:02:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:13,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:02:13,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:02:13,892 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:02:13,893 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:02:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:13,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 00:02:14,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:02:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-01-10 00:02:14,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:02:14,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418216912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:14,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:02:14,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-01-10 00:02:14,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803425651] [2022-01-10 00:02:14,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:14,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:14,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:14,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:02:14,672 INFO L87 Difference]: Start difference. First operand 17190 states and 19297 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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:02:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:15,389 INFO L93 Difference]: Finished difference Result 35504 states and 40039 transitions. [2022-01-10 00:02:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:15,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 324 [2022-01-10 00:02:15,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:15,410 INFO L225 Difference]: With dead ends: 35504 [2022-01-10 00:02:15,410 INFO L226 Difference]: Without dead ends: 18684 [2022-01-10 00:02:15,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:02:15,422 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 137 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:15,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 359 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:02:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18684 states. [2022-01-10 00:02:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18684 to 18676. [2022-01-10 00:02:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18676 states, 18675 states have (on average 1.121178045515395) internal successors, (20938), 18675 states have internal predecessors, (20938), 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:02:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18676 states to 18676 states and 20938 transitions. [2022-01-10 00:02:15,703 INFO L78 Accepts]: Start accepts. Automaton has 18676 states and 20938 transitions. Word has length 324 [2022-01-10 00:02:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:15,704 INFO L470 AbstractCegarLoop]: Abstraction has 18676 states and 20938 transitions. [2022-01-10 00:02:15,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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:02:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 18676 states and 20938 transitions. [2022-01-10 00:02:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2022-01-10 00:02:15,709 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:15,710 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 00:02:15,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 00:02:15,926 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,SelfDestructingSolverStorable13 [2022-01-10 00:02:15,927 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:15,927 INFO L85 PathProgramCache]: Analyzing trace with hash -56733327, now seen corresponding path program 1 times [2022-01-10 00:02:15,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:15,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449142938] [2022-01-10 00:02:15,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:15,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-01-10 00:02:16,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:16,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449142938] [2022-01-10 00:02:16,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449142938] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:16,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:16,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:16,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046692040] [2022-01-10 00:02:16,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:16,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:16,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:16,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:16,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:16,074 INFO L87 Difference]: Start difference. First operand 18676 states and 20938 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:02:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:16,738 INFO L93 Difference]: Finished difference Result 40109 states and 44936 transitions. [2022-01-10 00:02:16,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:16,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 326 [2022-01-10 00:02:16,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:16,760 INFO L225 Difference]: With dead ends: 40109 [2022-01-10 00:02:16,760 INFO L226 Difference]: Without dead ends: 21803 [2022-01-10 00:02:16,772 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:02:16,773 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 168 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:16,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 155 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:02:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21803 states. [2022-01-10 00:02:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21803 to 14439. [2022-01-10 00:02:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14439 states, 14438 states have (on average 1.13159717412384) internal successors, (16338), 14438 states have internal predecessors, (16338), 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:02:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14439 states to 14439 states and 16338 transitions. [2022-01-10 00:02:17,039 INFO L78 Accepts]: Start accepts. Automaton has 14439 states and 16338 transitions. Word has length 326 [2022-01-10 00:02:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:17,039 INFO L470 AbstractCegarLoop]: Abstraction has 14439 states and 16338 transitions. [2022-01-10 00:02:17,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:02:17,040 INFO L276 IsEmpty]: Start isEmpty. Operand 14439 states and 16338 transitions. [2022-01-10 00:02:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2022-01-10 00:02:17,044 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:17,045 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:02:17,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 00:02:17,045 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:17,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash 234214298, now seen corresponding path program 1 times [2022-01-10 00:02:17,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:17,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150021854] [2022-01-10 00:02:17,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:17,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-01-10 00:02:17,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:17,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150021854] [2022-01-10 00:02:17,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150021854] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:17,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:17,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:02:17,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831768745] [2022-01-10 00:02:17,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:17,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:17,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:17,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:17,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:17,130 INFO L87 Difference]: Start difference. First operand 14439 states and 16338 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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:02:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:17,472 INFO L93 Difference]: Finished difference Result 28500 states and 32286 transitions. [2022-01-10 00:02:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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 333 [2022-01-10 00:02:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:17,486 INFO L225 Difference]: With dead ends: 28500 [2022-01-10 00:02:17,486 INFO L226 Difference]: Without dead ends: 14431 [2022-01-10 00:02:17,493 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:02:17,494 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:17,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 40 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 00:02:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14431 states. [2022-01-10 00:02:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14431 to 14428. [2022-01-10 00:02:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14428 states, 14427 states have (on average 1.1309350523324322) internal successors, (16316), 14427 states have internal predecessors, (16316), 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:02:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14428 states to 14428 states and 16316 transitions. [2022-01-10 00:02:17,684 INFO L78 Accepts]: Start accepts. Automaton has 14428 states and 16316 transitions. Word has length 333 [2022-01-10 00:02:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:17,684 INFO L470 AbstractCegarLoop]: Abstraction has 14428 states and 16316 transitions. [2022-01-10 00:02:17,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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:02:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14428 states and 16316 transitions. [2022-01-10 00:02:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2022-01-10 00:02:17,690 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:17,690 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:02:17,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 00:02:17,691 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:17,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:17,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1309922959, now seen corresponding path program 1 times [2022-01-10 00:02:17,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:17,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614277959] [2022-01-10 00:02:17,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:17,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-01-10 00:02:17,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:17,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614277959] [2022-01-10 00:02:17,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614277959] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:17,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:17,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:17,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319974079] [2022-01-10 00:02:17,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:17,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:17,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:17,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:17,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:17,788 INFO L87 Difference]: Start difference. First operand 14428 states and 16316 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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:02:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:18,457 INFO L93 Difference]: Finished difference Result 32350 states and 36463 transitions. [2022-01-10 00:02:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:18,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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 357 [2022-01-10 00:02:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:18,471 INFO L225 Difference]: With dead ends: 32350 [2022-01-10 00:02:18,472 INFO L226 Difference]: Without dead ends: 16448 [2022-01-10 00:02:18,478 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:02:18,479 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 150 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:18,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 309 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:02:18,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16448 states. [2022-01-10 00:02:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16448 to 14052. [2022-01-10 00:02:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14052 states, 14051 states have (on average 1.095224539178706) internal successors, (15389), 14051 states have internal predecessors, (15389), 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:02:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14052 states to 14052 states and 15389 transitions. [2022-01-10 00:02:18,606 INFO L78 Accepts]: Start accepts. Automaton has 14052 states and 15389 transitions. Word has length 357 [2022-01-10 00:02:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:18,607 INFO L470 AbstractCegarLoop]: Abstraction has 14052 states and 15389 transitions. [2022-01-10 00:02:18,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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:02:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 14052 states and 15389 transitions. [2022-01-10 00:02:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2022-01-10 00:02:18,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:18,612 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:02:18,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 00:02:18,612 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:18,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:18,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2132777761, now seen corresponding path program 1 times [2022-01-10 00:02:18,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:18,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775822530] [2022-01-10 00:02:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:18,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-01-10 00:02:18,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:18,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775822530] [2022-01-10 00:02:18,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775822530] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:18,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:18,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:02:18,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433886390] [2022-01-10 00:02:18,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:18,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:02:18,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:18,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:02:18,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:02:18,718 INFO L87 Difference]: Start difference. First operand 14052 states and 15389 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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:02:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:19,626 INFO L93 Difference]: Finished difference Result 28841 states and 31559 transitions. [2022-01-10 00:02:19,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:02:19,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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 358 [2022-01-10 00:02:19,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:19,641 INFO L225 Difference]: With dead ends: 28841 [2022-01-10 00:02:19,641 INFO L226 Difference]: Without dead ends: 15159 [2022-01-10 00:02:19,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:02:19,688 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 307 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:19,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 111 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 00:02:19,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15159 states. [2022-01-10 00:02:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15159 to 14236. [2022-01-10 00:02:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14236 states, 14235 states have (on average 1.0942746750965928) internal successors, (15577), 14235 states have internal predecessors, (15577), 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:02:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14236 states to 14236 states and 15577 transitions. [2022-01-10 00:02:19,794 INFO L78 Accepts]: Start accepts. Automaton has 14236 states and 15577 transitions. Word has length 358 [2022-01-10 00:02:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:19,794 INFO L470 AbstractCegarLoop]: Abstraction has 14236 states and 15577 transitions. [2022-01-10 00:02:19,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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:02:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 14236 states and 15577 transitions. [2022-01-10 00:02:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2022-01-10 00:02:19,799 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:19,799 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:02:19,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 00:02:19,800 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:19,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:19,800 INFO L85 PathProgramCache]: Analyzing trace with hash 827224776, now seen corresponding path program 1 times [2022-01-10 00:02:19,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:19,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944542178] [2022-01-10 00:02:19,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:19,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-01-10 00:02:19,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:19,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944542178] [2022-01-10 00:02:19,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944542178] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:19,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:19,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:19,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490545474] [2022-01-10 00:02:19,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:19,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:02:19,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:19,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:02:19,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:02:19,891 INFO L87 Difference]: Start difference. First operand 14236 states and 15577 transitions. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 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:02:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:20,839 INFO L93 Difference]: Finished difference Result 36219 states and 39627 transitions. [2022-01-10 00:02:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:02:20,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 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 372 [2022-01-10 00:02:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:20,863 INFO L225 Difference]: With dead ends: 36219 [2022-01-10 00:02:20,863 INFO L226 Difference]: Without dead ends: 21801 [2022-01-10 00:02:20,875 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:02:20,876 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 211 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:20,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 78 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 00:02:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21801 states. [2022-01-10 00:02:21,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21801 to 20506. [2022-01-10 00:02:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20506 states, 20505 states have (on average 1.090904657400634) internal successors, (22369), 20505 states have internal predecessors, (22369), 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:02:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20506 states to 20506 states and 22369 transitions. [2022-01-10 00:02:21,090 INFO L78 Accepts]: Start accepts. Automaton has 20506 states and 22369 transitions. Word has length 372 [2022-01-10 00:02:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:21,090 INFO L470 AbstractCegarLoop]: Abstraction has 20506 states and 22369 transitions. [2022-01-10 00:02:21,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 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:02:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 20506 states and 22369 transitions. [2022-01-10 00:02:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2022-01-10 00:02:21,096 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:21,096 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:02:21,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 00:02:21,096 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:21,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:21,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1553293930, now seen corresponding path program 1 times [2022-01-10 00:02:21,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:21,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491373680] [2022-01-10 00:02:21,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:21,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 146 proven. 200 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-01-10 00:02:21,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:21,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491373680] [2022-01-10 00:02:21,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491373680] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:02:21,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659445869] [2022-01-10 00:02:21,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:21,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:02:21,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:02:21,232 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:02:21,233 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:02:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:21,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 00:02:21,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:02:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 244 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:22,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:02:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 244 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:02:26,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659445869] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:02:26,324 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:02:26,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2022-01-10 00:02:26,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734465549] [2022-01-10 00:02:26,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:02:26,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 00:02:26,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:26,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 00:02:26,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-10 00:02:26,328 INFO L87 Difference]: Start difference. First operand 20506 states and 22369 transitions. Second operand has 12 states, 12 states have (on average 76.16666666666667) internal successors, (914), 11 states have internal predecessors, (914), 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:02:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:31,946 INFO L93 Difference]: Finished difference Result 61536 states and 66765 transitions. [2022-01-10 00:02:31,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-10 00:02:31,947 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 76.16666666666667) internal successors, (914), 11 states have internal predecessors, (914), 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 389 [2022-01-10 00:02:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:31,987 INFO L225 Difference]: With dead ends: 61536 [2022-01-10 00:02:31,987 INFO L226 Difference]: Without dead ends: 40662 [2022-01-10 00:02:32,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 770 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=464, Invalid=1176, Unknown=0, NotChecked=0, Total=1640 [2022-01-10 00:02:32,005 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 5059 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 6640 mSolverCounterSat, 2135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5059 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 8775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2135 IncrementalHoareTripleChecker+Valid, 6640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:32,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5059 Valid, 181 Invalid, 8775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2135 Valid, 6640 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-01-10 00:02:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40662 states. [2022-01-10 00:02:32,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40662 to 35614. [2022-01-10 00:02:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35614 states, 35613 states have (on average 1.0764046836829249) internal successors, (38334), 35613 states have internal predecessors, (38334), 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:02:32,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35614 states to 35614 states and 38334 transitions. [2022-01-10 00:02:32,471 INFO L78 Accepts]: Start accepts. Automaton has 35614 states and 38334 transitions. Word has length 389 [2022-01-10 00:02:32,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:32,471 INFO L470 AbstractCegarLoop]: Abstraction has 35614 states and 38334 transitions. [2022-01-10 00:02:32,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 76.16666666666667) internal successors, (914), 11 states have internal predecessors, (914), 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:02:32,471 INFO L276 IsEmpty]: Start isEmpty. Operand 35614 states and 38334 transitions. [2022-01-10 00:02:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2022-01-10 00:02:32,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:32,478 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:02:32,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 00:02:32,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-01-10 00:02:32,686 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:32,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:32,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1546004851, now seen corresponding path program 1 times [2022-01-10 00:02:32,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:32,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046529271] [2022-01-10 00:02:32,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:32,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-01-10 00:02:32,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046529271] [2022-01-10 00:02:32,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046529271] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:32,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:32,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:32,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771553990] [2022-01-10 00:02:32,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:32,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:02:32,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:32,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:02:32,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:02:32,805 INFO L87 Difference]: Start difference. First operand 35614 states and 38334 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 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:02:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:33,852 INFO L93 Difference]: Finished difference Result 72893 states and 78533 transitions. [2022-01-10 00:02:33,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:02:33,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 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 394 [2022-01-10 00:02:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:33,887 INFO L225 Difference]: With dead ends: 72893 [2022-01-10 00:02:33,887 INFO L226 Difference]: Without dead ends: 37649 [2022-01-10 00:02:33,908 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:02:33,908 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 200 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:33,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 105 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 00:02:33,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37649 states. [2022-01-10 00:02:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37649 to 33762. [2022-01-10 00:02:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33762 states, 33761 states have (on average 1.0759752377003051) internal successors, (36326), 33761 states have internal predecessors, (36326), 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:02:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33762 states to 33762 states and 36326 transitions. [2022-01-10 00:02:34,294 INFO L78 Accepts]: Start accepts. Automaton has 33762 states and 36326 transitions. Word has length 394 [2022-01-10 00:02:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:34,294 INFO L470 AbstractCegarLoop]: Abstraction has 33762 states and 36326 transitions. [2022-01-10 00:02:34,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 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:02:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 33762 states and 36326 transitions. [2022-01-10 00:02:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2022-01-10 00:02:34,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:34,303 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:02:34,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 00:02:34,303 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:34,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:34,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1148113260, now seen corresponding path program 1 times [2022-01-10 00:02:34,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:34,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538405564] [2022-01-10 00:02:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:34,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-01-10 00:02:34,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:34,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538405564] [2022-01-10 00:02:34,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538405564] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:34,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:34,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:34,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129632485] [2022-01-10 00:02:34,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:34,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:34,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:34,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:34,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:34,742 INFO L87 Difference]: Start difference. First operand 33762 states and 36326 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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:02:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:35,459 INFO L93 Difference]: Finished difference Result 69174 states and 74442 transitions. [2022-01-10 00:02:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:35,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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 434 [2022-01-10 00:02:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:35,496 INFO L225 Difference]: With dead ends: 69174 [2022-01-10 00:02:35,496 INFO L226 Difference]: Without dead ends: 35782 [2022-01-10 00:02:35,516 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:02:35,523 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 156 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:35,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 316 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:02:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35782 states. [2022-01-10 00:02:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35782 to 29520. [2022-01-10 00:02:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29520 states, 29519 states have (on average 1.0707679799451202) internal successors, (31608), 29519 states have internal predecessors, (31608), 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:02:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29520 states to 29520 states and 31608 transitions. [2022-01-10 00:02:35,938 INFO L78 Accepts]: Start accepts. Automaton has 29520 states and 31608 transitions. Word has length 434 [2022-01-10 00:02:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:35,938 INFO L470 AbstractCegarLoop]: Abstraction has 29520 states and 31608 transitions. [2022-01-10 00:02:35,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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:02:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 29520 states and 31608 transitions. [2022-01-10 00:02:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2022-01-10 00:02:35,946 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:35,947 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:02:35,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 00:02:35,947 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:35,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:35,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1848032332, now seen corresponding path program 1 times [2022-01-10 00:02:35,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:35,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950142964] [2022-01-10 00:02:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:35,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-01-10 00:02:36,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:36,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950142964] [2022-01-10 00:02:36,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950142964] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:36,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:36,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:02:36,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092063478] [2022-01-10 00:02:36,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:36,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:36,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:36,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:36,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:02:36,169 INFO L87 Difference]: Start difference. First operand 29520 states and 31608 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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:02:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:36,870 INFO L93 Difference]: Finished difference Result 57758 states and 61913 transitions. [2022-01-10 00:02:36,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:36,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 468 [2022-01-10 00:02:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:36,901 INFO L225 Difference]: With dead ends: 57758 [2022-01-10 00:02:36,901 INFO L226 Difference]: Without dead ends: 30816 [2022-01-10 00:02:36,919 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:02:36,920 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 134 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:36,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 111 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 00:02:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30816 states. [2022-01-10 00:02:37,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30816 to 29152. [2022-01-10 00:02:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29152 states, 29151 states have (on average 1.0702205756234777) internal successors, (31198), 29151 states have internal predecessors, (31198), 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:02:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29152 states to 29152 states and 31198 transitions. [2022-01-10 00:02:37,341 INFO L78 Accepts]: Start accepts. Automaton has 29152 states and 31198 transitions. Word has length 468 [2022-01-10 00:02:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:37,341 INFO L470 AbstractCegarLoop]: Abstraction has 29152 states and 31198 transitions. [2022-01-10 00:02:37,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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:02:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 29152 states and 31198 transitions. [2022-01-10 00:02:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2022-01-10 00:02:37,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:37,349 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:37,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 00:02:37,349 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:37,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:37,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1117136727, now seen corresponding path program 1 times [2022-01-10 00:02:37,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:37,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159122226] [2022-01-10 00:02:37,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:37,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 269 proven. 132 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2022-01-10 00:02:37,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:37,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159122226] [2022-01-10 00:02:37,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159122226] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:02:37,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828499203] [2022-01-10 00:02:37,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:37,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:02:37,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:02:37,505 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:02:37,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 00:02:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:37,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 00:02:37,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:02:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2022-01-10 00:02:38,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:02:38,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828499203] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:38,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:02:38,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-01-10 00:02:38,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939820076] [2022-01-10 00:02:38,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:38,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:02:38,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:38,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:02:38,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:02:38,333 INFO L87 Difference]: Start difference. First operand 29152 states and 31198 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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:02:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:38,944 INFO L93 Difference]: Finished difference Result 55910 states and 59881 transitions. [2022-01-10 00:02:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:02:38,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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 472 [2022-01-10 00:02:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:38,969 INFO L225 Difference]: With dead ends: 55910 [2022-01-10 00:02:38,969 INFO L226 Difference]: Without dead ends: 28782 [2022-01-10 00:02:38,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:02:38,986 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 120 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:38,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 163 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:02:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28782 states. [2022-01-10 00:02:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28782 to 28046. [2022-01-10 00:02:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28046 states, 28045 states have (on average 1.0686040292387236) internal successors, (29969), 28045 states have internal predecessors, (29969), 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:02:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28046 states to 28046 states and 29969 transitions. [2022-01-10 00:02:39,393 INFO L78 Accepts]: Start accepts. Automaton has 28046 states and 29969 transitions. Word has length 472 [2022-01-10 00:02:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:39,393 INFO L470 AbstractCegarLoop]: Abstraction has 28046 states and 29969 transitions. [2022-01-10 00:02:39,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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:02:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 28046 states and 29969 transitions. [2022-01-10 00:02:39,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2022-01-10 00:02:39,405 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:39,405 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2022-01-10 00:02:39,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 00:02:39,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:02:39,606 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:39,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:39,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2131901513, now seen corresponding path program 1 times [2022-01-10 00:02:39,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:39,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560813886] [2022-01-10 00:02:39,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:39,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 00:02:39,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:39,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560813886] [2022-01-10 00:02:39,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560813886] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:02:39,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:02:39,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:02:39,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778720891] [2022-01-10 00:02:39,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:02:39,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:02:39,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:39,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:02:39,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:02:39,920 INFO L87 Difference]: Start difference. First operand 28046 states and 29969 transitions. Second operand has 7 states, 7 states have (on average 56.285714285714285) internal successors, (394), 6 states have internal predecessors, (394), 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:02:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:41,402 INFO L93 Difference]: Finished difference Result 59353 states and 63381 transitions. [2022-01-10 00:02:41,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 00:02:41,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.285714285714285) internal successors, (394), 6 states have internal predecessors, (394), 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 523 [2022-01-10 00:02:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:41,428 INFO L225 Difference]: With dead ends: 59353 [2022-01-10 00:02:41,428 INFO L226 Difference]: Without dead ends: 33701 [2022-01-10 00:02:41,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-10 00:02:41,437 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 331 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:41,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 188 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 00:02:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33701 states. [2022-01-10 00:02:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33701 to 29152. [2022-01-10 00:02:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29152 states, 29151 states have (on average 1.069054234846146) internal successors, (31164), 29151 states have internal predecessors, (31164), 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:02:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29152 states to 29152 states and 31164 transitions. [2022-01-10 00:02:41,755 INFO L78 Accepts]: Start accepts. Automaton has 29152 states and 31164 transitions. Word has length 523 [2022-01-10 00:02:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:41,756 INFO L470 AbstractCegarLoop]: Abstraction has 29152 states and 31164 transitions. [2022-01-10 00:02:41,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.285714285714285) internal successors, (394), 6 states have internal predecessors, (394), 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:02:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 29152 states and 31164 transitions. [2022-01-10 00:02:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2022-01-10 00:02:41,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:41,767 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2022-01-10 00:02:41,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 00:02:41,767 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:41,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash 435204898, now seen corresponding path program 1 times [2022-01-10 00:02:41,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:41,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524663132] [2022-01-10 00:02:41,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:41,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 606 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 00:02:42,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:42,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524663132] [2022-01-10 00:02:42,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524663132] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:02:42,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657902562] [2022-01-10 00:02:42,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:42,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:02:42,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:02:42,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:02:42,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 00:02:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:42,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 00:02:42,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:02:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 493 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 00:02:43,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:02:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 493 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 00:02:47,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657902562] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:02:47,364 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:02:47,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2022-01-10 00:02:47,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346722476] [2022-01-10 00:02:47,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:02:47,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 00:02:47,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:47,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 00:02:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-01-10 00:02:47,366 INFO L87 Difference]: Start difference. First operand 29152 states and 31164 transitions. Second operand has 11 states, 11 states have (on average 88.36363636363636) internal successors, (972), 10 states have internal predecessors, (972), 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:02:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:02:51,059 INFO L93 Difference]: Finished difference Result 62639 states and 66777 transitions. [2022-01-10 00:02:51,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-10 00:02:51,059 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 88.36363636363636) internal successors, (972), 10 states have internal predecessors, (972), 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 533 [2022-01-10 00:02:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:02:51,093 INFO L225 Difference]: With dead ends: 62639 [2022-01-10 00:02:51,093 INFO L226 Difference]: Without dead ends: 29174 [2022-01-10 00:02:51,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1097 GetRequests, 1061 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 00:02:51,104 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 1326 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3773 mSolverCounterSat, 805 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 4578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 805 IncrementalHoareTripleChecker+Valid, 3773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:02:51,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1326 Valid, 169 Invalid, 4578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [805 Valid, 3773 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-01-10 00:02:51,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29174 states. [2022-01-10 00:02:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29174 to 14401. [2022-01-10 00:02:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14401 states, 14400 states have (on average 1.0522916666666666) internal successors, (15153), 14400 states have internal predecessors, (15153), 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:02:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14401 states to 14401 states and 15153 transitions. [2022-01-10 00:02:51,336 INFO L78 Accepts]: Start accepts. Automaton has 14401 states and 15153 transitions. Word has length 533 [2022-01-10 00:02:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:02:51,336 INFO L470 AbstractCegarLoop]: Abstraction has 14401 states and 15153 transitions. [2022-01-10 00:02:51,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.36363636363636) internal successors, (972), 10 states have internal predecessors, (972), 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:02:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 14401 states and 15153 transitions. [2022-01-10 00:02:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2022-01-10 00:02:51,342 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:02:51,342 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:02:51,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 00:02:51,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-10 00:02:51,543 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:02:51,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:02:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1729367067, now seen corresponding path program 1 times [2022-01-10 00:02:51,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:02:51,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451656233] [2022-01-10 00:02:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:51,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:02:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 390 proven. 206 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-01-10 00:02:51,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:02:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451656233] [2022-01-10 00:02:51,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451656233] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:02:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066779428] [2022-01-10 00:02:51,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:02:51,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:02:51,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:02:51,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:02:51,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 00:02:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:02:51,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 00:02:51,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:02:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 341 proven. 255 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-01-10 00:02:53,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:02:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 527 proven. 69 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-01-10 00:02:55,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066779428] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:02:55,931 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:02:55,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 00:02:55,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059884066] [2022-01-10 00:02:55,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:02:55,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 00:02:55,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:02:55,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 00:02:55,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2022-01-10 00:02:55,932 INFO L87 Difference]: Start difference. First operand 14401 states and 15153 transitions. Second operand has 10 states, 10 states have (on average 84.3) internal successors, (843), 10 states have internal predecessors, (843), 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)