/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:37:19,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:37:19,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:37:19,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:37:19,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:37:19,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:37:19,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:37:19,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:37:19,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:37:19,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:37:19,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:37:19,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:37:19,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:37:19,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:37:19,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:37:19,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:37:19,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:37:19,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:37:19,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:37:19,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:37:19,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:37:19,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:37:19,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:37:19,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:37:19,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:37:19,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:37:19,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:37:19,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:37:19,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:37:19,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:37:19,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:37:19,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:37:19,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:37:19,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:37:19,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:37:19,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:37:19,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:37:19,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:37:19,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:37:19,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:37:19,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:37:19,806 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:37:19,819 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:37:19,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:37:19,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:37:19,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:37:19,821 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:37:19,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:37:19,822 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:37:19,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:37:19,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:37:19,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:37:19,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:37:19,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:37:19,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:37:19,823 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:37:19,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:37:19,823 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:37:19,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:37:19,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:37:19,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:37:19,824 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:37:19,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:37:19,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:37:19,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:37:19,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:37:19,825 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:37:19,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:37:19,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:37:19,825 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:37:19,826 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:37:20,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:37:20,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:37:20,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:37:20,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:37:20,107 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:37:20,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2019-12-18 16:37:20,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da72520c1/03692a80f1314f2ab5765792ad3962dc/FLAG8f8ad6083 [2019-12-18 16:37:20,765 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:37:20,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2019-12-18 16:37:20,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da72520c1/03692a80f1314f2ab5765792ad3962dc/FLAG8f8ad6083 [2019-12-18 16:37:21,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da72520c1/03692a80f1314f2ab5765792ad3962dc [2019-12-18 16:37:21,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:37:21,159 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:37:21,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:37:21,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:37:21,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:37:21,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:37:21" (1/1) ... [2019-12-18 16:37:21,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449bc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21, skipping insertion in model container [2019-12-18 16:37:21,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:37:21" (1/1) ... [2019-12-18 16:37:21,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:37:21,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:37:21,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:37:21,772 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:37:21,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:37:21,971 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:37:21,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21 WrapperNode [2019-12-18 16:37:21,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:37:21,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:37:21,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:37:21,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:37:21,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21" (1/1) ... [2019-12-18 16:37:22,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21" (1/1) ... [2019-12-18 16:37:22,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:37:22,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:37:22,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:37:22,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:37:22,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21" (1/1) ... [2019-12-18 16:37:22,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21" (1/1) ... [2019-12-18 16:37:22,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21" (1/1) ... [2019-12-18 16:37:22,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21" (1/1) ... [2019-12-18 16:37:22,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21" (1/1) ... [2019-12-18 16:37:22,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21" (1/1) ... [2019-12-18 16:37:22,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21" (1/1) ... [2019-12-18 16:37:22,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:37:22,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:37:22,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:37:22,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:37:22,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-12-18 16:37:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:37:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:37:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:37:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:37:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:37:22,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:37:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:37:22,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:37:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:37:22,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:37:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:37:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:37:22,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:37:22,155 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:37:22,878 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:37:22,878 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:37:22,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:37:22 BoogieIcfgContainer [2019-12-18 16:37:22,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:37:22,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:37:22,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:37:22,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:37:22,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:37:21" (1/3) ... [2019-12-18 16:37:22,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17795c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:37:22, skipping insertion in model container [2019-12-18 16:37:22,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:37:21" (2/3) ... [2019-12-18 16:37:22,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17795c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:37:22, skipping insertion in model container [2019-12-18 16:37:22,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:37:22" (3/3) ... [2019-12-18 16:37:22,891 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc.i [2019-12-18 16:37:22,901 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:37:22,902 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:37:22,913 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:37:22,914 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:37:22,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,975 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:22,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,006 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,006 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,034 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,036 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,043 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,043 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,044 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,051 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,051 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:37:23,071 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:37:23,092 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:37:23,092 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:37:23,092 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:37:23,092 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:37:23,092 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:37:23,092 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:37:23,093 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:37:23,093 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:37:23,110 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 16:37:23,112 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 16:37:23,202 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 16:37:23,203 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:37:23,226 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:37:23,257 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 16:37:23,303 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 16:37:23,303 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:37:23,311 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:37:23,334 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 16:37:23,335 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:37:28,774 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 16:37:28,894 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 16:37:29,465 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-18 16:37:29,466 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 16:37:29,470 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-18 16:37:51,106 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-18 16:37:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-18 16:37:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:37:51,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:37:51,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:37:51,115 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:37:51,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:37:51,121 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-18 16:37:51,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:37:51,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002414920] [2019-12-18 16:37:51,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:37:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:37:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:37:51,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002414920] [2019-12-18 16:37:51,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:37:51,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:37:51,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520501689] [2019-12-18 16:37:51,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:37:51,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:37:51,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:37:51,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:37:51,355 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-18 16:37:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:37:52,611 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-18 16:37:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:37:52,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:37:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:37:53,372 INFO L225 Difference]: With dead ends: 121140 [2019-12-18 16:37:53,372 INFO L226 Difference]: Without dead ends: 107958 [2019-12-18 16:37:53,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:38:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-18 16:38:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-18 16:38:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-18 16:38:07,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-18 16:38:07,699 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-18 16:38:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:07,700 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-18 16:38:07,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:38:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-18 16:38:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:38:07,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:07,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:38:07,709 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:07,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-18 16:38:07,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:07,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960774976] [2019-12-18 16:38:07,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:07,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960774976] [2019-12-18 16:38:07,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:07,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:38:07,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077444970] [2019-12-18 16:38:07,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:38:07,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:07,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:38:07,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:38:07,860 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-18 16:38:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:09,079 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-18 16:38:09,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:38:09,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:38:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:14,893 INFO L225 Difference]: With dead ends: 172022 [2019-12-18 16:38:14,893 INFO L226 Difference]: Without dead ends: 171924 [2019-12-18 16:38:14,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:38:19,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-18 16:38:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-18 16:38:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-18 16:38:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-18 16:38:25,081 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-18 16:38:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:25,081 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-18 16:38:25,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:38:25,081 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-18 16:38:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:38:25,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:25,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:38:25,087 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:25,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-18 16:38:25,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:25,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752997874] [2019-12-18 16:38:25,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:25,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752997874] [2019-12-18 16:38:25,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:25,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:38:25,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405319535] [2019-12-18 16:38:25,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:38:25,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:25,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:38:25,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:38:25,149 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-18 16:38:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:25,289 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-18 16:38:25,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:38:25,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:38:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:25,354 INFO L225 Difference]: With dead ends: 33388 [2019-12-18 16:38:25,354 INFO L226 Difference]: Without dead ends: 33388 [2019-12-18 16:38:25,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:38:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-18 16:38:30,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-18 16:38:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-18 16:38:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-18 16:38:30,680 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-18 16:38:30,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:30,681 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-18 16:38:30,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:38:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-18 16:38:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:38:30,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:30,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:38:30,685 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:30,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:30,686 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-18 16:38:30,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:30,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191535369] [2019-12-18 16:38:30,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:30,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191535369] [2019-12-18 16:38:30,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:30,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:38:30,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775333687] [2019-12-18 16:38:30,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:38:30,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:30,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:38:30,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:38:30,753 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-18 16:38:30,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:30,958 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-18 16:38:30,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:38:30,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 16:38:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:31,052 INFO L225 Difference]: With dead ends: 52822 [2019-12-18 16:38:31,052 INFO L226 Difference]: Without dead ends: 52822 [2019-12-18 16:38:31,052 INFO L631 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 [2019-12-18 16:38:31,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-18 16:38:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-18 16:38:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-18 16:38:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-18 16:38:31,840 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-18 16:38:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:31,841 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-18 16:38:31,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:38:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-18 16:38:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:38:31,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:31,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:38:31,845 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:31,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:31,845 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-18 16:38:31,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:31,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823523950] [2019-12-18 16:38:31,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:31,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823523950] [2019-12-18 16:38:31,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:31,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:38:31,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539264360] [2019-12-18 16:38:31,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:38:31,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:38:31,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:38:31,924 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-18 16:38:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:32,348 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-18 16:38:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:38:32,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:38:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:32,452 INFO L225 Difference]: With dead ends: 46903 [2019-12-18 16:38:32,453 INFO L226 Difference]: Without dead ends: 46903 [2019-12-18 16:38:32,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:38:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-18 16:38:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-18 16:38:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 16:38:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-18 16:38:33,680 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-18 16:38:33,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:33,680 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-18 16:38:33,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:38:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-18 16:38:33,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:38:33,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:33,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:38:33,684 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:33,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-18 16:38:33,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:33,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139811314] [2019-12-18 16:38:33,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:33,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139811314] [2019-12-18 16:38:33,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:33,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:38:33,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413619874] [2019-12-18 16:38:33,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:38:33,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:33,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:38:33,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:38:33,750 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-18 16:38:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:34,129 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-18 16:38:34,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:38:34,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:38:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:34,223 INFO L225 Difference]: With dead ends: 51478 [2019-12-18 16:38:34,224 INFO L226 Difference]: Without dead ends: 51478 [2019-12-18 16:38:34,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:38:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-18 16:38:34,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-18 16:38:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-18 16:38:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-18 16:38:35,053 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-18 16:38:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:35,053 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-18 16:38:35,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:38:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-18 16:38:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:38:35,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:35,063 INFO L411 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] [2019-12-18 16:38:35,063 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:35,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-18 16:38:35,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:35,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730724727] [2019-12-18 16:38:35,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:35,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730724727] [2019-12-18 16:38:35,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:35,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:38:35,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329712191] [2019-12-18 16:38:35,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:38:35,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:35,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:38:35,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:38:35,147 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-18 16:38:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:36,136 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-18 16:38:36,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:38:36,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:38:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:36,247 INFO L225 Difference]: With dead ends: 61264 [2019-12-18 16:38:36,248 INFO L226 Difference]: Without dead ends: 61250 [2019-12-18 16:38:36,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:38:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-18 16:38:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-18 16:38:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-18 16:38:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-18 16:38:37,145 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-18 16:38:37,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:37,146 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-18 16:38:37,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:38:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-18 16:38:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:38:37,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:37,155 INFO L411 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] [2019-12-18 16:38:37,155 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:37,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:37,155 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-18 16:38:37,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:37,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921418667] [2019-12-18 16:38:37,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:37,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921418667] [2019-12-18 16:38:37,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:37,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:38:37,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900211460] [2019-12-18 16:38:37,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:38:37,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:37,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:38:37,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:38:37,226 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-18 16:38:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:37,931 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-18 16:38:37,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:38:37,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:38:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:38,043 INFO L225 Difference]: With dead ends: 63752 [2019-12-18 16:38:38,044 INFO L226 Difference]: Without dead ends: 63738 [2019-12-18 16:38:38,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:38:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-18 16:38:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-18 16:38:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-18 16:38:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-18 16:38:39,389 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-18 16:38:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:39,390 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-18 16:38:39,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:38:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-18 16:38:39,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:38:39,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:39,402 INFO L411 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] [2019-12-18 16:38:39,402 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:39,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:39,403 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-18 16:38:39,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:39,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310629399] [2019-12-18 16:38:39,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:39,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310629399] [2019-12-18 16:38:39,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:39,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:38:39,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036811304] [2019-12-18 16:38:39,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:38:39,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:39,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:38:39,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:38:39,473 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-18 16:38:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:39,551 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-18 16:38:39,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:38:39,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:38:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:39,576 INFO L225 Difference]: With dead ends: 17193 [2019-12-18 16:38:39,576 INFO L226 Difference]: Without dead ends: 17193 [2019-12-18 16:38:39,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:38:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-18 16:38:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-18 16:38:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-18 16:38:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-18 16:38:39,831 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-18 16:38:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:39,831 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-18 16:38:39,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:38:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-18 16:38:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 16:38:39,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:39,844 INFO L411 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] [2019-12-18 16:38:39,844 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:39,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-18 16:38:39,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:39,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280038008] [2019-12-18 16:38:39,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:39,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280038008] [2019-12-18 16:38:39,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:39,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:38:39,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020486583] [2019-12-18 16:38:39,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:38:39,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:38:39,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:38:39,905 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-18 16:38:40,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:40,237 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-18 16:38:40,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:38:40,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 16:38:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:40,269 INFO L225 Difference]: With dead ends: 21613 [2019-12-18 16:38:40,269 INFO L226 Difference]: Without dead ends: 21613 [2019-12-18 16:38:40,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:38:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-18 16:38:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-18 16:38:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-18 16:38:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-18 16:38:40,577 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-18 16:38:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:40,577 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-18 16:38:40,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:38:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-18 16:38:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:38:40,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:40,592 INFO L411 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] [2019-12-18 16:38:40,592 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:40,593 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-18 16:38:40,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:40,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840620711] [2019-12-18 16:38:40,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:40,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840620711] [2019-12-18 16:38:40,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:40,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:38:40,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060066598] [2019-12-18 16:38:40,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:38:40,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:40,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:38:40,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:38:40,660 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-18 16:38:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:41,062 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-18 16:38:41,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:38:41,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:38:41,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:41,109 INFO L225 Difference]: With dead ends: 23624 [2019-12-18 16:38:41,110 INFO L226 Difference]: Without dead ends: 23624 [2019-12-18 16:38:41,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:38:41,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-18 16:38:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-18 16:38:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-18 16:38:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-18 16:38:41,442 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-18 16:38:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:41,442 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-18 16:38:41,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:38:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-18 16:38:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 16:38:41,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:41,462 INFO L411 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] [2019-12-18 16:38:41,462 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-18 16:38:41,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:41,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107000237] [2019-12-18 16:38:41,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:41,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107000237] [2019-12-18 16:38:41,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:41,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:38:41,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679172436] [2019-12-18 16:38:41,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:38:41,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:41,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:38:41,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:38:41,548 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-18 16:38:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:42,529 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-18 16:38:42,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:38:42,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 16:38:42,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:42,567 INFO L225 Difference]: With dead ends: 27031 [2019-12-18 16:38:42,567 INFO L226 Difference]: Without dead ends: 27031 [2019-12-18 16:38:42,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:38:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-18 16:38:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-18 16:38:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-18 16:38:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-18 16:38:42,901 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-18 16:38:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:42,901 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-18 16:38:42,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:38:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-18 16:38:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:38:42,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:42,924 INFO L411 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] [2019-12-18 16:38:42,924 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-18 16:38:42,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:42,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075366132] [2019-12-18 16:38:42,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:43,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075366132] [2019-12-18 16:38:43,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:43,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:38:43,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239752680] [2019-12-18 16:38:43,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:38:43,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:43,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:38:43,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:38:43,016 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-18 16:38:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:43,803 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-18 16:38:43,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:38:43,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 16:38:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:43,845 INFO L225 Difference]: With dead ends: 26334 [2019-12-18 16:38:43,845 INFO L226 Difference]: Without dead ends: 26334 [2019-12-18 16:38:43,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:38:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-18 16:38:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-18 16:38:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-18 16:38:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-18 16:38:44,166 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-18 16:38:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:44,166 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-18 16:38:44,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:38:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-18 16:38:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:38:44,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:44,183 INFO L411 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] [2019-12-18 16:38:44,183 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:44,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-18 16:38:44,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:44,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860045233] [2019-12-18 16:38:44,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:44,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860045233] [2019-12-18 16:38:44,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:44,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:38:44,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096816982] [2019-12-18 16:38:44,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:38:44,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:44,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:38:44,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:38:44,244 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-18 16:38:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:44,313 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-18 16:38:44,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:38:44,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:38:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:44,342 INFO L225 Difference]: With dead ends: 17641 [2019-12-18 16:38:44,342 INFO L226 Difference]: Without dead ends: 17641 [2019-12-18 16:38:44,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:38:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-18 16:38:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-18 16:38:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-18 16:38:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-18 16:38:44,601 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-18 16:38:44,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:44,601 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-18 16:38:44,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:38:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-18 16:38:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:38:44,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:44,620 INFO L411 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] [2019-12-18 16:38:44,620 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:44,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:44,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-18 16:38:44,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:44,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077553144] [2019-12-18 16:38:44,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:44,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077553144] [2019-12-18 16:38:44,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:44,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:38:44,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425126432] [2019-12-18 16:38:44,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:38:44,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:44,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:38:44,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:38:44,741 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-18 16:38:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:45,364 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-18 16:38:45,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:38:45,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:38:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:45,415 INFO L225 Difference]: With dead ends: 25346 [2019-12-18 16:38:45,415 INFO L226 Difference]: Without dead ends: 25346 [2019-12-18 16:38:45,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:38:45,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-18 16:38:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-18 16:38:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-18 16:38:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-18 16:38:45,786 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-18 16:38:45,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:45,786 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-18 16:38:45,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:38:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-18 16:38:45,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:38:45,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:45,818 INFO L411 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] [2019-12-18 16:38:45,818 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:45,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:45,818 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-18 16:38:45,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:45,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603516134] [2019-12-18 16:38:45,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:45,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603516134] [2019-12-18 16:38:45,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:45,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:38:45,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119768857] [2019-12-18 16:38:45,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:38:45,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:45,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:38:45,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:38:45,885 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-18 16:38:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:46,228 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-18 16:38:46,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:38:46,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:38:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:46,263 INFO L225 Difference]: With dead ends: 22175 [2019-12-18 16:38:46,263 INFO L226 Difference]: Without dead ends: 22175 [2019-12-18 16:38:46,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:38:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-18 16:38:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-18 16:38:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-18 16:38:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-18 16:38:46,592 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-18 16:38:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:46,593 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-18 16:38:46,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:38:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-18 16:38:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:38:46,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:46,624 INFO L411 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] [2019-12-18 16:38:46,624 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:46,625 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-18 16:38:46,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:46,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938128449] [2019-12-18 16:38:46,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:46,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938128449] [2019-12-18 16:38:46,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:46,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:38:46,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962488363] [2019-12-18 16:38:46,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:38:46,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:46,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:38:46,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:38:46,718 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-18 16:38:47,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:47,242 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-18 16:38:47,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 16:38:47,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:38:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:47,314 INFO L225 Difference]: With dead ends: 62478 [2019-12-18 16:38:47,315 INFO L226 Difference]: Without dead ends: 47634 [2019-12-18 16:38:47,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:38:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-18 16:38:47,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-18 16:38:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-18 16:38:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-18 16:38:47,891 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-18 16:38:47,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:47,892 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-18 16:38:47,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:38:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-18 16:38:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:38:47,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:47,922 INFO L411 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] [2019-12-18 16:38:47,922 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:47,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:47,922 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-18 16:38:47,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:47,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068403975] [2019-12-18 16:38:47,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:48,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068403975] [2019-12-18 16:38:48,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:48,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:38:48,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552098455] [2019-12-18 16:38:48,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:38:48,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:48,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:38:48,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:38:48,016 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-18 16:38:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:48,547 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-18 16:38:48,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:38:48,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:38:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:48,621 INFO L225 Difference]: With dead ends: 68433 [2019-12-18 16:38:48,621 INFO L226 Difference]: Without dead ends: 48478 [2019-12-18 16:38:48,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:38:48,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-18 16:38:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-18 16:38:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-18 16:38:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-18 16:38:49,681 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-18 16:38:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:49,681 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-18 16:38:49,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:38:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-18 16:38:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:38:49,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:49,715 INFO L411 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] [2019-12-18 16:38:49,716 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:49,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-18 16:38:49,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:49,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115387027] [2019-12-18 16:38:49,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:49,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115387027] [2019-12-18 16:38:49,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:49,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:38:49,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939829991] [2019-12-18 16:38:49,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:38:49,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:49,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:38:49,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:38:49,812 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-18 16:38:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:50,484 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-18 16:38:50,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:38:50,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 16:38:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:50,602 INFO L225 Difference]: With dead ends: 59843 [2019-12-18 16:38:50,602 INFO L226 Difference]: Without dead ends: 52762 [2019-12-18 16:38:50,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:38:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-18 16:38:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-18 16:38:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-18 16:38:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-18 16:38:51,530 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-18 16:38:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:51,530 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-18 16:38:51,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:38:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-18 16:38:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 16:38:51,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:51,559 INFO L411 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] [2019-12-18 16:38:51,560 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:51,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-18 16:38:51,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:51,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778301002] [2019-12-18 16:38:51,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:51,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778301002] [2019-12-18 16:38:51,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:51,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:38:51,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801358273] [2019-12-18 16:38:51,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:38:51,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:51,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:38:51,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:38:51,617 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 3 states. [2019-12-18 16:38:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:51,766 INFO L93 Difference]: Finished difference Result 35624 states and 109784 transitions. [2019-12-18 16:38:51,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:38:51,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-18 16:38:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:51,817 INFO L225 Difference]: With dead ends: 35624 [2019-12-18 16:38:51,817 INFO L226 Difference]: Without dead ends: 35624 [2019-12-18 16:38:51,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:38:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35624 states. [2019-12-18 16:38:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35624 to 31022. [2019-12-18 16:38:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2019-12-18 16:38:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 96384 transitions. [2019-12-18 16:38:52,340 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 96384 transitions. Word has length 63 [2019-12-18 16:38:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:52,340 INFO L462 AbstractCegarLoop]: Abstraction has 31022 states and 96384 transitions. [2019-12-18 16:38:52,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:38:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 96384 transitions. [2019-12-18 16:38:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:38:52,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:52,378 INFO L411 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] [2019-12-18 16:38:52,378 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1820548391, now seen corresponding path program 1 times [2019-12-18 16:38:52,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:52,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387733226] [2019-12-18 16:38:52,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:52,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387733226] [2019-12-18 16:38:52,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:52,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 16:38:52,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101197735] [2019-12-18 16:38:52,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:38:52,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:52,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:38:52,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:38:52,658 INFO L87 Difference]: Start difference. First operand 31022 states and 96384 transitions. Second operand 12 states. [2019-12-18 16:38:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:57,268 INFO L93 Difference]: Finished difference Result 59312 states and 180291 transitions. [2019-12-18 16:38:57,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 16:38:57,268 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-18 16:38:57,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:57,357 INFO L225 Difference]: With dead ends: 59312 [2019-12-18 16:38:57,357 INFO L226 Difference]: Without dead ends: 58925 [2019-12-18 16:38:57,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1579, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 16:38:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58925 states. [2019-12-18 16:38:58,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58925 to 36682. [2019-12-18 16:38:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36682 states. [2019-12-18 16:38:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36682 states to 36682 states and 113249 transitions. [2019-12-18 16:38:58,129 INFO L78 Accepts]: Start accepts. Automaton has 36682 states and 113249 transitions. Word has length 64 [2019-12-18 16:38:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:58,129 INFO L462 AbstractCegarLoop]: Abstraction has 36682 states and 113249 transitions. [2019-12-18 16:38:58,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:38:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 36682 states and 113249 transitions. [2019-12-18 16:38:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:38:58,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:58,174 INFO L411 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] [2019-12-18 16:38:58,174 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:58,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash -772692697, now seen corresponding path program 2 times [2019-12-18 16:38:58,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:58,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160795686] [2019-12-18 16:38:58,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:58,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160795686] [2019-12-18 16:38:58,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:58,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:38:58,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643940018] [2019-12-18 16:38:58,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:38:58,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:58,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:38:58,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:38:58,247 INFO L87 Difference]: Start difference. First operand 36682 states and 113249 transitions. Second operand 3 states. [2019-12-18 16:38:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:58,413 INFO L93 Difference]: Finished difference Result 36681 states and 113247 transitions. [2019-12-18 16:38:58,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:38:58,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:38:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:58,498 INFO L225 Difference]: With dead ends: 36681 [2019-12-18 16:38:58,498 INFO L226 Difference]: Without dead ends: 36681 [2019-12-18 16:38:58,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:38:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36681 states. [2019-12-18 16:38:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36681 to 30341. [2019-12-18 16:38:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30341 states. [2019-12-18 16:38:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30341 states to 30341 states and 95154 transitions. [2019-12-18 16:38:59,278 INFO L78 Accepts]: Start accepts. Automaton has 30341 states and 95154 transitions. Word has length 64 [2019-12-18 16:38:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:38:59,278 INFO L462 AbstractCegarLoop]: Abstraction has 30341 states and 95154 transitions. [2019-12-18 16:38:59,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:38:59,278 INFO L276 IsEmpty]: Start isEmpty. Operand 30341 states and 95154 transitions. [2019-12-18 16:38:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:38:59,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:38:59,312 INFO L411 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] [2019-12-18 16:38:59,312 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:38:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:38:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash 78921339, now seen corresponding path program 1 times [2019-12-18 16:38:59,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:38:59,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605445861] [2019-12-18 16:38:59,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:38:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:38:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:38:59,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605445861] [2019-12-18 16:38:59,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:38:59,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:38:59,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131482904] [2019-12-18 16:38:59,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:38:59,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:38:59,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:38:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:38:59,396 INFO L87 Difference]: Start difference. First operand 30341 states and 95154 transitions. Second operand 3 states. [2019-12-18 16:38:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:38:59,515 INFO L93 Difference]: Finished difference Result 26678 states and 82577 transitions. [2019-12-18 16:38:59,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:38:59,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 16:38:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:38:59,570 INFO L225 Difference]: With dead ends: 26678 [2019-12-18 16:38:59,570 INFO L226 Difference]: Without dead ends: 26678 [2019-12-18 16:38:59,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:38:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26678 states. [2019-12-18 16:39:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26678 to 24612. [2019-12-18 16:39:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24612 states. [2019-12-18 16:39:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24612 states to 24612 states and 76133 transitions. [2019-12-18 16:39:00,240 INFO L78 Accepts]: Start accepts. Automaton has 24612 states and 76133 transitions. Word has length 65 [2019-12-18 16:39:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:00,240 INFO L462 AbstractCegarLoop]: Abstraction has 24612 states and 76133 transitions. [2019-12-18 16:39:00,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:39:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 24612 states and 76133 transitions. [2019-12-18 16:39:00,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:00,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:00,273 INFO L411 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] [2019-12-18 16:39:00,273 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:00,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-18 16:39:00,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:00,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531317858] [2019-12-18 16:39:00,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:00,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531317858] [2019-12-18 16:39:00,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:00,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 16:39:00,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013521324] [2019-12-18 16:39:00,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 16:39:00,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:00,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 16:39:00,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:39:00,916 INFO L87 Difference]: Start difference. First operand 24612 states and 76133 transitions. Second operand 17 states. [2019-12-18 16:39:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:39:03,842 INFO L93 Difference]: Finished difference Result 32271 states and 98388 transitions. [2019-12-18 16:39:03,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 16:39:03,843 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 16:39:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:39:03,887 INFO L225 Difference]: With dead ends: 32271 [2019-12-18 16:39:03,887 INFO L226 Difference]: Without dead ends: 28954 [2019-12-18 16:39:03,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 16:39:03,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28954 states. [2019-12-18 16:39:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28954 to 25271. [2019-12-18 16:39:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25271 states. [2019-12-18 16:39:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25271 states to 25271 states and 77938 transitions. [2019-12-18 16:39:04,292 INFO L78 Accepts]: Start accepts. Automaton has 25271 states and 77938 transitions. Word has length 66 [2019-12-18 16:39:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:04,292 INFO L462 AbstractCegarLoop]: Abstraction has 25271 states and 77938 transitions. [2019-12-18 16:39:04,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 16:39:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 25271 states and 77938 transitions. [2019-12-18 16:39:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:04,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:04,322 INFO L411 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] [2019-12-18 16:39:04,322 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:04,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1620692773, now seen corresponding path program 2 times [2019-12-18 16:39:04,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:04,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338532787] [2019-12-18 16:39:04,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:04,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338532787] [2019-12-18 16:39:04,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:04,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 16:39:04,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832017938] [2019-12-18 16:39:04,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 16:39:04,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:04,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 16:39:04,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:39:04,971 INFO L87 Difference]: Start difference. First operand 25271 states and 77938 transitions. Second operand 17 states. [2019-12-18 16:39:09,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:39:09,379 INFO L93 Difference]: Finished difference Result 36075 states and 110083 transitions. [2019-12-18 16:39:09,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 16:39:09,380 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 16:39:09,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:39:09,423 INFO L225 Difference]: With dead ends: 36075 [2019-12-18 16:39:09,423 INFO L226 Difference]: Without dead ends: 30018 [2019-12-18 16:39:09,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=416, Invalid=1840, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 16:39:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30018 states. [2019-12-18 16:39:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30018 to 25659. [2019-12-18 16:39:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25659 states. [2019-12-18 16:39:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25659 states to 25659 states and 79004 transitions. [2019-12-18 16:39:09,826 INFO L78 Accepts]: Start accepts. Automaton has 25659 states and 79004 transitions. Word has length 66 [2019-12-18 16:39:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:09,826 INFO L462 AbstractCegarLoop]: Abstraction has 25659 states and 79004 transitions. [2019-12-18 16:39:09,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 16:39:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 25659 states and 79004 transitions. [2019-12-18 16:39:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:09,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:09,854 INFO L411 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] [2019-12-18 16:39:09,854 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:09,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1631675313, now seen corresponding path program 3 times [2019-12-18 16:39:09,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:09,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073951432] [2019-12-18 16:39:09,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:10,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073951432] [2019-12-18 16:39:10,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:10,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 16:39:10,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561205533] [2019-12-18 16:39:10,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 16:39:10,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:10,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 16:39:10,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:39:10,440 INFO L87 Difference]: Start difference. First operand 25659 states and 79004 transitions. Second operand 17 states. [2019-12-18 16:39:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:39:14,730 INFO L93 Difference]: Finished difference Result 35561 states and 107700 transitions. [2019-12-18 16:39:14,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-18 16:39:14,731 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 16:39:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:39:14,774 INFO L225 Difference]: With dead ends: 35561 [2019-12-18 16:39:14,775 INFO L226 Difference]: Without dead ends: 30992 [2019-12-18 16:39:14,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=420, Invalid=1932, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 16:39:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30992 states. [2019-12-18 16:39:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30992 to 25732. [2019-12-18 16:39:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25732 states. [2019-12-18 16:39:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25732 states to 25732 states and 79054 transitions. [2019-12-18 16:39:15,201 INFO L78 Accepts]: Start accepts. Automaton has 25732 states and 79054 transitions. Word has length 66 [2019-12-18 16:39:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:15,201 INFO L462 AbstractCegarLoop]: Abstraction has 25732 states and 79054 transitions. [2019-12-18 16:39:15,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 16:39:15,202 INFO L276 IsEmpty]: Start isEmpty. Operand 25732 states and 79054 transitions. [2019-12-18 16:39:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:15,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:15,230 INFO L411 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] [2019-12-18 16:39:15,230 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:15,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:15,231 INFO L82 PathProgramCache]: Analyzing trace with hash -607910859, now seen corresponding path program 4 times [2019-12-18 16:39:15,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:15,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820597331] [2019-12-18 16:39:15,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:16,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820597331] [2019-12-18 16:39:16,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:16,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 16:39:16,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796905661] [2019-12-18 16:39:16,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 16:39:16,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:16,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 16:39:16,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:39:16,074 INFO L87 Difference]: Start difference. First operand 25732 states and 79054 transitions. Second operand 17 states. [2019-12-18 16:39:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:39:21,093 INFO L93 Difference]: Finished difference Result 45257 states and 137324 transitions. [2019-12-18 16:39:21,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 16:39:21,094 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 16:39:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:39:21,152 INFO L225 Difference]: With dead ends: 45257 [2019-12-18 16:39:21,152 INFO L226 Difference]: Without dead ends: 36613 [2019-12-18 16:39:21,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=537, Invalid=2885, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 16:39:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36613 states. [2019-12-18 16:39:21,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36613 to 25870. [2019-12-18 16:39:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25870 states. [2019-12-18 16:39:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25870 states to 25870 states and 79326 transitions. [2019-12-18 16:39:21,666 INFO L78 Accepts]: Start accepts. Automaton has 25870 states and 79326 transitions. Word has length 66 [2019-12-18 16:39:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:21,666 INFO L462 AbstractCegarLoop]: Abstraction has 25870 states and 79326 transitions. [2019-12-18 16:39:21,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 16:39:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 25870 states and 79326 transitions. [2019-12-18 16:39:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:21,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:21,698 INFO L411 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] [2019-12-18 16:39:21,699 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:21,699 INFO L82 PathProgramCache]: Analyzing trace with hash 539047833, now seen corresponding path program 5 times [2019-12-18 16:39:21,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:21,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901226420] [2019-12-18 16:39:21,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:22,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901226420] [2019-12-18 16:39:22,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:22,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 16:39:22,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141424690] [2019-12-18 16:39:22,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 16:39:22,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:22,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 16:39:22,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:39:22,046 INFO L87 Difference]: Start difference. First operand 25870 states and 79326 transitions. Second operand 15 states. [2019-12-18 16:39:26,047 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-12-18 16:39:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:39:27,948 INFO L93 Difference]: Finished difference Result 57871 states and 175981 transitions. [2019-12-18 16:39:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-18 16:39:27,948 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-18 16:39:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:39:28,022 INFO L225 Difference]: With dead ends: 57871 [2019-12-18 16:39:28,023 INFO L226 Difference]: Without dead ends: 54876 [2019-12-18 16:39:28,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=609, Invalid=3551, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 16:39:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54876 states. [2019-12-18 16:39:28,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54876 to 28807. [2019-12-18 16:39:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28807 states. [2019-12-18 16:39:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28807 states to 28807 states and 88087 transitions. [2019-12-18 16:39:28,622 INFO L78 Accepts]: Start accepts. Automaton has 28807 states and 88087 transitions. Word has length 66 [2019-12-18 16:39:28,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:28,622 INFO L462 AbstractCegarLoop]: Abstraction has 28807 states and 88087 transitions. [2019-12-18 16:39:28,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 16:39:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 28807 states and 88087 transitions. [2019-12-18 16:39:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:28,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:28,658 INFO L411 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] [2019-12-18 16:39:28,659 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:28,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:28,659 INFO L82 PathProgramCache]: Analyzing trace with hash 824750475, now seen corresponding path program 6 times [2019-12-18 16:39:28,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:28,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803580068] [2019-12-18 16:39:28,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:29,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803580068] [2019-12-18 16:39:29,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:29,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 16:39:29,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502532907] [2019-12-18 16:39:29,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 16:39:29,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:29,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 16:39:29,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:39:29,245 INFO L87 Difference]: Start difference. First operand 28807 states and 88087 transitions. Second operand 18 states. [2019-12-18 16:39:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:39:33,406 INFO L93 Difference]: Finished difference Result 38044 states and 114249 transitions. [2019-12-18 16:39:33,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-18 16:39:33,406 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-18 16:39:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:39:33,459 INFO L225 Difference]: With dead ends: 38044 [2019-12-18 16:39:33,459 INFO L226 Difference]: Without dead ends: 33033 [2019-12-18 16:39:33,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=504, Invalid=2688, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 16:39:33,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33033 states. [2019-12-18 16:39:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33033 to 28072. [2019-12-18 16:39:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28072 states. [2019-12-18 16:39:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28072 states to 28072 states and 85928 transitions. [2019-12-18 16:39:34,286 INFO L78 Accepts]: Start accepts. Automaton has 28072 states and 85928 transitions. Word has length 66 [2019-12-18 16:39:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:34,286 INFO L462 AbstractCegarLoop]: Abstraction has 28072 states and 85928 transitions. [2019-12-18 16:39:34,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 16:39:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 28072 states and 85928 transitions. [2019-12-18 16:39:34,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:34,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:34,314 INFO L411 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] [2019-12-18 16:39:34,314 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:34,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:34,315 INFO L82 PathProgramCache]: Analyzing trace with hash 38318619, now seen corresponding path program 7 times [2019-12-18 16:39:34,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:34,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237492901] [2019-12-18 16:39:34,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:34,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237492901] [2019-12-18 16:39:34,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:34,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 16:39:34,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073740373] [2019-12-18 16:39:34,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 16:39:34,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:34,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 16:39:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:39:34,790 INFO L87 Difference]: Start difference. First operand 28072 states and 85928 transitions. Second operand 17 states. [2019-12-18 16:39:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:39:39,279 INFO L93 Difference]: Finished difference Result 39882 states and 120178 transitions. [2019-12-18 16:39:39,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 16:39:39,279 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 16:39:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:39:39,339 INFO L225 Difference]: With dead ends: 39882 [2019-12-18 16:39:39,339 INFO L226 Difference]: Without dead ends: 36523 [2019-12-18 16:39:39,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=357, Invalid=1623, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 16:39:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36523 states. [2019-12-18 16:39:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36523 to 28252. [2019-12-18 16:39:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28252 states. [2019-12-18 16:39:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28252 states to 28252 states and 86436 transitions. [2019-12-18 16:39:39,856 INFO L78 Accepts]: Start accepts. Automaton has 28252 states and 86436 transitions. Word has length 66 [2019-12-18 16:39:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:39,856 INFO L462 AbstractCegarLoop]: Abstraction has 28252 states and 86436 transitions. [2019-12-18 16:39:39,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 16:39:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28252 states and 86436 transitions. [2019-12-18 16:39:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:39,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:39,889 INFO L411 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] [2019-12-18 16:39:39,889 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash -123257535, now seen corresponding path program 8 times [2019-12-18 16:39:39,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:39,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963464918] [2019-12-18 16:39:39,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:40,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963464918] [2019-12-18 16:39:40,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:40,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 16:39:40,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831810428] [2019-12-18 16:39:40,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 16:39:40,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 16:39:40,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:39:40,457 INFO L87 Difference]: Start difference. First operand 28252 states and 86436 transitions. Second operand 18 states. [2019-12-18 16:39:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:39:43,124 INFO L93 Difference]: Finished difference Result 37806 states and 114303 transitions. [2019-12-18 16:39:43,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 16:39:43,124 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-18 16:39:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:39:43,178 INFO L225 Difference]: With dead ends: 37806 [2019-12-18 16:39:43,178 INFO L226 Difference]: Without dead ends: 34914 [2019-12-18 16:39:43,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 16:39:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34914 states. [2019-12-18 16:39:43,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34914 to 31564. [2019-12-18 16:39:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31564 states. [2019-12-18 16:39:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31564 states to 31564 states and 95955 transitions. [2019-12-18 16:39:43,966 INFO L78 Accepts]: Start accepts. Automaton has 31564 states and 95955 transitions. Word has length 66 [2019-12-18 16:39:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:43,966 INFO L462 AbstractCegarLoop]: Abstraction has 31564 states and 95955 transitions. [2019-12-18 16:39:43,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 16:39:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 31564 states and 95955 transitions. [2019-12-18 16:39:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:43,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:43,999 INFO L411 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] [2019-12-18 16:39:43,999 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:44,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:44,000 INFO L82 PathProgramCache]: Analyzing trace with hash 162445107, now seen corresponding path program 9 times [2019-12-18 16:39:44,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:44,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173254952] [2019-12-18 16:39:44,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:44,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173254952] [2019-12-18 16:39:44,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:44,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 16:39:44,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410389510] [2019-12-18 16:39:44,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 16:39:44,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:44,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 16:39:44,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:39:44,500 INFO L87 Difference]: Start difference. First operand 31564 states and 95955 transitions. Second operand 18 states. [2019-12-18 16:39:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:39:47,085 INFO L93 Difference]: Finished difference Result 34835 states and 104968 transitions. [2019-12-18 16:39:47,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 16:39:47,085 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-18 16:39:47,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:39:47,135 INFO L225 Difference]: With dead ends: 34835 [2019-12-18 16:39:47,135 INFO L226 Difference]: Without dead ends: 34584 [2019-12-18 16:39:47,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 16:39:47,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34584 states. [2019-12-18 16:39:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34584 to 31564. [2019-12-18 16:39:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31564 states. [2019-12-18 16:39:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31564 states to 31564 states and 95775 transitions. [2019-12-18 16:39:47,636 INFO L78 Accepts]: Start accepts. Automaton has 31564 states and 95775 transitions. Word has length 66 [2019-12-18 16:39:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:47,636 INFO L462 AbstractCegarLoop]: Abstraction has 31564 states and 95775 transitions. [2019-12-18 16:39:47,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 16:39:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 31564 states and 95775 transitions. [2019-12-18 16:39:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:47,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:47,672 INFO L411 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] [2019-12-18 16:39:47,672 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:47,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:47,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1267354111, now seen corresponding path program 10 times [2019-12-18 16:39:47,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:47,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351778227] [2019-12-18 16:39:47,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:48,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351778227] [2019-12-18 16:39:48,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:48,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 16:39:48,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740147532] [2019-12-18 16:39:48,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 16:39:48,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:48,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 16:39:48,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:39:48,204 INFO L87 Difference]: Start difference. First operand 31564 states and 95775 transitions. Second operand 18 states. [2019-12-18 16:39:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:39:51,314 INFO L93 Difference]: Finished difference Result 35448 states and 106169 transitions. [2019-12-18 16:39:51,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 16:39:51,314 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-18 16:39:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:39:51,365 INFO L225 Difference]: With dead ends: 35448 [2019-12-18 16:39:51,365 INFO L226 Difference]: Without dead ends: 31490 [2019-12-18 16:39:51,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 16:39:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31490 states. [2019-12-18 16:39:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31490 to 29694. [2019-12-18 16:39:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29694 states. [2019-12-18 16:39:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29694 states to 29694 states and 90265 transitions. [2019-12-18 16:39:52,127 INFO L78 Accepts]: Start accepts. Automaton has 29694 states and 90265 transitions. Word has length 66 [2019-12-18 16:39:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:52,127 INFO L462 AbstractCegarLoop]: Abstraction has 29694 states and 90265 transitions. [2019-12-18 16:39:52,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 16:39:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 29694 states and 90265 transitions. [2019-12-18 16:39:52,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:52,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:52,158 INFO L411 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] [2019-12-18 16:39:52,158 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:52,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:52,159 INFO L82 PathProgramCache]: Analyzing trace with hash -344563597, now seen corresponding path program 11 times [2019-12-18 16:39:52,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:52,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876632057] [2019-12-18 16:39:52,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:52,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876632057] [2019-12-18 16:39:52,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:52,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 16:39:52,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102866502] [2019-12-18 16:39:52,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 16:39:52,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:52,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 16:39:52,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:39:52,710 INFO L87 Difference]: Start difference. First operand 29694 states and 90265 transitions. Second operand 18 states. [2019-12-18 16:39:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:39:56,430 INFO L93 Difference]: Finished difference Result 40920 states and 123183 transitions. [2019-12-18 16:39:56,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 16:39:56,431 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-18 16:39:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:39:56,485 INFO L225 Difference]: With dead ends: 40920 [2019-12-18 16:39:56,485 INFO L226 Difference]: Without dead ends: 35995 [2019-12-18 16:39:56,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 16:39:56,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35995 states. [2019-12-18 16:39:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35995 to 30055. [2019-12-18 16:39:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30055 states. [2019-12-18 16:39:56,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30055 states to 30055 states and 91265 transitions. [2019-12-18 16:39:56,984 INFO L78 Accepts]: Start accepts. Automaton has 30055 states and 91265 transitions. Word has length 66 [2019-12-18 16:39:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:56,985 INFO L462 AbstractCegarLoop]: Abstraction has 30055 states and 91265 transitions. [2019-12-18 16:39:56,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 16:39:56,985 INFO L276 IsEmpty]: Start isEmpty. Operand 30055 states and 91265 transitions. [2019-12-18 16:39:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:57,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:57,022 INFO L411 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] [2019-12-18 16:39:57,023 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:57,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:57,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1449607749, now seen corresponding path program 12 times [2019-12-18 16:39:57,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:57,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753328779] [2019-12-18 16:39:57,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:57,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753328779] [2019-12-18 16:39:57,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:57,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:39:57,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572922813] [2019-12-18 16:39:57,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:39:57,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:57,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:39:57,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:39:57,217 INFO L87 Difference]: Start difference. First operand 30055 states and 91265 transitions. Second operand 10 states. [2019-12-18 16:39:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:39:58,422 INFO L93 Difference]: Finished difference Result 40934 states and 123741 transitions. [2019-12-18 16:39:58,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 16:39:58,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 16:39:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:39:58,478 INFO L225 Difference]: With dead ends: 40934 [2019-12-18 16:39:58,478 INFO L226 Difference]: Without dead ends: 34219 [2019-12-18 16:39:58,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:39:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34219 states. [2019-12-18 16:39:58,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34219 to 29931. [2019-12-18 16:39:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29931 states. [2019-12-18 16:39:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29931 states to 29931 states and 90784 transitions. [2019-12-18 16:39:59,365 INFO L78 Accepts]: Start accepts. Automaton has 29931 states and 90784 transitions. Word has length 66 [2019-12-18 16:39:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:39:59,366 INFO L462 AbstractCegarLoop]: Abstraction has 29931 states and 90784 transitions. [2019-12-18 16:39:59,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:39:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 29931 states and 90784 transitions. [2019-12-18 16:39:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:39:59,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:39:59,396 INFO L411 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] [2019-12-18 16:39:59,396 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:39:59,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:39:59,396 INFO L82 PathProgramCache]: Analyzing trace with hash -572972041, now seen corresponding path program 13 times [2019-12-18 16:39:59,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:39:59,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28143274] [2019-12-18 16:39:59,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:39:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:39:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:39:59,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28143274] [2019-12-18 16:39:59,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:39:59,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:39:59,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635835606] [2019-12-18 16:39:59,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:39:59,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:39:59,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:39:59,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:39:59,580 INFO L87 Difference]: Start difference. First operand 29931 states and 90784 transitions. Second operand 11 states. [2019-12-18 16:40:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:40:00,908 INFO L93 Difference]: Finished difference Result 39944 states and 119983 transitions. [2019-12-18 16:40:00,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:40:00,909 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 16:40:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:40:00,959 INFO L225 Difference]: With dead ends: 39944 [2019-12-18 16:40:00,959 INFO L226 Difference]: Without dead ends: 35355 [2019-12-18 16:40:00,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:40:01,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35355 states. [2019-12-18 16:40:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35355 to 29740. [2019-12-18 16:40:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29740 states. [2019-12-18 16:40:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29740 states to 29740 states and 90187 transitions. [2019-12-18 16:40:01,443 INFO L78 Accepts]: Start accepts. Automaton has 29740 states and 90187 transitions. Word has length 66 [2019-12-18 16:40:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:40:01,443 INFO L462 AbstractCegarLoop]: Abstraction has 29740 states and 90187 transitions. [2019-12-18 16:40:01,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:40:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 29740 states and 90187 transitions. [2019-12-18 16:40:01,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:40:01,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:40:01,481 INFO L411 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] [2019-12-18 16:40:01,481 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:40:01,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:40:01,482 INFO L82 PathProgramCache]: Analyzing trace with hash 896424241, now seen corresponding path program 14 times [2019-12-18 16:40:01,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:40:01,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555903799] [2019-12-18 16:40:01,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:40:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:40:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:40:01,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555903799] [2019-12-18 16:40:01,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:40:01,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:40:01,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473981162] [2019-12-18 16:40:01,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:40:01,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:40:01,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:40:01,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:40:01,637 INFO L87 Difference]: Start difference. First operand 29740 states and 90187 transitions. Second operand 11 states. [2019-12-18 16:40:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:40:02,886 INFO L93 Difference]: Finished difference Result 37361 states and 112433 transitions. [2019-12-18 16:40:02,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 16:40:02,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 16:40:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:40:02,931 INFO L225 Difference]: With dead ends: 37361 [2019-12-18 16:40:02,931 INFO L226 Difference]: Without dead ends: 32532 [2019-12-18 16:40:02,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:40:03,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32532 states. [2019-12-18 16:40:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32532 to 28912. [2019-12-18 16:40:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28912 states. [2019-12-18 16:40:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28912 states to 28912 states and 87806 transitions. [2019-12-18 16:40:03,356 INFO L78 Accepts]: Start accepts. Automaton has 28912 states and 87806 transitions. Word has length 66 [2019-12-18 16:40:03,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:40:03,356 INFO L462 AbstractCegarLoop]: Abstraction has 28912 states and 87806 transitions. [2019-12-18 16:40:03,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:40:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 28912 states and 87806 transitions. [2019-12-18 16:40:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:40:03,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:40:03,385 INFO L411 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] [2019-12-18 16:40:03,385 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:40:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:40:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1127189131, now seen corresponding path program 15 times [2019-12-18 16:40:03,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:40:03,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657387901] [2019-12-18 16:40:03,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:40:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:40:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:40:03,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657387901] [2019-12-18 16:40:03,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:40:03,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:40:03,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865808054] [2019-12-18 16:40:03,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:40:03,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:40:03,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:40:03,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:40:03,522 INFO L87 Difference]: Start difference. First operand 28912 states and 87806 transitions. Second operand 11 states. [2019-12-18 16:40:04,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:40:04,760 INFO L93 Difference]: Finished difference Result 35266 states and 106084 transitions. [2019-12-18 16:40:04,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:40:04,760 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 16:40:04,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:40:04,812 INFO L225 Difference]: With dead ends: 35266 [2019-12-18 16:40:04,812 INFO L226 Difference]: Without dead ends: 33637 [2019-12-18 16:40:04,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:40:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33637 states. [2019-12-18 16:40:05,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33637 to 28776. [2019-12-18 16:40:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28776 states. [2019-12-18 16:40:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28776 states to 28776 states and 87465 transitions. [2019-12-18 16:40:05,736 INFO L78 Accepts]: Start accepts. Automaton has 28776 states and 87465 transitions. Word has length 66 [2019-12-18 16:40:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:40:05,736 INFO L462 AbstractCegarLoop]: Abstraction has 28776 states and 87465 transitions. [2019-12-18 16:40:05,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:40:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 28776 states and 87465 transitions. [2019-12-18 16:40:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:40:05,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:40:05,770 INFO L411 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] [2019-12-18 16:40:05,770 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:40:05,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:40:05,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1838117555, now seen corresponding path program 16 times [2019-12-18 16:40:05,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:40:05,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782182374] [2019-12-18 16:40:05,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:40:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:40:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:40:05,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782182374] [2019-12-18 16:40:05,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:40:05,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:40:05,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505247320] [2019-12-18 16:40:05,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:40:05,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:40:05,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:40:05,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:40:05,922 INFO L87 Difference]: Start difference. First operand 28776 states and 87465 transitions. Second operand 11 states. [2019-12-18 16:40:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:40:07,096 INFO L93 Difference]: Finished difference Result 54117 states and 164969 transitions. [2019-12-18 16:40:07,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 16:40:07,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 16:40:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:40:07,161 INFO L225 Difference]: With dead ends: 54117 [2019-12-18 16:40:07,161 INFO L226 Difference]: Without dead ends: 39656 [2019-12-18 16:40:07,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:40:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39656 states. [2019-12-18 16:40:07,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39656 to 23390. [2019-12-18 16:40:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23390 states. [2019-12-18 16:40:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23390 states to 23390 states and 71734 transitions. [2019-12-18 16:40:07,671 INFO L78 Accepts]: Start accepts. Automaton has 23390 states and 71734 transitions. Word has length 66 [2019-12-18 16:40:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:40:07,671 INFO L462 AbstractCegarLoop]: Abstraction has 23390 states and 71734 transitions. [2019-12-18 16:40:07,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:40:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 23390 states and 71734 transitions. [2019-12-18 16:40:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:40:07,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:40:07,697 INFO L411 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] [2019-12-18 16:40:07,698 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:40:07,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:40:07,698 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 17 times [2019-12-18 16:40:07,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:40:07,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485220069] [2019-12-18 16:40:07,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:40:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:40:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:40:07,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:40:07,810 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:40:07,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff0_thd3~0_377) (= v_~__unbuffered_cnt~0_128 0) (= v_~z$r_buff0_thd1~0_378 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t497~0.base_22|)) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd0~0_195 0) (= v_~y~0_28 0) (= v_~z$w_buff1_used~0_500 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t497~0.base_22| 1) |v_#valid_69|) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd2~0_182 0) (= 0 v_~z$r_buff1_thd3~0_396) (= 0 v_~x~0_245) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_35) (= v_~z$r_buff1_thd0~0_294 0) (= 0 |v_ULTIMATE.start_main_~#t497~0.offset_16|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t497~0.base_22|) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t497~0.base_22| 4)) (= v_~__unbuffered_p2_EBX~0_48 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t497~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t497~0.base_22|) |v_ULTIMATE.start_main_~#t497~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, ULTIMATE.start_main_~#t498~0.offset=|v_ULTIMATE.start_main_~#t498~0.offset_14|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_72|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_195, ULTIMATE.start_main_~#t499~0.base=|v_ULTIMATE.start_main_~#t499~0.base_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_377, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ULTIMATE.start_main_~#t497~0.base=|v_ULTIMATE.start_main_~#t497~0.base_22|, ~x~0=v_~x~0_245, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ULTIMATE.start_main_~#t498~0.base=|v_ULTIMATE.start_main_~#t498~0.base_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_294, ~y~0=v_~y~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_182, ULTIMATE.start_main_~#t497~0.offset=|v_ULTIMATE.start_main_~#t497~0.offset_16|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_378, ULTIMATE.start_main_~#t499~0.offset=|v_ULTIMATE.start_main_~#t499~0.offset_14|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t498~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t499~0.base, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t497~0.base, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ULTIMATE.start_main_~#t498~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t497~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t499~0.offset] because there is no mapped edge [2019-12-18 16:40:07,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~x~0_11 1) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 16:40:07,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t498~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t498~0.base_11|) |v_ULTIMATE.start_main_~#t498~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t498~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t498~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t498~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t498~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t498~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t498~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t498~0.offset=|v_ULTIMATE.start_main_~#t498~0.offset_10|, ULTIMATE.start_main_~#t498~0.base=|v_ULTIMATE.start_main_~#t498~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t498~0.offset, ULTIMATE.start_main_~#t498~0.base, #length] because there is no mapped edge [2019-12-18 16:40:07,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t499~0.base_12| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t499~0.base_12| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t499~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t499~0.offset_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t499~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t499~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t499~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t499~0.base_12|) |v_ULTIMATE.start_main_~#t499~0.offset_10| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t499~0.base=|v_ULTIMATE.start_main_~#t499~0.base_12|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t499~0.offset=|v_ULTIMATE.start_main_~#t499~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t499~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t499~0.offset] because there is no mapped edge [2019-12-18 16:40:07,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In1787161380 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1787161380 256))) (.cse1 (= |P1Thread1of1ForFork2_#t~ite10_Out1787161380| |P1Thread1of1ForFork2_#t~ite9_Out1787161380|))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1787161380| ~z$w_buff1~0_In1787161380) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1787161380| ~z~0_In1787161380) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1787161380, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1787161380, ~z$w_buff1~0=~z$w_buff1~0_In1787161380, ~z~0=~z~0_In1787161380} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1787161380|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1787161380, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1787161380|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1787161380, ~z$w_buff1~0=~z$w_buff1~0_In1787161380, ~z~0=~z~0_In1787161380} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 16:40:07,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1478670153 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out1478670153| |P2Thread1of1ForFork0_#t~ite24_Out1478670153|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1478670153 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In1478670153 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In1478670153 256) 0) (and (= (mod ~z$w_buff1_used~0_In1478670153 256) 0) .cse0))) (= |P2Thread1of1ForFork0_#t~ite23_Out1478670153| ~z$w_buff1~0_In1478670153) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite24_Out1478670153| ~z$w_buff1~0_In1478670153) (= |P2Thread1of1ForFork0_#t~ite23_In1478670153| |P2Thread1of1ForFork0_#t~ite23_Out1478670153|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1478670153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1478670153, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1478670153|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478670153, ~z$w_buff1~0=~z$w_buff1~0_In1478670153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1478670153, ~weak$$choice2~0=~weak$$choice2~0_In1478670153} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1478670153, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1478670153|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1478670153, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1478670153|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478670153, ~z$w_buff1~0=~z$w_buff1~0_In1478670153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1478670153, ~weak$$choice2~0=~weak$$choice2~0_In1478670153} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 16:40:07,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse3 (= (mod ~weak$$choice2~0_In190831575 256) 0)) (.cse4 (= |P2Thread1of1ForFork0_#t~ite29_Out190831575| |P2Thread1of1ForFork0_#t~ite30_Out190831575|)) (.cse5 (= (mod ~z$r_buff1_thd3~0_In190831575 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In190831575 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In190831575 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In190831575 256) 0))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (not .cse2) .cse3 .cse4 (or (not .cse5) .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out190831575|) (= |P2Thread1of1ForFork0_#t~ite29_Out190831575| |P2Thread1of1ForFork0_#t~ite28_Out190831575|))) (and (or (and (= ~z$w_buff1_used~0_In190831575 |P2Thread1of1ForFork0_#t~ite30_Out190831575|) (= |P2Thread1of1ForFork0_#t~ite29_Out190831575| |P2Thread1of1ForFork0_#t~ite29_In190831575|) (not .cse3)) (and .cse3 .cse4 (or (and .cse5 .cse6) (and .cse6 .cse0) .cse2) (= ~z$w_buff1_used~0_In190831575 |P2Thread1of1ForFork0_#t~ite29_Out190831575|))) (= |P2Thread1of1ForFork0_#t~ite28_In190831575| |P2Thread1of1ForFork0_#t~ite28_Out190831575|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In190831575|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In190831575, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In190831575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In190831575, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In190831575, ~weak$$choice2~0=~weak$$choice2~0_In190831575, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In190831575|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out190831575|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In190831575, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In190831575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In190831575, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In190831575, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out190831575|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out190831575|, ~weak$$choice2~0=~weak$$choice2~0_In190831575} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:40:07,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_371 v_~z$r_buff0_thd3~0_370) (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_370, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:40:07,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 16:40:07,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1402730083 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1402730083 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out1402730083| |P2Thread1of1ForFork0_#t~ite38_Out1402730083|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In1402730083 |P2Thread1of1ForFork0_#t~ite38_Out1402730083|)) (and (not .cse0) (not .cse1) .cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1402730083| ~z$w_buff1~0_In1402730083)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1402730083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402730083, ~z$w_buff1~0=~z$w_buff1~0_In1402730083, ~z~0=~z~0_In1402730083} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1402730083|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1402730083|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1402730083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402730083, ~z$w_buff1~0=~z$w_buff1~0_In1402730083, ~z~0=~z~0_In1402730083} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:40:07,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In190733689 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In190733689 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out190733689| ~z$w_buff0_used~0_In190733689) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out190733689| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In190733689, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In190733689} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In190733689, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out190733689|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In190733689} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 16:40:07,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1114620541 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1114620541 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1114620541 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1114620541 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out1114620541| ~z$w_buff1_used~0_In1114620541) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out1114620541| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1114620541, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1114620541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1114620541, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1114620541} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1114620541, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1114620541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1114620541, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1114620541, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1114620541|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 16:40:07,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1259775689 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1259775689 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1259775689| ~z$r_buff0_thd3~0_In-1259775689) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1259775689| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1259775689, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1259775689} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1259775689, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1259775689, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1259775689|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:40:07,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1744796272 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1744796272 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1744796272 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1744796272 256)))) (or (and (= ~z$r_buff1_thd3~0_In-1744796272 |P2Thread1of1ForFork0_#t~ite43_Out-1744796272|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1744796272|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1744796272, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1744796272, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1744796272, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1744796272} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1744796272|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1744796272, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1744796272, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1744796272, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1744796272} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 16:40:07,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_308 |v_P2Thread1of1ForFork0_#t~ite43_56|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 16:40:07,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In855135178 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In855135178 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out855135178| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out855135178| ~z$w_buff0_used~0_In855135178)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In855135178, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In855135178} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out855135178|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In855135178, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In855135178} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 16:40:07,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1255367125 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1255367125 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1255367125 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1255367125 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-1255367125| ~z$w_buff1_used~0_In-1255367125)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1255367125| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1255367125, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1255367125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1255367125, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1255367125} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1255367125, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1255367125|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1255367125, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1255367125, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1255367125} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 16:40:07,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2134521839 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-2134521839 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out-2134521839 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In-2134521839 ~z$r_buff0_thd1~0_Out-2134521839)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134521839, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2134521839} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134521839, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-2134521839|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2134521839} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:40:07,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1339521192 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1339521192 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1339521192 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1339521192 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In1339521192 |P0Thread1of1ForFork1_#t~ite8_Out1339521192|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1339521192|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1339521192, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1339521192, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1339521192, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1339521192} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1339521192|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1339521192, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1339521192, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1339521192, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1339521192} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 16:40:07,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:40:07,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In715742688 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In715742688 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out715742688| ~z$w_buff0_used~0_In715742688)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out715742688| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In715742688, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In715742688} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In715742688, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out715742688|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In715742688} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:40:07,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In264074196 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In264074196 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In264074196 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In264074196 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out264074196| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out264074196| ~z$w_buff1_used~0_In264074196)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In264074196, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In264074196, ~z$w_buff1_used~0=~z$w_buff1_used~0_In264074196, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In264074196} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In264074196, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In264074196, ~z$w_buff1_used~0=~z$w_buff1_used~0_In264074196, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out264074196|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In264074196} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 16:40:07,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In125823701 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In125823701 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out125823701| ~z$r_buff0_thd2~0_In125823701) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out125823701| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In125823701, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In125823701} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In125823701, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out125823701|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In125823701} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 16:40:07,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-798235608 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-798235608 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-798235608 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-798235608 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-798235608| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-798235608| ~z$r_buff1_thd2~0_In-798235608)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-798235608, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-798235608, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-798235608, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-798235608} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-798235608, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-798235608, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-798235608, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-798235608|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-798235608} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:40:07,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= v_~z$r_buff1_thd2~0_188 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 16:40:07,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:40:07,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In772226965 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In772226965 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out772226965| ~z~0_In772226965)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out772226965| ~z$w_buff1~0_In772226965) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In772226965, ~z$w_buff1_used~0=~z$w_buff1_used~0_In772226965, ~z$w_buff1~0=~z$w_buff1~0_In772226965, ~z~0=~z~0_In772226965} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In772226965, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out772226965|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In772226965, ~z$w_buff1~0=~z$w_buff1~0_In772226965, ~z~0=~z~0_In772226965} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 16:40:07,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 16:40:07,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-136663262 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-136663262 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-136663262 |ULTIMATE.start_main_#t~ite49_Out-136663262|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-136663262|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-136663262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-136663262} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-136663262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-136663262, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-136663262|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 16:40:07,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-903821784 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-903821784 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-903821784 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-903821784 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-903821784| 0)) (and (= |ULTIMATE.start_main_#t~ite50_Out-903821784| ~z$w_buff1_used~0_In-903821784) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-903821784, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-903821784, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-903821784, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-903821784} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-903821784|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-903821784, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-903821784, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-903821784, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-903821784} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 16:40:07,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-11998536 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-11998536 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-11998536|)) (and (= ~z$r_buff0_thd0~0_In-11998536 |ULTIMATE.start_main_#t~ite51_Out-11998536|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-11998536, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-11998536} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-11998536, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-11998536|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-11998536} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 16:40:07,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1618924566 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1618924566 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1618924566 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1618924566 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1618924566| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out1618924566| ~z$r_buff1_thd0~0_In1618924566) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1618924566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1618924566, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1618924566, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1618924566} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1618924566|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1618924566, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1618924566, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1618924566, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1618924566} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 16:40:07,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p1_EAX~0_22) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 2 v_~x~0_186)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:40:07,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:40:07 BasicIcfg [2019-12-18 16:40:07,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:40:07,931 INFO L168 Benchmark]: Toolchain (without parser) took 166772.40 ms. Allocated memory was 139.5 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 100.8 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 16:40:07,931 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 16:40:07,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.19 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 100.6 MB in the beginning and 155.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:40:07,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.80 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:40:07,932 INFO L168 Benchmark]: Boogie Preprocessor took 44.17 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:40:07,933 INFO L168 Benchmark]: RCFGBuilder took 801.62 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 100.3 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-18 16:40:07,933 INFO L168 Benchmark]: TraceAbstraction took 165047.19 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 16:40:07,935 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.19 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 100.6 MB in the beginning and 155.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.80 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.17 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 801.62 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 100.3 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 165047.19 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7044 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 164.7s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 74.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10134 SDtfs, 14224 SDslu, 47770 SDs, 0 SdLazy, 49676 SolverSat, 789 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 842 GetRequests, 43 SyntacticMatches, 52 SemanticMatches, 747 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6784 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 52.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 312725 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1950 NumberOfCodeBlocks, 1950 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1845 ConstructedInterpolants, 0 QuantifiedInterpolants, 642295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...