/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.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 20:38:55,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 20:38:55,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 20:38:55,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 20:38:55,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 20:38:55,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 20:38:55,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 20:38:55,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 20:38:55,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 20:38:55,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 20:38:55,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 20:38:55,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 20:38:55,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 20:38:55,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 20:38:55,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 20:38:55,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 20:38:55,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 20:38:55,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 20:38:55,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 20:38:55,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 20:38:55,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 20:38:55,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 20:38:55,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 20:38:55,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 20:38:55,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 20:38:55,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 20:38:55,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 20:38:55,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 20:38:55,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 20:38:55,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 20:38:55,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 20:38:55,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 20:38:55,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 20:38:55,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 20:38:55,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 20:38:55,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 20:38:55,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 20:38:55,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 20:38:55,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 20:38:55,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 20:38:55,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 20:38:55,411 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:38:55,436 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 20:38:55,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 20:38:55,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 20:38:55,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 20:38:55,439 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 20:38:55,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 20:38:55,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 20:38:55,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 20:38:55,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 20:38:55,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 20:38:55,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 20:38:55,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 20:38:55,440 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 20:38:55,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 20:38:55,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 20:38:55,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 20:38:55,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 20:38:55,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 20:38:55,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 20:38:55,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 20:38:55,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 20:38:55,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 20:38:55,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 20:38:55,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 20:38:55,442 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 20:38:55,443 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:38:55,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 20:38:55,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 20:38:55,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 20:38:55,880 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 20:38:55,881 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 20:38:55,882 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.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2021-01-06 20:38:55,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8e8d9180e/1488724a0d9f4255bd30b24e040b45f3/FLAGbbd8375b3 [2021-01-06 20:38:56,612 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 20:38:56,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2021-01-06 20:38:56,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8e8d9180e/1488724a0d9f4255bd30b24e040b45f3/FLAGbbd8375b3 [2021-01-06 20:38:56,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8e8d9180e/1488724a0d9f4255bd30b24e040b45f3 [2021-01-06 20:38:56,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 20:38:56,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 20:38:56,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 20:38:56,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 20:38:56,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 20:38:56,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:38:56" (1/1) ... [2021-01-06 20:38:56,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41779e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:38:56, skipping insertion in model container [2021-01-06 20:38:56,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 08:38:56" (1/1) ... [2021-01-06 20:38:56,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 20:38:57,029 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[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_19141~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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_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[~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[~node2__m2~0,] 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[~node3__m3~0,] 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[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_19240~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,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_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~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] 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[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_19398~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] [2021-01-06 20:38:57,262 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.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6703,6716] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_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~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] 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[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~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~1,] 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~1,] 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~1,] 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~1,] 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~1,] 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~1,] 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,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~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[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~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[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~1,] [2021-01-06 20:38:57,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:38:57,391 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[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~alive4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~init__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_19141~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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_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[~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[~node2__m2~0,] 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[~node3__m3~0,] 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[~node4__m4~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~__return_19240~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,] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_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~1,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~1,] 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[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~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[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__return_19398~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main__c1~0,] left hand side expression in assignment: lhs: VariableLHS[~__tmp_2~0,] left hand side expression in assignment: lhs: VariableLHS[~assert__arg~1,] [2021-01-06 20:38:57,511 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.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6703,6716] left hand side expression in assignment: lhs: VariableLHS[~node1__m1~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~p4_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~2,] left hand side expression in assignment: lhs: VariableLHS[~node2__m2~2,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~node3__m3~2,] 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[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~node4__m4~2,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~1,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~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~1,] 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~1,] 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~1,] 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~1,] 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~1,] 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~1,] 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,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~check__tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~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[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~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[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_0~0,] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~1,] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node4____CPAchecker_TMP_1~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node3____CPAchecker_TMP_1~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node2____CPAchecker_TMP_1~1,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~node1____CPAchecker_TMP_1~1,] [2021-01-06 20:38:57,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 20:38:57,590 INFO L208 MainTranslator]: Completed translation [2021-01-06 20:38:57,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:38:57 WrapperNode [2021-01-06 20:38:57,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 20:38:57,593 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 20:38:57,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 20:38:57,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 20:38:57,605 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:38:57" (1/1) ... [2021-01-06 20:38:57,621 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:38:57" (1/1) ... [2021-01-06 20:38:57,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 20:38:57,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 20:38:57,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 20:38:57,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 20:38:57,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:38:57" (1/1) ... [2021-01-06 20:38:57,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:38:57" (1/1) ... [2021-01-06 20:38:57,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:38:57" (1/1) ... [2021-01-06 20:38:57,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:38:57" (1/1) ... [2021-01-06 20:38:57,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:38:57" (1/1) ... [2021-01-06 20:38:57,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:38:57" (1/1) ... [2021-01-06 20:38:57,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:38:57" (1/1) ... [2021-01-06 20:38:57,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 20:38:57,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 20:38:57,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 20:38:57,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 20:38:57,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:38:57" (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:38:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 20:38:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 20:38:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 20:38:57,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 20:38:59,145 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 20:38:59,146 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 20:38:59,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:38:59 BoogieIcfgContainer [2021-01-06 20:38:59,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 20:38:59,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 20:38:59,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 20:38:59,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 20:38:59,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 08:38:56" (1/3) ... [2021-01-06 20:38:59,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1081ce50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:38:59, skipping insertion in model container [2021-01-06 20:38:59,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 08:38:57" (2/3) ... [2021-01-06 20:38:59,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1081ce50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 08:38:59, skipping insertion in model container [2021-01-06 20:38:59,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 08:38:59" (3/3) ... [2021-01-06 20:38:59,157 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2021-01-06 20:38:59,164 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 20:38:59,169 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 20:38:59,189 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 20:38:59,217 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 20:38:59,218 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 20:38:59,218 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 20:38:59,218 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 20:38:59,218 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 20:38:59,218 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 20:38:59,219 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 20:38:59,219 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 20:38:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2021-01-06 20:38:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 20:38:59,252 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:38:59,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 20:38:59,253 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:38:59,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:38:59,259 INFO L82 PathProgramCache]: Analyzing trace with hash -113151096, now seen corresponding path program 1 times [2021-01-06 20:38:59,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:38:59,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239683413] [2021-01-06 20:38:59,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:38:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:38:59,810 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:38:59,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239683413] [2021-01-06 20:38:59,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:38:59,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:38:59,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380153085] [2021-01-06 20:38:59,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:38:59,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:38:59,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:38:59,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:38:59,846 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 3 states. [2021-01-06 20:39:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:39:00,048 INFO L93 Difference]: Finished difference Result 364 states and 598 transitions. [2021-01-06 20:39:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:39:00,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 20:39:00,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:39:00,068 INFO L225 Difference]: With dead ends: 364 [2021-01-06 20:39:00,068 INFO L226 Difference]: Without dead ends: 274 [2021-01-06 20:39:00,072 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:39:00,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-01-06 20:39:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2021-01-06 20:39:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2021-01-06 20:39:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 410 transitions. [2021-01-06 20:39:00,149 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 410 transitions. Word has length 64 [2021-01-06 20:39:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:39:00,150 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 410 transitions. [2021-01-06 20:39:00,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:39:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 410 transitions. [2021-01-06 20:39:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 20:39:00,154 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:39:00,155 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, 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:39:00,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 20:39:00,155 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:39:00,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:39:00,156 INFO L82 PathProgramCache]: Analyzing trace with hash 507394196, now seen corresponding path program 1 times [2021-01-06 20:39:00,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:39:00,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388237720] [2021-01-06 20:39:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:39:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:39:00,485 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:39:00,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388237720] [2021-01-06 20:39:00,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:39:00,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 20:39:00,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644478153] [2021-01-06 20:39:00,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:39:00,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:39:00,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:39:00,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:39:00,492 INFO L87 Difference]: Start difference. First operand 272 states and 410 transitions. Second operand 6 states. [2021-01-06 20:39:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:39:00,966 INFO L93 Difference]: Finished difference Result 1002 states and 1550 transitions. [2021-01-06 20:39:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 20:39:00,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2021-01-06 20:39:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:39:00,985 INFO L225 Difference]: With dead ends: 1002 [2021-01-06 20:39:00,985 INFO L226 Difference]: Without dead ends: 792 [2021-01-06 20:39:00,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:39:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2021-01-06 20:39:01,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 786. [2021-01-06 20:39:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2021-01-06 20:39:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1206 transitions. [2021-01-06 20:39:01,110 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1206 transitions. Word has length 65 [2021-01-06 20:39:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:39:01,111 INFO L481 AbstractCegarLoop]: Abstraction has 786 states and 1206 transitions. [2021-01-06 20:39:01,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:39:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1206 transitions. [2021-01-06 20:39:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 20:39:01,118 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:39:01,118 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, 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:39:01,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 20:39:01,119 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:39:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:39:01,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1175932082, now seen corresponding path program 1 times [2021-01-06 20:39:01,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:39:01,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28283753] [2021-01-06 20:39:01,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:39:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:39:01,266 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:39:01,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28283753] [2021-01-06 20:39:01,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:39:01,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:39:01,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67589181] [2021-01-06 20:39:01,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:39:01,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:39:01,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:39:01,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:39:01,270 INFO L87 Difference]: Start difference. First operand 786 states and 1206 transitions. Second operand 6 states. [2021-01-06 20:39:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:39:01,769 INFO L93 Difference]: Finished difference Result 2640 states and 4113 transitions. [2021-01-06 20:39:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:39:01,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2021-01-06 20:39:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:39:01,785 INFO L225 Difference]: With dead ends: 2640 [2021-01-06 20:39:01,786 INFO L226 Difference]: Without dead ends: 1904 [2021-01-06 20:39:01,793 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:39:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2021-01-06 20:39:01,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1900. [2021-01-06 20:39:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2021-01-06 20:39:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2951 transitions. [2021-01-06 20:39:01,984 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2951 transitions. Word has length 66 [2021-01-06 20:39:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:39:01,985 INFO L481 AbstractCegarLoop]: Abstraction has 1900 states and 2951 transitions. [2021-01-06 20:39:01,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:39:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2951 transitions. [2021-01-06 20:39:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 20:39:01,989 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:39:01,990 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, 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:39:01,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 20:39:01,990 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:39:01,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:39:01,993 INFO L82 PathProgramCache]: Analyzing trace with hash 195420080, now seen corresponding path program 1 times [2021-01-06 20:39:01,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:39:01,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757948213] [2021-01-06 20:39:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:39:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:39:02,113 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:39:02,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757948213] [2021-01-06 20:39:02,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:39:02,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:39:02,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111394315] [2021-01-06 20:39:02,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:39:02,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:39:02,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:39:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:39:02,117 INFO L87 Difference]: Start difference. First operand 1900 states and 2951 transitions. Second operand 6 states. [2021-01-06 20:39:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:39:02,788 INFO L93 Difference]: Finished difference Result 6610 states and 10356 transitions. [2021-01-06 20:39:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:39:02,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2021-01-06 20:39:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:39:02,815 INFO L225 Difference]: With dead ends: 6610 [2021-01-06 20:39:02,815 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 20:39:02,819 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:39:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 20:39:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4370. [2021-01-06 20:39:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4370 states. [2021-01-06 20:39:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4370 states to 4370 states and 6814 transitions. [2021-01-06 20:39:03,180 INFO L78 Accepts]: Start accepts. Automaton has 4370 states and 6814 transitions. Word has length 66 [2021-01-06 20:39:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:39:03,183 INFO L481 AbstractCegarLoop]: Abstraction has 4370 states and 6814 transitions. [2021-01-06 20:39:03,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:39:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4370 states and 6814 transitions. [2021-01-06 20:39:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 20:39:03,186 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:39:03,186 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, 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:39:03,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 20:39:03,187 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:39:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:39:03,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2140991135, now seen corresponding path program 1 times [2021-01-06 20:39:03,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:39:03,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181348354] [2021-01-06 20:39:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:39:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:39:03,319 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:39:03,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181348354] [2021-01-06 20:39:03,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:39:03,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:39:03,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908232269] [2021-01-06 20:39:03,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:39:03,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:39:03,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:39:03,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:39:03,324 INFO L87 Difference]: Start difference. First operand 4370 states and 6814 transitions. Second operand 6 states. [2021-01-06 20:39:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:39:04,412 INFO L93 Difference]: Finished difference Result 16439 states and 25701 transitions. [2021-01-06 20:39:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:39:04,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2021-01-06 20:39:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:39:04,474 INFO L225 Difference]: With dead ends: 16439 [2021-01-06 20:39:04,475 INFO L226 Difference]: Without dead ends: 12142 [2021-01-06 20:39:04,483 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:39:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12142 states. [2021-01-06 20:39:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12142 to 12138. [2021-01-06 20:39:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12138 states. [2021-01-06 20:39:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12138 states to 12138 states and 18894 transitions. [2021-01-06 20:39:05,398 INFO L78 Accepts]: Start accepts. Automaton has 12138 states and 18894 transitions. Word has length 66 [2021-01-06 20:39:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:39:05,399 INFO L481 AbstractCegarLoop]: Abstraction has 12138 states and 18894 transitions. [2021-01-06 20:39:05,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 20:39:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 12138 states and 18894 transitions. [2021-01-06 20:39:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 20:39:05,403 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:39:05,403 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, 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:39:05,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 20:39:05,404 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:39:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:39:05,404 INFO L82 PathProgramCache]: Analyzing trace with hash -472666691, now seen corresponding path program 1 times [2021-01-06 20:39:05,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:39:05,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285362474] [2021-01-06 20:39:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:39:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:39:05,478 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:39:05,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285362474] [2021-01-06 20:39:05,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:39:05,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:39:05,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078854355] [2021-01-06 20:39:05,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:39:05,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:39:05,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:39:05,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:39:05,481 INFO L87 Difference]: Start difference. First operand 12138 states and 18894 transitions. Second operand 5 states. [2021-01-06 20:39:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:39:07,162 INFO L93 Difference]: Finished difference Result 36102 states and 56266 transitions. [2021-01-06 20:39:07,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:39:07,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2021-01-06 20:39:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:39:07,266 INFO L225 Difference]: With dead ends: 36102 [2021-01-06 20:39:07,266 INFO L226 Difference]: Without dead ends: 23998 [2021-01-06 20:39:07,288 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:39:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23998 states. [2021-01-06 20:39:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23998 to 23996. [2021-01-06 20:39:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23996 states. [2021-01-06 20:39:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23996 states to 23996 states and 37065 transitions. [2021-01-06 20:39:09,087 INFO L78 Accepts]: Start accepts. Automaton has 23996 states and 37065 transitions. Word has length 66 [2021-01-06 20:39:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:39:09,087 INFO L481 AbstractCegarLoop]: Abstraction has 23996 states and 37065 transitions. [2021-01-06 20:39:09,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:39:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 23996 states and 37065 transitions. [2021-01-06 20:39:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 20:39:09,091 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:39:09,092 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, 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:39:09,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 20:39:09,092 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:39:09,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:39:09,098 INFO L82 PathProgramCache]: Analyzing trace with hash 545251456, now seen corresponding path program 1 times [2021-01-06 20:39:09,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:39:09,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113050786] [2021-01-06 20:39:09,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:39:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:39:09,299 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:39:09,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113050786] [2021-01-06 20:39:09,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:39:09,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 20:39:09,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795926611] [2021-01-06 20:39:09,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 20:39:09,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:39:09,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 20:39:09,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:39:09,302 INFO L87 Difference]: Start difference. First operand 23996 states and 37065 transitions. Second operand 5 states. [2021-01-06 20:39:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:39:12,023 INFO L93 Difference]: Finished difference Result 43966 states and 67489 transitions. [2021-01-06 20:39:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 20:39:12,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2021-01-06 20:39:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:39:12,139 INFO L225 Difference]: With dead ends: 43966 [2021-01-06 20:39:12,139 INFO L226 Difference]: Without dead ends: 43964 [2021-01-06 20:39:12,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:39:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43964 states. [2021-01-06 20:39:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43964 to 24392. [2021-01-06 20:39:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24392 states. [2021-01-06 20:39:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24392 states to 24392 states and 37461 transitions. [2021-01-06 20:39:13,940 INFO L78 Accepts]: Start accepts. Automaton has 24392 states and 37461 transitions. Word has length 67 [2021-01-06 20:39:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:39:13,941 INFO L481 AbstractCegarLoop]: Abstraction has 24392 states and 37461 transitions. [2021-01-06 20:39:13,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 20:39:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 24392 states and 37461 transitions. [2021-01-06 20:39:13,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 20:39:13,949 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:39:13,950 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, 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:39:13,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 20:39:13,951 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:39:13,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:39:13,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2333062, now seen corresponding path program 1 times [2021-01-06 20:39:13,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:39:13,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26544817] [2021-01-06 20:39:13,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:39:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:39:14,188 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:39:14,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26544817] [2021-01-06 20:39:14,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:39:14,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 20:39:14,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590865504] [2021-01-06 20:39:14,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 20:39:14,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:39:14,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 20:39:14,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-06 20:39:14,191 INFO L87 Difference]: Start difference. First operand 24392 states and 37461 transitions. Second operand 10 states. [2021-01-06 20:39:27,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:39:27,147 INFO L93 Difference]: Finished difference Result 197303 states and 303266 transitions. [2021-01-06 20:39:27,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-01-06 20:39:27,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2021-01-06 20:39:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:39:27,758 INFO L225 Difference]: With dead ends: 197303 [2021-01-06 20:39:27,759 INFO L226 Difference]: Without dead ends: 181193 [2021-01-06 20:39:28,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2021-01-06 20:39:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181193 states. [2021-01-06 20:39:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181193 to 24552. [2021-01-06 20:39:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24552 states. [2021-01-06 20:39:32,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24552 states to 24552 states and 37663 transitions. [2021-01-06 20:39:32,068 INFO L78 Accepts]: Start accepts. Automaton has 24552 states and 37663 transitions. Word has length 68 [2021-01-06 20:39:32,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:39:32,068 INFO L481 AbstractCegarLoop]: Abstraction has 24552 states and 37663 transitions. [2021-01-06 20:39:32,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 20:39:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 24552 states and 37663 transitions. [2021-01-06 20:39:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 20:39:32,074 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:39:32,074 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, 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:39:32,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 20:39:32,075 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:39:32,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:39:32,075 INFO L82 PathProgramCache]: Analyzing trace with hash -371480250, now seen corresponding path program 1 times [2021-01-06 20:39:32,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:39:32,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117589782] [2021-01-06 20:39:32,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:39:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:39:32,314 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:39:32,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117589782] [2021-01-06 20:39:32,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:39:32,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 20:39:32,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335059919] [2021-01-06 20:39:32,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 20:39:32,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:39:32,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 20:39:32,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-06 20:39:32,317 INFO L87 Difference]: Start difference. First operand 24552 states and 37663 transitions. Second operand 10 states. [2021-01-06 20:39:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:39:42,127 INFO L93 Difference]: Finished difference Result 99437 states and 151942 transitions. [2021-01-06 20:39:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-06 20:39:42,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2021-01-06 20:39:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:39:42,265 INFO L225 Difference]: With dead ends: 99437 [2021-01-06 20:39:42,266 INFO L226 Difference]: Without dead ends: 94315 [2021-01-06 20:39:42,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=319, Invalid=871, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 20:39:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94315 states. [2021-01-06 20:39:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94315 to 24552. [2021-01-06 20:39:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24552 states. [2021-01-06 20:39:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24552 states to 24552 states and 37661 transitions. [2021-01-06 20:39:45,297 INFO L78 Accepts]: Start accepts. Automaton has 24552 states and 37661 transitions. Word has length 68 [2021-01-06 20:39:45,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:39:45,298 INFO L481 AbstractCegarLoop]: Abstraction has 24552 states and 37661 transitions. [2021-01-06 20:39:45,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 20:39:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 24552 states and 37661 transitions. [2021-01-06 20:39:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 20:39:45,303 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:39:45,303 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, 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:39:45,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 20:39:45,304 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:39:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:39:45,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2100624742, now seen corresponding path program 1 times [2021-01-06 20:39:45,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:39:45,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350091554] [2021-01-06 20:39:45,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:39:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:39:45,528 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:39:45,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350091554] [2021-01-06 20:39:45,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:39:45,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 20:39:45,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368434968] [2021-01-06 20:39:45,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 20:39:45,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:39:45,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 20:39:45,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-06 20:39:45,531 INFO L87 Difference]: Start difference. First operand 24552 states and 37661 transitions. Second operand 10 states. [2021-01-06 20:40:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:40:02,836 INFO L93 Difference]: Finished difference Result 163279 states and 250560 transitions. [2021-01-06 20:40:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-01-06 20:40:02,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2021-01-06 20:40:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:40:03,069 INFO L225 Difference]: With dead ends: 163279 [2021-01-06 20:40:03,070 INFO L226 Difference]: Without dead ends: 153719 [2021-01-06 20:40:03,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2021-01-06 20:40:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153719 states. [2021-01-06 20:40:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153719 to 24901. [2021-01-06 20:40:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24901 states. [2021-01-06 20:40:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24901 states to 24901 states and 38104 transitions. [2021-01-06 20:40:06,930 INFO L78 Accepts]: Start accepts. Automaton has 24901 states and 38104 transitions. Word has length 68 [2021-01-06 20:40:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:40:06,930 INFO L481 AbstractCegarLoop]: Abstraction has 24901 states and 38104 transitions. [2021-01-06 20:40:06,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 20:40:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 24901 states and 38104 transitions. [2021-01-06 20:40:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 20:40:06,935 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:40:06,935 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, 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:40:06,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 20:40:06,936 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:40:06,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:40:06,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1059619418, now seen corresponding path program 1 times [2021-01-06 20:40:06,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:40:06,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634048553] [2021-01-06 20:40:06,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:40:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:40:07,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:40:07,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634048553] [2021-01-06 20:40:07,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:40:07,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 20:40:07,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821782323] [2021-01-06 20:40:07,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 20:40:07,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:40:07,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 20:40:07,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-01-06 20:40:07,193 INFO L87 Difference]: Start difference. First operand 24901 states and 38104 transitions. Second operand 10 states. [2021-01-06 20:40:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:40:28,125 INFO L93 Difference]: Finished difference Result 167993 states and 254779 transitions. [2021-01-06 20:40:28,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-06 20:40:28,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2021-01-06 20:40:28,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:40:28,352 INFO L225 Difference]: With dead ends: 167993 [2021-01-06 20:40:28,353 INFO L226 Difference]: Without dead ends: 144182 [2021-01-06 20:40:28,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 20:40:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144182 states. [2021-01-06 20:40:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144182 to 25035. [2021-01-06 20:40:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25035 states. [2021-01-06 20:40:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25035 states to 25035 states and 38248 transitions. [2021-01-06 20:40:32,705 INFO L78 Accepts]: Start accepts. Automaton has 25035 states and 38248 transitions. Word has length 68 [2021-01-06 20:40:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:40:32,705 INFO L481 AbstractCegarLoop]: Abstraction has 25035 states and 38248 transitions. [2021-01-06 20:40:32,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 20:40:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 25035 states and 38248 transitions. [2021-01-06 20:40:32,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 20:40:32,710 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:40:32,710 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, 1, 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:40:32,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 20:40:32,710 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:40:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:40:32,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1047773961, now seen corresponding path program 1 times [2021-01-06 20:40:32,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:40:32,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150331132] [2021-01-06 20:40:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:40:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:40:32,807 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:40:32,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150331132] [2021-01-06 20:40:32,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:40:32,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:40:32,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179308023] [2021-01-06 20:40:32,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:40:32,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:40:32,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:40:32,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:40:32,809 INFO L87 Difference]: Start difference. First operand 25035 states and 38248 transitions. Second operand 4 states. [2021-01-06 20:40:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:40:38,870 INFO L93 Difference]: Finished difference Result 68206 states and 104190 transitions. [2021-01-06 20:40:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 20:40:38,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-01-06 20:40:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:40:38,925 INFO L225 Difference]: With dead ends: 68206 [2021-01-06 20:40:38,925 INFO L226 Difference]: Without dead ends: 44744 [2021-01-06 20:40:38,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 20:40:38,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44744 states. [2021-01-06 20:40:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44744 to 44373. [2021-01-06 20:40:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44373 states. [2021-01-06 20:40:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44373 states to 44373 states and 67096 transitions. [2021-01-06 20:40:45,085 INFO L78 Accepts]: Start accepts. Automaton has 44373 states and 67096 transitions. Word has length 69 [2021-01-06 20:40:45,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:40:45,086 INFO L481 AbstractCegarLoop]: Abstraction has 44373 states and 67096 transitions. [2021-01-06 20:40:45,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:40:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 44373 states and 67096 transitions. [2021-01-06 20:40:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 20:40:45,089 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:40:45,089 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, 1, 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:40:45,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 20:40:45,089 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:40:45,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:40:45,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1802228217, now seen corresponding path program 1 times [2021-01-06 20:40:45,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:40:45,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230909309] [2021-01-06 20:40:45,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:40:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:40:45,152 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:40:45,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230909309] [2021-01-06 20:40:45,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:40:45,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:40:45,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158783805] [2021-01-06 20:40:45,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:40:45,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:40:45,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:40:45,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:40:45,156 INFO L87 Difference]: Start difference. First operand 44373 states and 67096 transitions. Second operand 3 states. [2021-01-06 20:40:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:40:53,568 INFO L93 Difference]: Finished difference Result 79155 states and 119804 transitions. [2021-01-06 20:40:53,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:40:53,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-06 20:40:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:40:53,648 INFO L225 Difference]: With dead ends: 79155 [2021-01-06 20:40:53,648 INFO L226 Difference]: Without dead ends: 56633 [2021-01-06 20:40:53,687 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:40:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56633 states. [2021-01-06 20:41:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56633 to 55821. [2021-01-06 20:41:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55821 states. [2021-01-06 20:41:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55821 states to 55821 states and 83327 transitions. [2021-01-06 20:41:01,768 INFO L78 Accepts]: Start accepts. Automaton has 55821 states and 83327 transitions. Word has length 69 [2021-01-06 20:41:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:41:01,768 INFO L481 AbstractCegarLoop]: Abstraction has 55821 states and 83327 transitions. [2021-01-06 20:41:01,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:41:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 55821 states and 83327 transitions. [2021-01-06 20:41:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 20:41:01,773 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:41:01,773 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, 1, 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:41:01,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 20:41:01,774 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:41:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:41:01,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1041130329, now seen corresponding path program 1 times [2021-01-06 20:41:01,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:41:01,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939441101] [2021-01-06 20:41:01,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:41:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:41:01,823 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:41:01,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939441101] [2021-01-06 20:41:01,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:41:01,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:41:01,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675848901] [2021-01-06 20:41:01,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:41:01,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:41:01,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:41:01,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:41:01,825 INFO L87 Difference]: Start difference. First operand 55821 states and 83327 transitions. Second operand 3 states. [2021-01-06 20:41:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:41:15,801 INFO L93 Difference]: Finished difference Result 140197 states and 209682 transitions. [2021-01-06 20:41:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:41:15,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-06 20:41:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:41:15,925 INFO L225 Difference]: With dead ends: 140197 [2021-01-06 20:41:15,925 INFO L226 Difference]: Without dead ends: 93745 [2021-01-06 20:41:15,955 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:41:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93745 states. [2021-01-06 20:41:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93745 to 93539. [2021-01-06 20:41:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93539 states. [2021-01-06 20:41:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93539 states to 93539 states and 138687 transitions. [2021-01-06 20:41:29,804 INFO L78 Accepts]: Start accepts. Automaton has 93539 states and 138687 transitions. Word has length 69 [2021-01-06 20:41:29,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:41:29,804 INFO L481 AbstractCegarLoop]: Abstraction has 93539 states and 138687 transitions. [2021-01-06 20:41:29,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:41:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 93539 states and 138687 transitions. [2021-01-06 20:41:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 20:41:29,808 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:41:29,808 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, 1, 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:41:29,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 20:41:29,809 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:41:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:41:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash -933815240, now seen corresponding path program 1 times [2021-01-06 20:41:29,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:41:29,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319187669] [2021-01-06 20:41:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:41:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:41:29,859 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:41:29,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319187669] [2021-01-06 20:41:29,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:41:29,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:41:29,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086618388] [2021-01-06 20:41:29,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:41:29,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:41:29,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:41:29,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:41:29,861 INFO L87 Difference]: Start difference. First operand 93539 states and 138687 transitions. Second operand 3 states. [2021-01-06 20:41:45,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:41:45,940 INFO L93 Difference]: Finished difference Result 133996 states and 197730 transitions. [2021-01-06 20:41:45,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:41:45,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-06 20:41:45,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:41:46,094 INFO L225 Difference]: With dead ends: 133996 [2021-01-06 20:41:46,094 INFO L226 Difference]: Without dead ends: 106590 [2021-01-06 20:41:46,134 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:41:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106590 states. [2021-01-06 20:42:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106590 to 99595. [2021-01-06 20:42:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99595 states. [2021-01-06 20:42:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99595 states to 99595 states and 145173 transitions. [2021-01-06 20:42:01,943 INFO L78 Accepts]: Start accepts. Automaton has 99595 states and 145173 transitions. Word has length 69 [2021-01-06 20:42:01,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:42:01,943 INFO L481 AbstractCegarLoop]: Abstraction has 99595 states and 145173 transitions. [2021-01-06 20:42:01,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:42:01,944 INFO L276 IsEmpty]: Start isEmpty. Operand 99595 states and 145173 transitions. [2021-01-06 20:42:01,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 20:42:01,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:42:01,949 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, 1, 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:42:01,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 20:42:01,949 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:42:01,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:42:01,949 INFO L82 PathProgramCache]: Analyzing trace with hash 804290264, now seen corresponding path program 1 times [2021-01-06 20:42:01,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:42:01,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866710992] [2021-01-06 20:42:01,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:42:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:42:01,994 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:42:01,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866710992] [2021-01-06 20:42:01,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:42:01,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 20:42:01,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028958040] [2021-01-06 20:42:01,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 20:42:01,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:42:01,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 20:42:01,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 20:42:01,996 INFO L87 Difference]: Start difference. First operand 99595 states and 145173 transitions. Second operand 3 states. [2021-01-06 20:42:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:42:22,963 INFO L93 Difference]: Finished difference Result 213414 states and 310611 transitions. [2021-01-06 20:42:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 20:42:22,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-06 20:42:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:42:23,180 INFO L225 Difference]: With dead ends: 213414 [2021-01-06 20:42:23,180 INFO L226 Difference]: Without dead ends: 123709 [2021-01-06 20:42:23,254 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:42:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123709 states. [2021-01-06 20:42:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123709 to 122307. [2021-01-06 20:42:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122307 states. [2021-01-06 20:42:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122307 states to 122307 states and 174668 transitions. [2021-01-06 20:42:43,981 INFO L78 Accepts]: Start accepts. Automaton has 122307 states and 174668 transitions. Word has length 69 [2021-01-06 20:42:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:42:43,981 INFO L481 AbstractCegarLoop]: Abstraction has 122307 states and 174668 transitions. [2021-01-06 20:42:43,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 20:42:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 122307 states and 174668 transitions. [2021-01-06 20:42:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 20:42:43,984 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:42:43,984 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, 1, 1, 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:42:43,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 20:42:43,985 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:42:43,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:42:43,985 INFO L82 PathProgramCache]: Analyzing trace with hash -77781245, now seen corresponding path program 1 times [2021-01-06 20:42:43,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:42:43,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746040424] [2021-01-06 20:42:43,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:42:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:42:44,309 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:42:44,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746040424] [2021-01-06 20:42:44,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:42:44,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 20:42:44,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993827769] [2021-01-06 20:42:44,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 20:42:44,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:42:44,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 20:42:44,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 20:42:44,313 INFO L87 Difference]: Start difference. First operand 122307 states and 174668 transitions. Second operand 6 states.