/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 20:31:48,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 20:31:48,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 20:31:48,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 20:31:48,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 20:31:48,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 20:31:48,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 20:31:48,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 20:31:48,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 20:31:48,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 20:31:48,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 20:31:48,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 20:31:48,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 20:31:48,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 20:31:48,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 20:31:48,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 20:31:48,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 20:31:48,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 20:31:48,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 20:31:48,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 20:31:48,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 20:31:48,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 20:31:48,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 20:31:48,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 20:31:48,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 20:31:48,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 20:31:48,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 20:31:48,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 20:31:48,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 20:31:48,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 20:31:48,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 20:31:48,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 20:31:48,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 20:31:48,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 20:31:48,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 20:31:48,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 20:31:48,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 20:31:48,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 20:31:48,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 20:31:48,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 20:31:48,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 20:31:48,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 20:31:48,349 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 20:31:48,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 20:31:48,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 20:31:48,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 20:31:48,354 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 20:31:48,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 20:31:48,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 20:31:48,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 20:31:48,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 20:31:48,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 20:31:48,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 20:31:48,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 20:31:48,358 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 20:31:48,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 20:31:48,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 20:31:48,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 20:31:48,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 20:31:48,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:31:48,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 20:31:48,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 20:31:48,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 20:31:48,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 20:31:48,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 20:31:48,361 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 20:31:48,361 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 20:31:48,361 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-bitabs/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 [2021-01-06 20:31:48,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 20:31:48,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 20:31:48,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 20:31:48,829 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 20:31:48,829 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 20:31:48,830 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 20:31:48,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1ae6478e0/70c398c2a79f45b0ac10fb2039d710e4/FLAGf515a16c0 [2021-01-06 20:31:49,514 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 20:31:49,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 20:31:49,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1ae6478e0/70c398c2a79f45b0ac10fb2039d710e4/FLAGf515a16c0 [2021-01-06 20:31:49,838 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1ae6478e0/70c398c2a79f45b0ac10fb2039d710e4 [2021-01-06 20:31:49,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 20:31:49,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 20:31:49,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 20:31:49,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 20:31:49,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 20:31:49,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:31:49" (1/1) ... [2021-01-06 20:31:49,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1421d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:49, skipping insertion in model container [2021-01-06 20:31:49,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:31:49" (1/1) ... [2021-01-06 20:31:49,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 20:31:49,904 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_6348~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_6453~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 20:31:50,120 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4007,4020] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] [2021-01-06 20:31:50,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:31:50,172 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_6348~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__i2~0,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_6453~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_1~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~0,] [2021-01-06 20:31:50,213 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4007,4020] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~0,] [2021-01-06 20:31:50,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:31:50,255 INFO L208 MainTranslator]: Completed translation [2021-01-06 20:31:50,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:50 WrapperNode [2021-01-06 20:31:50,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 20:31:50,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 20:31:50,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 20:31:50,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 20:31:50,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:50" (1/1) ... [2021-01-06 20:31:50,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:50" (1/1) ... [2021-01-06 20:31:50,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 20:31:50,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 20:31:50,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 20:31:50,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 20:31:50,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:50" (1/1) ... [2021-01-06 20:31:50,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:50" (1/1) ... [2021-01-06 20:31:50,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:50" (1/1) ... [2021-01-06 20:31:50,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:50" (1/1) ... [2021-01-06 20:31:50,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:50" (1/1) ... [2021-01-06 20:31:50,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:50" (1/1) ... [2021-01-06 20:31:50,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:50" (1/1) ... [2021-01-06 20:31:50,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 20:31:50,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 20:31:50,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 20:31:50,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 20:31:50,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:50" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:31:50,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 20:31:50,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 20:31:50,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 20:31:50,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 20:31:51,396 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 20:31:51,396 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 20:31:51,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:31:51 BoogieIcfgContainer [2021-01-06 20:31:51,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 20:31:51,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 20:31:51,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 20:31:51,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 20:31:51,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 08:31:49" (1/3) ... [2021-01-06 20:31:51,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c7d1b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:31:51, skipping insertion in model container [2021-01-06 20:31:51,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:31:50" (2/3) ... [2021-01-06 20:31:51,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c7d1b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:31:51, skipping insertion in model container [2021-01-06 20:31:51,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:31:51" (3/3) ... [2021-01-06 20:31:51,408 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2021-01-06 20:31:51,414 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 20:31:51,420 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 20:31:51,438 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 20:31:51,468 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 20:31:51,468 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 20:31:51,468 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 20:31:51,468 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 20:31:51,469 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 20:31:51,469 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 20:31:51,469 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 20:31:51,469 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 20:31:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2021-01-06 20:31:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 20:31:51,497 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:31:51,498 INFO L422 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] [2021-01-06 20:31:51,498 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:31:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:31:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash 716810707, now seen corresponding path program 1 times [2021-01-06 20:31:51,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:31:51,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664917561] [2021-01-06 20:31:51,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:31:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:31:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:31:51,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664917561] [2021-01-06 20:31:51,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:31:51,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:31:51,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279241278] [2021-01-06 20:31:51,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:31:51,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:31:51,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:31:51,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:31:51,910 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2021-01-06 20:31:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:31:51,988 INFO L93 Difference]: Finished difference Result 205 states and 324 transitions. [2021-01-06 20:31:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:31:51,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2021-01-06 20:31:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:31:52,005 INFO L225 Difference]: With dead ends: 205 [2021-01-06 20:31:52,005 INFO L226 Difference]: Without dead ends: 132 [2021-01-06 20:31:52,009 INFO L677 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 [2021-01-06 20:31:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-01-06 20:31:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2021-01-06 20:31:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2021-01-06 20:31:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2021-01-06 20:31:52,067 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 194 transitions. Word has length 38 [2021-01-06 20:31:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:31:52,068 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 194 transitions. [2021-01-06 20:31:52,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:31:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 194 transitions. [2021-01-06 20:31:52,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 20:31:52,070 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:31:52,070 INFO L422 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] [2021-01-06 20:31:52,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 20:31:52,071 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:31:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:31:52,072 INFO L82 PathProgramCache]: Analyzing trace with hash -935293361, now seen corresponding path program 1 times [2021-01-06 20:31:52,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:31:52,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031508623] [2021-01-06 20:31:52,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:31:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:31:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:31:52,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031508623] [2021-01-06 20:31:52,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:31:52,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:31:52,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443725332] [2021-01-06 20:31:52,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:31:52,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:31:52,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:31:52,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:31:52,198 INFO L87 Difference]: Start difference. First operand 130 states and 194 transitions. Second operand 3 states. [2021-01-06 20:31:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:31:52,307 INFO L93 Difference]: Finished difference Result 318 states and 490 transitions. [2021-01-06 20:31:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:31:52,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-01-06 20:31:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:31:52,314 INFO L225 Difference]: With dead ends: 318 [2021-01-06 20:31:52,315 INFO L226 Difference]: Without dead ends: 208 [2021-01-06 20:31:52,321 INFO L677 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 [2021-01-06 20:31:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-01-06 20:31:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2021-01-06 20:31:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2021-01-06 20:31:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2021-01-06 20:31:52,397 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 39 [2021-01-06 20:31:52,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:31:52,398 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2021-01-06 20:31:52,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:31:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2021-01-06 20:31:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 20:31:52,402 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:31:52,402 INFO L422 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] [2021-01-06 20:31:52,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 20:31:52,403 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:31:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:31:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash 830312666, now seen corresponding path program 1 times [2021-01-06 20:31:52,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:31:52,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742604580] [2021-01-06 20:31:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:31:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:31:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:31:52,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742604580] [2021-01-06 20:31:52,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:31:52,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:31:52,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041328760] [2021-01-06 20:31:52,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:31:52,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:31:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:31:52,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:31:52,639 INFO L87 Difference]: Start difference. First operand 206 states and 313 transitions. Second operand 5 states. [2021-01-06 20:31:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:31:52,795 INFO L93 Difference]: Finished difference Result 688 states and 1068 transitions. [2021-01-06 20:31:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:31:52,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2021-01-06 20:31:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:31:52,801 INFO L225 Difference]: With dead ends: 688 [2021-01-06 20:31:52,801 INFO L226 Difference]: Without dead ends: 502 [2021-01-06 20:31:52,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:31:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-01-06 20:31:52,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 498. [2021-01-06 20:31:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2021-01-06 20:31:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 769 transitions. [2021-01-06 20:31:52,862 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 769 transitions. Word has length 40 [2021-01-06 20:31:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:31:52,863 INFO L481 AbstractCegarLoop]: Abstraction has 498 states and 769 transitions. [2021-01-06 20:31:52,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:31:52,863 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 769 transitions. [2021-01-06 20:31:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 20:31:52,865 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:31:52,865 INFO L422 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] [2021-01-06 20:31:52,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 20:31:52,866 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:31:52,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:31:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash 604365756, now seen corresponding path program 1 times [2021-01-06 20:31:52,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:31:52,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484642313] [2021-01-06 20:31:52,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:31:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:31:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:31:52,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484642313] [2021-01-06 20:31:52,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:31:52,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:31:52,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60087861] [2021-01-06 20:31:52,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:31:52,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:31:52,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:31:52,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:31:52,973 INFO L87 Difference]: Start difference. First operand 498 states and 769 transitions. Second operand 3 states. [2021-01-06 20:31:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:31:53,070 INFO L93 Difference]: Finished difference Result 1258 states and 1951 transitions. [2021-01-06 20:31:53,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:31:53,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2021-01-06 20:31:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:31:53,077 INFO L225 Difference]: With dead ends: 1258 [2021-01-06 20:31:53,077 INFO L226 Difference]: Without dead ends: 780 [2021-01-06 20:31:53,081 INFO L677 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 [2021-01-06 20:31:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-01-06 20:31:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 778. [2021-01-06 20:31:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2021-01-06 20:31:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1189 transitions. [2021-01-06 20:31:53,162 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1189 transitions. Word has length 41 [2021-01-06 20:31:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:31:53,164 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 1189 transitions. [2021-01-06 20:31:53,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:31:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1189 transitions. [2021-01-06 20:31:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 20:31:53,172 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:31:53,172 INFO L422 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] [2021-01-06 20:31:53,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 20:31:53,173 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:31:53,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:31:53,173 INFO L82 PathProgramCache]: Analyzing trace with hash 608060849, now seen corresponding path program 1 times [2021-01-06 20:31:53,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:31:53,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506344561] [2021-01-06 20:31:53,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:31:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:31:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:31:53,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506344561] [2021-01-06 20:31:53,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:31:53,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:31:53,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481421339] [2021-01-06 20:31:53,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:31:53,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:31:53,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:31:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:31:53,251 INFO L87 Difference]: Start difference. First operand 778 states and 1189 transitions. Second operand 5 states. [2021-01-06 20:31:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:31:53,609 INFO L93 Difference]: Finished difference Result 2294 states and 3527 transitions. [2021-01-06 20:31:53,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:31:53,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2021-01-06 20:31:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:31:53,620 INFO L225 Difference]: With dead ends: 2294 [2021-01-06 20:31:53,620 INFO L226 Difference]: Without dead ends: 1536 [2021-01-06 20:31:53,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:31:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2021-01-06 20:31:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1534. [2021-01-06 20:31:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1534 states. [2021-01-06 20:31:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2337 transitions. [2021-01-06 20:31:53,815 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2337 transitions. Word has length 42 [2021-01-06 20:31:53,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:31:53,816 INFO L481 AbstractCegarLoop]: Abstraction has 1534 states and 2337 transitions. [2021-01-06 20:31:53,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:31:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2337 transitions. [2021-01-06 20:31:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 20:31:53,819 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:31:53,819 INFO L422 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] [2021-01-06 20:31:53,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 20:31:53,820 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:31:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:31:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1912062484, now seen corresponding path program 1 times [2021-01-06 20:31:53,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:31:53,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394139090] [2021-01-06 20:31:53,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:31:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:31:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:31:53,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394139090] [2021-01-06 20:31:53,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:31:53,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:31:53,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365418255] [2021-01-06 20:31:53,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:31:53,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:31:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:31:53,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:31:53,936 INFO L87 Difference]: Start difference. First operand 1534 states and 2337 transitions. Second operand 5 states. [2021-01-06 20:31:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:31:54,464 INFO L93 Difference]: Finished difference Result 6174 states and 9429 transitions. [2021-01-06 20:31:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:31:54,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2021-01-06 20:31:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:31:54,491 INFO L225 Difference]: With dead ends: 6174 [2021-01-06 20:31:54,491 INFO L226 Difference]: Without dead ends: 4660 [2021-01-06 20:31:54,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:31:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4660 states. [2021-01-06 20:31:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4660 to 3046. [2021-01-06 20:31:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3046 states. [2021-01-06 20:31:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 4557 transitions. [2021-01-06 20:31:54,840 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 4557 transitions. Word has length 42 [2021-01-06 20:31:54,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:31:54,840 INFO L481 AbstractCegarLoop]: Abstraction has 3046 states and 4557 transitions. [2021-01-06 20:31:54,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:31:54,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 4557 transitions. [2021-01-06 20:31:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-06 20:31:54,842 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:31:54,843 INFO L422 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] [2021-01-06 20:31:54,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 20:31:54,843 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:31:54,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:31:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash 836148826, now seen corresponding path program 1 times [2021-01-06 20:31:54,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:31:54,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95497903] [2021-01-06 20:31:54,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:31:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:31:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:31:54,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95497903] [2021-01-06 20:31:54,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:31:54,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:31:54,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868326872] [2021-01-06 20:31:54,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:31:54,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:31:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:31:55,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:31:55,001 INFO L87 Difference]: Start difference. First operand 3046 states and 4557 transitions. Second operand 5 states. [2021-01-06 20:31:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:31:55,582 INFO L93 Difference]: Finished difference Result 6264 states and 9286 transitions. [2021-01-06 20:31:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 20:31:55,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2021-01-06 20:31:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:31:55,619 INFO L225 Difference]: With dead ends: 6264 [2021-01-06 20:31:55,619 INFO L226 Difference]: Without dead ends: 6262 [2021-01-06 20:31:55,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:31:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6262 states. [2021-01-06 20:31:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6262 to 3238. [2021-01-06 20:31:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3238 states. [2021-01-06 20:31:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 4749 transitions. [2021-01-06 20:31:56,040 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 4749 transitions. Word has length 43 [2021-01-06 20:31:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:31:56,041 INFO L481 AbstractCegarLoop]: Abstraction has 3238 states and 4749 transitions. [2021-01-06 20:31:56,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:31:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 4749 transitions. [2021-01-06 20:31:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 20:31:56,041 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:31:56,042 INFO L422 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] [2021-01-06 20:31:56,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 20:31:56,042 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:31:56,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:31:56,043 INFO L82 PathProgramCache]: Analyzing trace with hash 161382844, now seen corresponding path program 1 times [2021-01-06 20:31:56,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:31:56,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985699113] [2021-01-06 20:31:56,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:31:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:31:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:31:56,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985699113] [2021-01-06 20:31:56,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:31:56,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:31:56,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937262176] [2021-01-06 20:31:56,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:31:56,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:31:56,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:31:56,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:31:56,095 INFO L87 Difference]: Start difference. First operand 3238 states and 4749 transitions. Second operand 3 states. [2021-01-06 20:31:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:31:56,481 INFO L93 Difference]: Finished difference Result 7168 states and 10493 transitions. [2021-01-06 20:31:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:31:56,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-06 20:31:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:31:56,506 INFO L225 Difference]: With dead ends: 7168 [2021-01-06 20:31:56,506 INFO L226 Difference]: Without dead ends: 3950 [2021-01-06 20:31:56,512 INFO L677 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 [2021-01-06 20:31:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2021-01-06 20:31:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3928. [2021-01-06 20:31:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2021-01-06 20:31:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 5703 transitions. [2021-01-06 20:31:56,904 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 5703 transitions. Word has length 44 [2021-01-06 20:31:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:31:56,904 INFO L481 AbstractCegarLoop]: Abstraction has 3928 states and 5703 transitions. [2021-01-06 20:31:56,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:31:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 5703 transitions. [2021-01-06 20:31:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:31:56,907 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:31:56,908 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 20:31:56,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 20:31:56,908 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:31:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:31:56,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1477612707, now seen corresponding path program 1 times [2021-01-06 20:31:56,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:31:56,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34770265] [2021-01-06 20:31:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:31:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:31:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:31:56,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34770265] [2021-01-06 20:31:56,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:31:56,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:31:56,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166682778] [2021-01-06 20:31:56,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:31:56,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:31:56,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:31:56,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:31:56,960 INFO L87 Difference]: Start difference. First operand 3928 states and 5703 transitions. Second operand 3 states. [2021-01-06 20:31:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:31:57,566 INFO L93 Difference]: Finished difference Result 9069 states and 13163 transitions. [2021-01-06 20:31:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:31:57,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 20:31:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:31:57,599 INFO L225 Difference]: With dead ends: 9069 [2021-01-06 20:31:57,600 INFO L226 Difference]: Without dead ends: 6251 [2021-01-06 20:31:57,605 INFO L677 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 [2021-01-06 20:31:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2021-01-06 20:31:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6249. [2021-01-06 20:31:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6249 states. [2021-01-06 20:31:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 8949 transitions. [2021-01-06 20:31:58,208 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 8949 transitions. Word has length 63 [2021-01-06 20:31:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:31:58,208 INFO L481 AbstractCegarLoop]: Abstraction has 6249 states and 8949 transitions. [2021-01-06 20:31:58,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:31:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 8949 transitions. [2021-01-06 20:31:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:31:58,213 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:31:58,213 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 20:31:58,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 20:31:58,214 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:31:58,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:31:58,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1700716252, now seen corresponding path program 1 times [2021-01-06 20:31:58,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:31:58,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379687544] [2021-01-06 20:31:58,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:31:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:31:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:31:58,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379687544] [2021-01-06 20:31:58,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935985613] [2021-01-06 20:31:58,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 20:31:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:31:58,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 20:31:58,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 20:31:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 20:31:59,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 20:31:59,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2021-01-06 20:31:59,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157868154] [2021-01-06 20:31:59,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 20:31:59,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:31:59,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 20:31:59,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-01-06 20:31:59,125 INFO L87 Difference]: Start difference. First operand 6249 states and 8949 transitions. Second operand 12 states. [2021-01-06 20:32:00,522 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2021-01-06 20:32:03,387 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2021-01-06 20:32:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:32:09,018 INFO L93 Difference]: Finished difference Result 45661 states and 64084 transitions. [2021-01-06 20:32:09,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-01-06 20:32:09,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2021-01-06 20:32:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:32:09,138 INFO L225 Difference]: With dead ends: 45661 [2021-01-06 20:32:09,139 INFO L226 Difference]: Without dead ends: 39947 [2021-01-06 20:32:09,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1361, Invalid=5949, Unknown=0, NotChecked=0, Total=7310 [2021-01-06 20:32:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39947 states. [2021-01-06 20:32:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39947 to 16731. [2021-01-06 20:32:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2021-01-06 20:32:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 23456 transitions. [2021-01-06 20:32:11,625 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 23456 transitions. Word has length 63 [2021-01-06 20:32:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:32:11,625 INFO L481 AbstractCegarLoop]: Abstraction has 16731 states and 23456 transitions. [2021-01-06 20:32:11,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 20:32:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 23456 transitions. [2021-01-06 20:32:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:32:11,631 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:32:11,632 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 20:32:11,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 20:32:11,846 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:32:11,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:32:11,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1091273178, now seen corresponding path program 1 times [2021-01-06 20:32:11,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:32:11,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396876085] [2021-01-06 20:32:11,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:32:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:32:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 20:32:11,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396876085] [2021-01-06 20:32:11,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:32:11,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:32:11,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351753918] [2021-01-06 20:32:11,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:32:11,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:32:11,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:32:11,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:32:11,969 INFO L87 Difference]: Start difference. First operand 16731 states and 23456 transitions. Second operand 5 states. [2021-01-06 20:32:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:32:13,931 INFO L93 Difference]: Finished difference Result 29639 states and 41875 transitions. [2021-01-06 20:32:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:32:13,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2021-01-06 20:32:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:32:13,982 INFO L225 Difference]: With dead ends: 29639 [2021-01-06 20:32:13,982 INFO L226 Difference]: Without dead ends: 22656 [2021-01-06 20:32:14,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:32:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22656 states. [2021-01-06 20:32:15,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22656 to 21348. [2021-01-06 20:32:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21348 states. [2021-01-06 20:32:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21348 states to 21348 states and 29819 transitions. [2021-01-06 20:32:16,010 INFO L78 Accepts]: Start accepts. Automaton has 21348 states and 29819 transitions. Word has length 63 [2021-01-06 20:32:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:32:16,010 INFO L481 AbstractCegarLoop]: Abstraction has 21348 states and 29819 transitions. [2021-01-06 20:32:16,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:32:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 21348 states and 29819 transitions. [2021-01-06 20:32:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:32:16,016 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:32:16,016 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 20:32:16,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 20:32:16,016 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:32:16,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:32:16,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1327011341, now seen corresponding path program 1 times [2021-01-06 20:32:16,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:32:16,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052847357] [2021-01-06 20:32:16,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:32:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:32:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:32:16,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052847357] [2021-01-06 20:32:16,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:32:16,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:32:16,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752440839] [2021-01-06 20:32:16,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:32:16,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:32:16,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:32:16,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:32:16,077 INFO L87 Difference]: Start difference. First operand 21348 states and 29819 transitions. Second operand 3 states. [2021-01-06 20:32:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:32:18,406 INFO L93 Difference]: Finished difference Result 36875 states and 51396 transitions. [2021-01-06 20:32:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:32:18,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 20:32:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:32:18,583 INFO L225 Difference]: With dead ends: 36875 [2021-01-06 20:32:18,583 INFO L226 Difference]: Without dead ends: 22332 [2021-01-06 20:32:18,609 INFO L677 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 [2021-01-06 20:32:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22332 states. [2021-01-06 20:32:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22332 to 21455. [2021-01-06 20:32:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21455 states. [2021-01-06 20:32:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21455 states to 21455 states and 29437 transitions. [2021-01-06 20:32:20,675 INFO L78 Accepts]: Start accepts. Automaton has 21455 states and 29437 transitions. Word has length 63 [2021-01-06 20:32:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:32:20,676 INFO L481 AbstractCegarLoop]: Abstraction has 21455 states and 29437 transitions. [2021-01-06 20:32:20,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:32:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 21455 states and 29437 transitions. [2021-01-06 20:32:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:32:20,681 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:32:20,681 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 20:32:20,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 20:32:20,682 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:32:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:32:20,682 INFO L82 PathProgramCache]: Analyzing trace with hash 161019487, now seen corresponding path program 1 times [2021-01-06 20:32:20,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:32:20,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844987640] [2021-01-06 20:32:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:32:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:32:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 20:32:20,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844987640] [2021-01-06 20:32:20,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:32:20,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:32:20,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433568622] [2021-01-06 20:32:20,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:32:20,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:32:20,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:32:20,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:32:20,759 INFO L87 Difference]: Start difference. First operand 21455 states and 29437 transitions. Second operand 6 states. [2021-01-06 20:32:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:32:25,545 INFO L93 Difference]: Finished difference Result 73798 states and 100676 transitions. [2021-01-06 20:32:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:32:25,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2021-01-06 20:32:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:32:25,679 INFO L225 Difference]: With dead ends: 73798 [2021-01-06 20:32:25,680 INFO L226 Difference]: Without dead ends: 52430 [2021-01-06 20:32:25,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-06 20:32:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52430 states. [2021-01-06 20:32:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52430 to 51998. [2021-01-06 20:32:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51998 states. [2021-01-06 20:32:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51998 states to 51998 states and 70570 transitions. [2021-01-06 20:32:31,149 INFO L78 Accepts]: Start accepts. Automaton has 51998 states and 70570 transitions. Word has length 63 [2021-01-06 20:32:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:32:31,149 INFO L481 AbstractCegarLoop]: Abstraction has 51998 states and 70570 transitions. [2021-01-06 20:32:31,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:32:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 51998 states and 70570 transitions. [2021-01-06 20:32:31,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 20:32:31,154 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:32:31,154 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 20:32:31,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 20:32:31,155 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:32:31,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:32:31,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1235936444, now seen corresponding path program 1 times [2021-01-06 20:32:31,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:32:31,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66765281] [2021-01-06 20:32:31,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:32:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:32:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 20:32:31,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66765281] [2021-01-06 20:32:31,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:32:31,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:32:31,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259030029] [2021-01-06 20:32:31,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:32:31,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:32:31,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:32:31,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:32:31,255 INFO L87 Difference]: Start difference. First operand 51998 states and 70570 transitions. Second operand 5 states. [2021-01-06 20:32:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:32:36,550 INFO L93 Difference]: Finished difference Result 72154 states and 98941 transitions. [2021-01-06 20:32:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:32:36,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2021-01-06 20:32:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:32:36,654 INFO L225 Difference]: With dead ends: 72154 [2021-01-06 20:32:36,655 INFO L226 Difference]: Without dead ends: 64891 [2021-01-06 20:32:36,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:32:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64891 states. [2021-01-06 20:32:42,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64891 to 59035. [2021-01-06 20:32:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59035 states. [2021-01-06 20:32:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59035 states to 59035 states and 80297 transitions. [2021-01-06 20:32:42,368 INFO L78 Accepts]: Start accepts. Automaton has 59035 states and 80297 transitions. Word has length 63 [2021-01-06 20:32:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:32:42,368 INFO L481 AbstractCegarLoop]: Abstraction has 59035 states and 80297 transitions. [2021-01-06 20:32:42,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:32:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 59035 states and 80297 transitions. [2021-01-06 20:32:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 20:32:42,374 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:32:42,374 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 20:32:42,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 20:32:42,375 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:32:42,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:32:42,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1004794437, now seen corresponding path program 1 times [2021-01-06 20:32:42,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:32:42,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166008151] [2021-01-06 20:32:42,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:32:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:32:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:32:42,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166008151] [2021-01-06 20:32:42,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:32:42,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:32:42,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560558052] [2021-01-06 20:32:42,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:32:42,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:32:42,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:32:42,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:32:42,427 INFO L87 Difference]: Start difference. First operand 59035 states and 80297 transitions. Second operand 3 states. [2021-01-06 20:32:47,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:32:47,740 INFO L93 Difference]: Finished difference Result 89067 states and 120758 transitions. [2021-01-06 20:32:47,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:32:47,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 20:32:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:32:47,807 INFO L225 Difference]: With dead ends: 89067 [2021-01-06 20:32:47,808 INFO L226 Difference]: Without dead ends: 59054 [2021-01-06 20:32:47,835 INFO L677 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 [2021-01-06 20:32:47,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59054 states. [2021-01-06 20:32:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59054 to 53715. [2021-01-06 20:32:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53715 states. [2021-01-06 20:32:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53715 states to 53715 states and 72445 transitions. [2021-01-06 20:32:52,902 INFO L78 Accepts]: Start accepts. Automaton has 53715 states and 72445 transitions. Word has length 64 [2021-01-06 20:32:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:32:52,902 INFO L481 AbstractCegarLoop]: Abstraction has 53715 states and 72445 transitions. [2021-01-06 20:32:52,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:32:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 53715 states and 72445 transitions. [2021-01-06 20:32:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 20:32:52,908 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:32:52,908 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 20:32:52,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 20:32:52,909 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:32:52,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:32:52,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1607670003, now seen corresponding path program 1 times [2021-01-06 20:32:52,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:32:52,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750366167] [2021-01-06 20:32:52,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:32:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:32:52,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 20:32:52,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750366167] [2021-01-06 20:32:52,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:32:52,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:32:52,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211348643] [2021-01-06 20:32:52,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:32:52,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:32:52,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:32:52,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:32:52,985 INFO L87 Difference]: Start difference. First operand 53715 states and 72445 transitions. Second operand 5 states. [2021-01-06 20:32:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:32:58,915 INFO L93 Difference]: Finished difference Result 70932 states and 96465 transitions. [2021-01-06 20:32:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:32:58,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2021-01-06 20:32:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:32:58,996 INFO L225 Difference]: With dead ends: 70932 [2021-01-06 20:32:58,996 INFO L226 Difference]: Without dead ends: 62193 [2021-01-06 20:32:59,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 20:32:59,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62193 states. [2021-01-06 20:33:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62193 to 59567. [2021-01-06 20:33:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59567 states. [2021-01-06 20:33:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59567 states to 59567 states and 80278 transitions. [2021-01-06 20:33:04,684 INFO L78 Accepts]: Start accepts. Automaton has 59567 states and 80278 transitions. Word has length 65 [2021-01-06 20:33:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:33:04,685 INFO L481 AbstractCegarLoop]: Abstraction has 59567 states and 80278 transitions. [2021-01-06 20:33:04,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:33:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 59567 states and 80278 transitions. [2021-01-06 20:33:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 20:33:04,691 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:33:04,692 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 20:33:04,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 20:33:04,692 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:33:04,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:33:04,693 INFO L82 PathProgramCache]: Analyzing trace with hash 254858913, now seen corresponding path program 1 times [2021-01-06 20:33:04,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:33:04,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651999020] [2021-01-06 20:33:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:33:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:33:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:33:04,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651999020] [2021-01-06 20:33:04,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:33:04,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:33:04,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199699205] [2021-01-06 20:33:04,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:33:04,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:33:04,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:33:04,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:33:04,737 INFO L87 Difference]: Start difference. First operand 59567 states and 80278 transitions. Second operand 3 states. [2021-01-06 20:33:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:33:12,291 INFO L93 Difference]: Finished difference Result 127588 states and 171724 transitions. [2021-01-06 20:33:12,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:33:12,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 20:33:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:33:12,391 INFO L225 Difference]: With dead ends: 127588 [2021-01-06 20:33:12,391 INFO L226 Difference]: Without dead ends: 82551 [2021-01-06 20:33:12,430 INFO L677 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 [2021-01-06 20:33:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82551 states. [2021-01-06 20:33:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82551 to 82549. [2021-01-06 20:33:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82549 states. [2021-01-06 20:33:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82549 states to 82549 states and 109562 transitions. [2021-01-06 20:33:20,480 INFO L78 Accepts]: Start accepts. Automaton has 82549 states and 109562 transitions. Word has length 66 [2021-01-06 20:33:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:33:20,481 INFO L481 AbstractCegarLoop]: Abstraction has 82549 states and 109562 transitions. [2021-01-06 20:33:20,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:33:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 82549 states and 109562 transitions. [2021-01-06 20:33:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 20:33:20,489 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:33:20,489 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 20:33:20,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 20:33:20,489 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:33:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:33:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2033011702, now seen corresponding path program 1 times [2021-01-06 20:33:20,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:33:20,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554361117] [2021-01-06 20:33:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:33:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:33:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 20:33:20,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554361117] [2021-01-06 20:33:20,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:33:20,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:33:20,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910813235] [2021-01-06 20:33:20,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:33:20,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:33:20,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:33:20,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:33:20,575 INFO L87 Difference]: Start difference. First operand 82549 states and 109562 transitions. Second operand 6 states. [2021-01-06 20:33:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:33:39,506 INFO L93 Difference]: Finished difference Result 277378 states and 366154 transitions. [2021-01-06 20:33:39,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:33:39,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2021-01-06 20:33:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:33:39,845 INFO L225 Difference]: With dead ends: 277378 [2021-01-06 20:33:39,845 INFO L226 Difference]: Without dead ends: 194886 [2021-01-06 20:33:39,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-06 20:33:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194886 states. [2021-01-06 20:33:59,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194886 to 193293. [2021-01-06 20:33:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193293 states. [2021-01-06 20:33:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193293 states to 193293 states and 253611 transitions. [2021-01-06 20:33:59,840 INFO L78 Accepts]: Start accepts. Automaton has 193293 states and 253611 transitions. Word has length 68 [2021-01-06 20:33:59,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:33:59,841 INFO L481 AbstractCegarLoop]: Abstraction has 193293 states and 253611 transitions. [2021-01-06 20:33:59,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:33:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 193293 states and 253611 transitions. [2021-01-06 20:33:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 20:33:59,865 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:33:59,866 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 20:33:59,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 20:33:59,866 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:33:59,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:33:59,867 INFO L82 PathProgramCache]: Analyzing trace with hash -767181137, now seen corresponding path program 1 times [2021-01-06 20:33:59,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:33:59,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75191142] [2021-01-06 20:33:59,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:33:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:34:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:34:00,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75191142] [2021-01-06 20:34:00,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711629156] [2021-01-06 20:34:00,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 20:34:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:34:00,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 20:34:00,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 20:34:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 20:34:00,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 20:34:00,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-01-06 20:34:00,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246914130] [2021-01-06 20:34:00,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 20:34:00,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:34:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 20:34:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-01-06 20:34:00,399 INFO L87 Difference]: Start difference. First operand 193293 states and 253611 transitions. Second operand 11 states.