/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:53:01,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:53:01,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:53:01,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:53:01,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:53:01,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:53:01,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:53:01,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:53:01,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:53:01,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:53:01,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:53:01,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:53:01,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:53:01,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:53:01,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:53:01,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:53:01,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:53:01,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:53:01,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:53:01,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:53:01,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:53:01,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:53:01,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:53:01,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:53:01,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:53:01,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:53:01,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:53:01,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:53:01,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:53:01,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:53:01,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:53:01,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:53:01,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:53:01,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:53:01,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:53:01,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:53:01,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:53:01,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:53:01,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:53:01,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:53:01,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:53:01,840 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-MCR.epf [2019-12-27 15:53:01,859 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:53:01,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:53:01,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:53:01,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:53:01,861 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:53:01,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:53:01,861 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:53:01,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:53:01,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:53:01,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:53:01,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:53:01,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:53:01,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:53:01,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:53:01,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:53:01,863 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:53:01,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:53:01,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:53:01,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:53:01,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:53:01,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:53:01,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:53:01,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:53:01,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:53:01,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:53:01,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:53:01,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:53:01,865 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:53:01,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:53:01,866 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:53:01,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:53:02,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:53:02,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:53:02,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:53:02,147 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:53:02,147 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:53:02,149 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i [2019-12-27 15:53:02,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729df18a9/207e74b55f844cbf927e02afbfb5c86d/FLAG477de75ea [2019-12-27 15:53:02,768 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:53:02,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i [2019-12-27 15:53:02,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729df18a9/207e74b55f844cbf927e02afbfb5c86d/FLAG477de75ea [2019-12-27 15:53:03,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/729df18a9/207e74b55f844cbf927e02afbfb5c86d [2019-12-27 15:53:03,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:53:03,095 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:53:03,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:53:03,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:53:03,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:53:03,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:53:03" (1/1) ... [2019-12-27 15:53:03,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03, skipping insertion in model container [2019-12-27 15:53:03,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:53:03" (1/1) ... [2019-12-27 15:53:03,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:53:03,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:53:03,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:53:03,641 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:53:03,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:53:03,820 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:53:03,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03 WrapperNode [2019-12-27 15:53:03,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:53:03,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:53:03,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:53:03,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:53:03,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03" (1/1) ... [2019-12-27 15:53:03,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03" (1/1) ... [2019-12-27 15:53:03,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:53:03,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:53:03,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:53:03,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:53:03,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03" (1/1) ... [2019-12-27 15:53:03,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03" (1/1) ... [2019-12-27 15:53:03,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03" (1/1) ... [2019-12-27 15:53:03,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03" (1/1) ... [2019-12-27 15:53:03,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03" (1/1) ... [2019-12-27 15:53:03,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03" (1/1) ... [2019-12-27 15:53:03,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03" (1/1) ... [2019-12-27 15:53:03,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:53:03,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:53:03,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:53:03,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:53:03,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03" (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-27 15:53:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:53:03,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:53:03,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:53:03,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:53:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:53:03,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:53:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:53:03,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:53:03,999 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:53:03,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:53:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:53:04,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:53:04,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:53:04,003 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:53:04,755 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:53:04,755 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:53:04,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:53:04 BoogieIcfgContainer [2019-12-27 15:53:04,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:53:04,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:53:04,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:53:04,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:53:04,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:53:03" (1/3) ... [2019-12-27 15:53:04,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acf56ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:53:04, skipping insertion in model container [2019-12-27 15:53:04,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:53:03" (2/3) ... [2019-12-27 15:53:04,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acf56ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:53:04, skipping insertion in model container [2019-12-27 15:53:04,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:53:04" (3/3) ... [2019-12-27 15:53:04,765 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_rmo.oepc.i [2019-12-27 15:53:04,776 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:53:04,776 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:53:04,784 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:53:04,785 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:53:04,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,831 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,831 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,831 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,832 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,832 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,845 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,845 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,868 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,869 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,897 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,899 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,906 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,906 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,906 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,912 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,913 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:53:04,932 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:53:04,952 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:53:04,952 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:53:04,952 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:53:04,953 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:53:04,953 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:53:04,953 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:53:04,953 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:53:04,953 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:53:04,971 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 15:53:04,973 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 15:53:05,080 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 15:53:05,080 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:53:05,101 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:53:05,129 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 15:53:05,183 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 15:53:05,183 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:53:05,192 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:53:05,214 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:53:05,215 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:53:10,568 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 15:53:10,676 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 15:53:11,018 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 15:53:11,142 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 15:53:11,171 INFO L206 etLargeBlockEncoding]: Checked pairs total: 90866 [2019-12-27 15:53:11,171 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 15:53:11,175 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 103 transitions [2019-12-27 15:53:31,649 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123302 states. [2019-12-27 15:53:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 123302 states. [2019-12-27 15:53:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:53:31,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:31,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:53:31,658 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-27 15:53:31,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash 918873, now seen corresponding path program 1 times [2019-12-27 15:53:31,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:31,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614051875] [2019-12-27 15:53:31,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:31,896 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-27 15:53:31,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614051875] [2019-12-27 15:53:31,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:31,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:53:31,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1979498543] [2019-12-27 15:53:31,900 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:31,904 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:31,917 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:53:31,917 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:31,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:31,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:53:31,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:31,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:53:31,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:53:31,939 INFO L87 Difference]: Start difference. First operand 123302 states. Second operand 3 states. [2019-12-27 15:53:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:33,438 INFO L93 Difference]: Finished difference Result 122174 states and 518852 transitions. [2019-12-27 15:53:33,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:53:33,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:53:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:37,460 INFO L225 Difference]: With dead ends: 122174 [2019-12-27 15:53:37,460 INFO L226 Difference]: Without dead ends: 115076 [2019-12-27 15:53:37,462 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-27 15:53:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115076 states. [2019-12-27 15:53:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115076 to 115076. [2019-12-27 15:53:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115076 states. [2019-12-27 15:53:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115076 states to 115076 states and 488094 transitions. [2019-12-27 15:53:50,075 INFO L78 Accepts]: Start accepts. Automaton has 115076 states and 488094 transitions. Word has length 3 [2019-12-27 15:53:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:53:50,076 INFO L462 AbstractCegarLoop]: Abstraction has 115076 states and 488094 transitions. [2019-12-27 15:53:50,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:53:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 115076 states and 488094 transitions. [2019-12-27 15:53:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:53:50,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:53:50,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:53:50,080 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-27 15:53:50,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:53:50,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1360334080, now seen corresponding path program 1 times [2019-12-27 15:53:50,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:53:50,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096322320] [2019-12-27 15:53:50,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:53:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:53:50,191 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-27 15:53:50,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096322320] [2019-12-27 15:53:50,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:53:50,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:53:50,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241475362] [2019-12-27 15:53:50,192 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:53:50,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:53:50,197 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:53:50,197 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:53:50,197 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:53:50,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:53:50,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:53:50,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:53:50,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:53:50,199 INFO L87 Difference]: Start difference. First operand 115076 states and 488094 transitions. Second operand 4 states. [2019-12-27 15:53:51,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:53:51,452 INFO L93 Difference]: Finished difference Result 178684 states and 728513 transitions. [2019-12-27 15:53:51,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:53:51,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:53:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:53:57,345 INFO L225 Difference]: With dead ends: 178684 [2019-12-27 15:53:57,346 INFO L226 Difference]: Without dead ends: 178635 [2019-12-27 15:53:57,347 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-27 15:54:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178635 states. [2019-12-27 15:54:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178635 to 162755. [2019-12-27 15:54:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162755 states. [2019-12-27 15:54:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162755 states to 162755 states and 672033 transitions. [2019-12-27 15:54:07,423 INFO L78 Accepts]: Start accepts. Automaton has 162755 states and 672033 transitions. Word has length 11 [2019-12-27 15:54:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:07,424 INFO L462 AbstractCegarLoop]: Abstraction has 162755 states and 672033 transitions. [2019-12-27 15:54:07,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:54:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 162755 states and 672033 transitions. [2019-12-27 15:54:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:54:07,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:07,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:07,432 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-27 15:54:07,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:07,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1888852276, now seen corresponding path program 1 times [2019-12-27 15:54:07,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:07,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786283936] [2019-12-27 15:54:07,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:07,515 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-27 15:54:07,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786283936] [2019-12-27 15:54:07,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:07,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:54:07,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1576638794] [2019-12-27 15:54:07,516 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:07,517 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:07,519 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:54:07,520 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:07,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:07,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:54:07,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:07,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:54:07,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:07,521 INFO L87 Difference]: Start difference. First operand 162755 states and 672033 transitions. Second operand 3 states. [2019-12-27 15:54:07,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:07,695 INFO L93 Difference]: Finished difference Result 34587 states and 111811 transitions. [2019-12-27 15:54:07,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:54:07,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:54:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:07,754 INFO L225 Difference]: With dead ends: 34587 [2019-12-27 15:54:07,755 INFO L226 Difference]: Without dead ends: 34587 [2019-12-27 15:54:07,755 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-27 15:54:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34587 states. [2019-12-27 15:54:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34587 to 34587. [2019-12-27 15:54:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34587 states. [2019-12-27 15:54:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34587 states to 34587 states and 111811 transitions. [2019-12-27 15:54:08,353 INFO L78 Accepts]: Start accepts. Automaton has 34587 states and 111811 transitions. Word has length 13 [2019-12-27 15:54:08,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:08,353 INFO L462 AbstractCegarLoop]: Abstraction has 34587 states and 111811 transitions. [2019-12-27 15:54:08,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:54:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 34587 states and 111811 transitions. [2019-12-27 15:54:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:54:08,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:08,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:54:08,358 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-27 15:54:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1220224201, now seen corresponding path program 1 times [2019-12-27 15:54:08,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:08,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506514893] [2019-12-27 15:54:08,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:08,460 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-27 15:54:08,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506514893] [2019-12-27 15:54:08,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:08,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:08,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [390391125] [2019-12-27 15:54:08,461 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:08,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:08,466 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:54:08,466 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:08,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:08,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:08,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:08,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:08,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:08,468 INFO L87 Difference]: Start difference. First operand 34587 states and 111811 transitions. Second operand 5 states. [2019-12-27 15:54:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:09,386 INFO L93 Difference]: Finished difference Result 47506 states and 151809 transitions. [2019-12-27 15:54:09,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 15:54:09,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 15:54:09,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:09,464 INFO L225 Difference]: With dead ends: 47506 [2019-12-27 15:54:09,465 INFO L226 Difference]: Without dead ends: 47506 [2019-12-27 15:54:09,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:54:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47506 states. [2019-12-27 15:54:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47506 to 39981. [2019-12-27 15:54:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39981 states. [2019-12-27 15:54:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39981 states to 39981 states and 128832 transitions. [2019-12-27 15:54:10,193 INFO L78 Accepts]: Start accepts. Automaton has 39981 states and 128832 transitions. Word has length 16 [2019-12-27 15:54:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:10,194 INFO L462 AbstractCegarLoop]: Abstraction has 39981 states and 128832 transitions. [2019-12-27 15:54:10,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 39981 states and 128832 transitions. [2019-12-27 15:54:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:54:10,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:10,203 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-27 15:54:10,204 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-27 15:54:10,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:10,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1720601530, now seen corresponding path program 1 times [2019-12-27 15:54:10,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:10,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444560590] [2019-12-27 15:54:10,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:10,329 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-27 15:54:10,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444560590] [2019-12-27 15:54:10,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:10,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:54:10,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1582300122] [2019-12-27 15:54:10,330 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:10,333 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:10,339 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 15:54:10,339 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:10,341 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:10,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:54:10,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:10,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:54:10,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:10,342 INFO L87 Difference]: Start difference. First operand 39981 states and 128832 transitions. Second operand 6 states. [2019-12-27 15:54:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:11,278 INFO L93 Difference]: Finished difference Result 59624 states and 187628 transitions. [2019-12-27 15:54:11,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:54:11,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 15:54:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:11,376 INFO L225 Difference]: With dead ends: 59624 [2019-12-27 15:54:11,376 INFO L226 Difference]: Without dead ends: 59617 [2019-12-27 15:54:11,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 15:54:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59617 states. [2019-12-27 15:54:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59617 to 40463. [2019-12-27 15:54:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40463 states. [2019-12-27 15:54:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40463 states to 40463 states and 129749 transitions. [2019-12-27 15:54:12,617 INFO L78 Accepts]: Start accepts. Automaton has 40463 states and 129749 transitions. Word has length 22 [2019-12-27 15:54:12,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:12,617 INFO L462 AbstractCegarLoop]: Abstraction has 40463 states and 129749 transitions. [2019-12-27 15:54:12,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:54:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 40463 states and 129749 transitions. [2019-12-27 15:54:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:54:12,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:12,631 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-27 15:54:12,631 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-27 15:54:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash -74763598, now seen corresponding path program 1 times [2019-12-27 15:54:12,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:12,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630443102] [2019-12-27 15:54:12,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:12,693 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-27 15:54:12,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630443102] [2019-12-27 15:54:12,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:12,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:12,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [974964990] [2019-12-27 15:54:12,694 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:12,697 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:12,707 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:54:12,707 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:12,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:54:12,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:54:12,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:54:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:12,746 INFO L87 Difference]: Start difference. First operand 40463 states and 129749 transitions. Second operand 5 states. [2019-12-27 15:54:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:12,820 INFO L93 Difference]: Finished difference Result 16096 states and 48753 transitions. [2019-12-27 15:54:12,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:54:12,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 15:54:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:12,843 INFO L225 Difference]: With dead ends: 16096 [2019-12-27 15:54:12,844 INFO L226 Difference]: Without dead ends: 16096 [2019-12-27 15:54:12,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:54:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16096 states. [2019-12-27 15:54:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16096 to 15803. [2019-12-27 15:54:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15803 states. [2019-12-27 15:54:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15803 states to 15803 states and 47917 transitions. [2019-12-27 15:54:13,087 INFO L78 Accepts]: Start accepts. Automaton has 15803 states and 47917 transitions. Word has length 25 [2019-12-27 15:54:13,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:13,087 INFO L462 AbstractCegarLoop]: Abstraction has 15803 states and 47917 transitions. [2019-12-27 15:54:13,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:54:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 15803 states and 47917 transitions. [2019-12-27 15:54:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:54:13,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:13,101 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] [2019-12-27 15:54:13,101 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-27 15:54:13,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:13,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1856606199, now seen corresponding path program 1 times [2019-12-27 15:54:13,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:13,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668233115] [2019-12-27 15:54:13,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:13,196 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-27 15:54:13,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668233115] [2019-12-27 15:54:13,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:13,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:54:13,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2099823474] [2019-12-27 15:54:13,197 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:13,201 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:13,207 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:54:13,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:13,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:13,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:54:13,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:13,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:54:13,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:13,209 INFO L87 Difference]: Start difference. First operand 15803 states and 47917 transitions. Second operand 6 states. [2019-12-27 15:54:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:13,810 INFO L93 Difference]: Finished difference Result 22779 states and 67340 transitions. [2019-12-27 15:54:13,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 15:54:13,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 15:54:13,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:13,843 INFO L225 Difference]: With dead ends: 22779 [2019-12-27 15:54:13,843 INFO L226 Difference]: Without dead ends: 22779 [2019-12-27 15:54:13,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:54:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22779 states. [2019-12-27 15:54:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22779 to 18120. [2019-12-27 15:54:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18120 states. [2019-12-27 15:54:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18120 states to 18120 states and 54739 transitions. [2019-12-27 15:54:14,148 INFO L78 Accepts]: Start accepts. Automaton has 18120 states and 54739 transitions. Word has length 27 [2019-12-27 15:54:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:14,149 INFO L462 AbstractCegarLoop]: Abstraction has 18120 states and 54739 transitions. [2019-12-27 15:54:14,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:54:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 18120 states and 54739 transitions. [2019-12-27 15:54:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:54:14,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:14,166 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] [2019-12-27 15:54:14,166 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-27 15:54:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:14,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1731527828, now seen corresponding path program 1 times [2019-12-27 15:54:14,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:14,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627294741] [2019-12-27 15:54:14,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:14,506 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 15:54:14,529 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-27 15:54:14,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627294741] [2019-12-27 15:54:14,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:14,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:54:14,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1617156652] [2019-12-27 15:54:14,530 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:14,536 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:14,552 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 49 transitions. [2019-12-27 15:54:14,552 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:14,553 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:14,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:54:14,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:14,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:54:14,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:54:14,554 INFO L87 Difference]: Start difference. First operand 18120 states and 54739 transitions. Second operand 7 states. [2019-12-27 15:54:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:15,651 INFO L93 Difference]: Finished difference Result 24798 states and 73024 transitions. [2019-12-27 15:54:15,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:54:15,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 15:54:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:15,687 INFO L225 Difference]: With dead ends: 24798 [2019-12-27 15:54:15,687 INFO L226 Difference]: Without dead ends: 24798 [2019-12-27 15:54:15,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 15:54:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2019-12-27 15:54:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 16706. [2019-12-27 15:54:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16706 states. [2019-12-27 15:54:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 50524 transitions. [2019-12-27 15:54:15,991 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 50524 transitions. Word has length 33 [2019-12-27 15:54:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:15,991 INFO L462 AbstractCegarLoop]: Abstraction has 16706 states and 50524 transitions. [2019-12-27 15:54:15,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:54:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 50524 transitions. [2019-12-27 15:54:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:54:16,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:16,015 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-27 15:54:16,015 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-27 15:54:16,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1723865273, now seen corresponding path program 1 times [2019-12-27 15:54:16,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:16,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202865466] [2019-12-27 15:54:16,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:16,095 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-27 15:54:16,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202865466] [2019-12-27 15:54:16,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:16,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:54:16,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1712914865] [2019-12-27 15:54:16,097 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:16,107 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:16,182 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 375 transitions. [2019-12-27 15:54:16,183 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:16,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:16,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:54:16,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:16,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:54:16,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:16,186 INFO L87 Difference]: Start difference. First operand 16706 states and 50524 transitions. Second operand 3 states. [2019-12-27 15:54:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:16,315 INFO L93 Difference]: Finished difference Result 28297 states and 85903 transitions. [2019-12-27 15:54:16,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:54:16,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:54:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:16,342 INFO L225 Difference]: With dead ends: 28297 [2019-12-27 15:54:16,342 INFO L226 Difference]: Without dead ends: 14210 [2019-12-27 15:54:16,343 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-27 15:54:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14210 states. [2019-12-27 15:54:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14210 to 14150. [2019-12-27 15:54:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2019-12-27 15:54:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 42128 transitions. [2019-12-27 15:54:16,570 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 42128 transitions. Word has length 39 [2019-12-27 15:54:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:16,570 INFO L462 AbstractCegarLoop]: Abstraction has 14150 states and 42128 transitions. [2019-12-27 15:54:16,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:54:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 42128 transitions. [2019-12-27 15:54:16,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:54:16,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:16,588 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-27 15:54:16,588 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-27 15:54:16,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:16,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1940280365, now seen corresponding path program 2 times [2019-12-27 15:54:16,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:16,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313100326] [2019-12-27 15:54:16,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:16,661 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-27 15:54:16,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313100326] [2019-12-27 15:54:16,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:16,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:54:16,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [851306210] [2019-12-27 15:54:16,662 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:16,672 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:16,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 378 transitions. [2019-12-27 15:54:16,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:16,747 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:54:16,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:54:16,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:16,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:54:16,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:16,748 INFO L87 Difference]: Start difference. First operand 14150 states and 42128 transitions. Second operand 3 states. [2019-12-27 15:54:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:16,809 INFO L93 Difference]: Finished difference Result 14149 states and 42126 transitions. [2019-12-27 15:54:16,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:54:16,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:54:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:16,831 INFO L225 Difference]: With dead ends: 14149 [2019-12-27 15:54:16,832 INFO L226 Difference]: Without dead ends: 14149 [2019-12-27 15:54:16,832 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-27 15:54:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2019-12-27 15:54:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 14149. [2019-12-27 15:54:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14149 states. [2019-12-27 15:54:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14149 states to 14149 states and 42126 transitions. [2019-12-27 15:54:17,046 INFO L78 Accepts]: Start accepts. Automaton has 14149 states and 42126 transitions. Word has length 39 [2019-12-27 15:54:17,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:17,046 INFO L462 AbstractCegarLoop]: Abstraction has 14149 states and 42126 transitions. [2019-12-27 15:54:17,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:54:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 14149 states and 42126 transitions. [2019-12-27 15:54:17,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:54:17,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:17,064 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-27 15:54:17,064 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-27 15:54:17,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:17,065 INFO L82 PathProgramCache]: Analyzing trace with hash 140069502, now seen corresponding path program 1 times [2019-12-27 15:54:17,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:17,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618223115] [2019-12-27 15:54:17,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:17,337 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-27 15:54:17,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618223115] [2019-12-27 15:54:17,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:17,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:54:17,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1335619570] [2019-12-27 15:54:17,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:17,347 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:17,454 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 448 transitions. [2019-12-27 15:54:17,454 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:17,479 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:54:17,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:54:17,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:17,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:54:17,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:17,481 INFO L87 Difference]: Start difference. First operand 14149 states and 42126 transitions. Second operand 6 states. [2019-12-27 15:54:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:17,562 INFO L93 Difference]: Finished difference Result 13093 states and 39713 transitions. [2019-12-27 15:54:17,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:54:17,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 15:54:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:17,583 INFO L225 Difference]: With dead ends: 13093 [2019-12-27 15:54:17,583 INFO L226 Difference]: Without dead ends: 11563 [2019-12-27 15:54:17,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:54:17,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11563 states. [2019-12-27 15:54:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11563 to 11150. [2019-12-27 15:54:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11150 states. [2019-12-27 15:54:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 34836 transitions. [2019-12-27 15:54:17,801 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 34836 transitions. Word has length 40 [2019-12-27 15:54:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:17,801 INFO L462 AbstractCegarLoop]: Abstraction has 11150 states and 34836 transitions. [2019-12-27 15:54:17,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:54:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 34836 transitions. [2019-12-27 15:54:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:54:17,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:17,813 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-27 15:54:17,814 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-27 15:54:17,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:17,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1749898488, now seen corresponding path program 1 times [2019-12-27 15:54:17,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:17,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078925083] [2019-12-27 15:54:17,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:17,859 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-27 15:54:17,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078925083] [2019-12-27 15:54:17,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:17,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:54:17,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1252790636] [2019-12-27 15:54:17,860 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:17,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:18,114 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 425 transitions. [2019-12-27 15:54:18,115 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:18,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 15:54:18,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:54:18,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:18,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:54:18,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:18,127 INFO L87 Difference]: Start difference. First operand 11150 states and 34836 transitions. Second operand 3 states. [2019-12-27 15:54:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:18,211 INFO L93 Difference]: Finished difference Result 17888 states and 54761 transitions. [2019-12-27 15:54:18,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:54:18,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:54:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:18,235 INFO L225 Difference]: With dead ends: 17888 [2019-12-27 15:54:18,236 INFO L226 Difference]: Without dead ends: 17888 [2019-12-27 15:54:18,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:18,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17888 states. [2019-12-27 15:54:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17888 to 12900. [2019-12-27 15:54:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12900 states. [2019-12-27 15:54:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12900 states to 12900 states and 39991 transitions. [2019-12-27 15:54:18,480 INFO L78 Accepts]: Start accepts. Automaton has 12900 states and 39991 transitions. Word has length 64 [2019-12-27 15:54:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:18,480 INFO L462 AbstractCegarLoop]: Abstraction has 12900 states and 39991 transitions. [2019-12-27 15:54:18,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:54:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 12900 states and 39991 transitions. [2019-12-27 15:54:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:54:18,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:18,498 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-27 15:54:18,498 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-27 15:54:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1943324054, now seen corresponding path program 1 times [2019-12-27 15:54:18,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:18,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934838012] [2019-12-27 15:54:18,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:18,603 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-27 15:54:18,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934838012] [2019-12-27 15:54:18,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:18,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:54:18,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [768294693] [2019-12-27 15:54:18,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:18,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:19,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 425 transitions. [2019-12-27 15:54:19,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:19,131 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 15:54:19,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:54:19,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:19,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:54:19,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:54:19,132 INFO L87 Difference]: Start difference. First operand 12900 states and 39991 transitions. Second operand 9 states. [2019-12-27 15:54:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:21,098 INFO L93 Difference]: Finished difference Result 55398 states and 168148 transitions. [2019-12-27 15:54:21,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 15:54:21,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 15:54:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:21,154 INFO L225 Difference]: With dead ends: 55398 [2019-12-27 15:54:21,154 INFO L226 Difference]: Without dead ends: 40772 [2019-12-27 15:54:21,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-12-27 15:54:21,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40772 states. [2019-12-27 15:54:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40772 to 15594. [2019-12-27 15:54:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15594 states. [2019-12-27 15:54:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15594 states to 15594 states and 48552 transitions. [2019-12-27 15:54:21,610 INFO L78 Accepts]: Start accepts. Automaton has 15594 states and 48552 transitions. Word has length 64 [2019-12-27 15:54:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:21,610 INFO L462 AbstractCegarLoop]: Abstraction has 15594 states and 48552 transitions. [2019-12-27 15:54:21,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:54:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 15594 states and 48552 transitions. [2019-12-27 15:54:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:54:21,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:21,629 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-27 15:54:21,630 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-27 15:54:21,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:21,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1388273988, now seen corresponding path program 2 times [2019-12-27 15:54:21,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:21,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901579287] [2019-12-27 15:54:21,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:21,713 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-27 15:54:21,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901579287] [2019-12-27 15:54:21,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:21,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:54:21,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2098776027] [2019-12-27 15:54:21,715 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:21,736 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:21,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 299 states and 545 transitions. [2019-12-27 15:54:21,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:22,063 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 15:54:22,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:54:22,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:22,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:54:22,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:54:22,064 INFO L87 Difference]: Start difference. First operand 15594 states and 48552 transitions. Second operand 10 states. [2019-12-27 15:54:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:22,870 INFO L93 Difference]: Finished difference Result 41160 states and 125962 transitions. [2019-12-27 15:54:22,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 15:54:22,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 15:54:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:22,911 INFO L225 Difference]: With dead ends: 41160 [2019-12-27 15:54:22,912 INFO L226 Difference]: Without dead ends: 29917 [2019-12-27 15:54:22,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-27 15:54:23,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29917 states. [2019-12-27 15:54:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29917 to 18174. [2019-12-27 15:54:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18174 states. [2019-12-27 15:54:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18174 states to 18174 states and 56555 transitions. [2019-12-27 15:54:23,291 INFO L78 Accepts]: Start accepts. Automaton has 18174 states and 56555 transitions. Word has length 64 [2019-12-27 15:54:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:23,291 INFO L462 AbstractCegarLoop]: Abstraction has 18174 states and 56555 transitions. [2019-12-27 15:54:23,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:54:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 18174 states and 56555 transitions. [2019-12-27 15:54:23,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:54:23,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:23,315 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-27 15:54:23,315 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-27 15:54:23,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:23,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1006987750, now seen corresponding path program 3 times [2019-12-27 15:54:23,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:23,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424281259] [2019-12-27 15:54:23,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:23,437 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-27 15:54:23,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424281259] [2019-12-27 15:54:23,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:23,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:54:23,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1567968679] [2019-12-27 15:54:23,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:23,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:23,672 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 485 transitions. [2019-12-27 15:54:23,672 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:23,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 15:54:23,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:54:23,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:23,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:54:23,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:54:23,906 INFO L87 Difference]: Start difference. First operand 18174 states and 56555 transitions. Second operand 12 states. [2019-12-27 15:54:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:27,426 INFO L93 Difference]: Finished difference Result 95198 states and 289540 transitions. [2019-12-27 15:54:27,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 15:54:27,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 15:54:27,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:27,587 INFO L225 Difference]: With dead ends: 95198 [2019-12-27 15:54:27,588 INFO L226 Difference]: Without dead ends: 75691 [2019-12-27 15:54:27,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 14 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=745, Invalid=2447, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 15:54:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75691 states. [2019-12-27 15:54:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75691 to 21666. [2019-12-27 15:54:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21666 states. [2019-12-27 15:54:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21666 states to 21666 states and 67958 transitions. [2019-12-27 15:54:28,448 INFO L78 Accepts]: Start accepts. Automaton has 21666 states and 67958 transitions. Word has length 64 [2019-12-27 15:54:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:28,448 INFO L462 AbstractCegarLoop]: Abstraction has 21666 states and 67958 transitions. [2019-12-27 15:54:28,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:54:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 21666 states and 67958 transitions. [2019-12-27 15:54:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:54:28,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:28,471 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-27 15:54:28,471 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-27 15:54:28,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:28,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1651786320, now seen corresponding path program 4 times [2019-12-27 15:54:28,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:28,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449744126] [2019-12-27 15:54:28,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:28,531 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-27 15:54:28,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449744126] [2019-12-27 15:54:28,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:28,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:54:28,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1853150109] [2019-12-27 15:54:28,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:28,553 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:28,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 438 transitions. [2019-12-27 15:54:28,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:28,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:54:28,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:54:28,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:28,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:54:28,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:54:28,885 INFO L87 Difference]: Start difference. First operand 21666 states and 67958 transitions. Second operand 3 states. [2019-12-27 15:54:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:29,055 INFO L93 Difference]: Finished difference Result 25949 states and 80629 transitions. [2019-12-27 15:54:29,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:54:29,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:54:29,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:29,103 INFO L225 Difference]: With dead ends: 25949 [2019-12-27 15:54:29,104 INFO L226 Difference]: Without dead ends: 25949 [2019-12-27 15:54:29,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-27 15:54:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25949 states. [2019-12-27 15:54:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25949 to 22890. [2019-12-27 15:54:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22890 states. [2019-12-27 15:54:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22890 states to 22890 states and 71673 transitions. [2019-12-27 15:54:29,833 INFO L78 Accepts]: Start accepts. Automaton has 22890 states and 71673 transitions. Word has length 64 [2019-12-27 15:54:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:29,833 INFO L462 AbstractCegarLoop]: Abstraction has 22890 states and 71673 transitions. [2019-12-27 15:54:29,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:54:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 22890 states and 71673 transitions. [2019-12-27 15:54:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:54:29,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:29,857 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-27 15:54:29,857 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-27 15:54:29,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:29,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1362059626, now seen corresponding path program 1 times [2019-12-27 15:54:29,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:29,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831355638] [2019-12-27 15:54:29,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:29,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-27 15:54:29,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831355638] [2019-12-27 15:54:29,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:29,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:54:29,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1055329130] [2019-12-27 15:54:29,971 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:29,991 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:30,318 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 602 transitions. [2019-12-27 15:54:30,318 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:30,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 15:54:30,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:54:30,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:30,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:54:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:54:30,581 INFO L87 Difference]: Start difference. First operand 22890 states and 71673 transitions. Second operand 12 states. [2019-12-27 15:54:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:35,092 INFO L93 Difference]: Finished difference Result 84887 states and 259192 transitions. [2019-12-27 15:54:35,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 15:54:35,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 15:54:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:35,212 INFO L225 Difference]: With dead ends: 84887 [2019-12-27 15:54:35,213 INFO L226 Difference]: Without dead ends: 78935 [2019-12-27 15:54:35,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 14 SyntacticMatches, 16 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=641, Invalid=2221, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 15:54:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78935 states. [2019-12-27 15:54:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78935 to 23716. [2019-12-27 15:54:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23716 states. [2019-12-27 15:54:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23716 states to 23716 states and 74488 transitions. [2019-12-27 15:54:36,409 INFO L78 Accepts]: Start accepts. Automaton has 23716 states and 74488 transitions. Word has length 65 [2019-12-27 15:54:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:36,409 INFO L462 AbstractCegarLoop]: Abstraction has 23716 states and 74488 transitions. [2019-12-27 15:54:36,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:54:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 23716 states and 74488 transitions. [2019-12-27 15:54:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:54:36,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:36,434 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-27 15:54:36,434 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-27 15:54:36,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1431042364, now seen corresponding path program 2 times [2019-12-27 15:54:36,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:36,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480183011] [2019-12-27 15:54:36,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:36,562 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-27 15:54:36,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480183011] [2019-12-27 15:54:36,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:36,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:54:36,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1766880677] [2019-12-27 15:54:36,564 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:36,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:36,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 433 transitions. [2019-12-27 15:54:36,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:37,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 15:54:37,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:54:37,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:37,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:54:37,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:54:37,004 INFO L87 Difference]: Start difference. First operand 23716 states and 74488 transitions. Second operand 10 states. [2019-12-27 15:54:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:38,703 INFO L93 Difference]: Finished difference Result 71714 states and 218093 transitions. [2019-12-27 15:54:38,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 15:54:38,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 15:54:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:38,803 INFO L225 Difference]: With dead ends: 71714 [2019-12-27 15:54:38,803 INFO L226 Difference]: Without dead ends: 68784 [2019-12-27 15:54:38,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-12-27 15:54:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68784 states. [2019-12-27 15:54:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68784 to 23633. [2019-12-27 15:54:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23633 states. [2019-12-27 15:54:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23633 states to 23633 states and 74108 transitions. [2019-12-27 15:54:39,878 INFO L78 Accepts]: Start accepts. Automaton has 23633 states and 74108 transitions. Word has length 65 [2019-12-27 15:54:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:39,879 INFO L462 AbstractCegarLoop]: Abstraction has 23633 states and 74108 transitions. [2019-12-27 15:54:39,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:54:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 23633 states and 74108 transitions. [2019-12-27 15:54:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:54:39,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:39,903 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-27 15:54:39,903 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-27 15:54:39,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:39,903 INFO L82 PathProgramCache]: Analyzing trace with hash -848247963, now seen corresponding path program 1 times [2019-12-27 15:54:39,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:39,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102277963] [2019-12-27 15:54:39,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:40,011 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-27 15:54:40,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102277963] [2019-12-27 15:54:40,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:40,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:54:40,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1309309376] [2019-12-27 15:54:40,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:40,033 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:40,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 442 transitions. [2019-12-27 15:54:40,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:40,297 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:54:40,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:54:40,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:40,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:54:40,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:54:40,298 INFO L87 Difference]: Start difference. First operand 23633 states and 74108 transitions. Second operand 4 states. [2019-12-27 15:54:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:40,557 INFO L93 Difference]: Finished difference Result 30115 states and 91713 transitions. [2019-12-27 15:54:40,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:54:40,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 15:54:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:40,599 INFO L225 Difference]: With dead ends: 30115 [2019-12-27 15:54:40,599 INFO L226 Difference]: Without dead ends: 30115 [2019-12-27 15:54:40,600 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-27 15:54:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30115 states. [2019-12-27 15:54:40,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30115 to 19708. [2019-12-27 15:54:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19708 states. [2019-12-27 15:54:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19708 states to 19708 states and 60636 transitions. [2019-12-27 15:54:40,966 INFO L78 Accepts]: Start accepts. Automaton has 19708 states and 60636 transitions. Word has length 65 [2019-12-27 15:54:40,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:40,967 INFO L462 AbstractCegarLoop]: Abstraction has 19708 states and 60636 transitions. [2019-12-27 15:54:40,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:54:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 19708 states and 60636 transitions. [2019-12-27 15:54:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:54:40,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:40,986 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-27 15:54:40,986 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-27 15:54:40,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:40,986 INFO L82 PathProgramCache]: Analyzing trace with hash 451194278, now seen corresponding path program 1 times [2019-12-27 15:54:40,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:40,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955707380] [2019-12-27 15:54:40,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:41,159 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-27 15:54:41,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955707380] [2019-12-27 15:54:41,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:41,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:54:41,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [744643950] [2019-12-27 15:54:41,160 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:41,181 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:41,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 435 transitions. [2019-12-27 15:54:41,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:41,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:54:41,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 15:54:41,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 15:54:41,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:41,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 15:54:41,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:54:41,854 INFO L87 Difference]: Start difference. First operand 19708 states and 60636 transitions. Second operand 15 states. [2019-12-27 15:54:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:44,833 INFO L93 Difference]: Finished difference Result 38100 states and 116349 transitions. [2019-12-27 15:54:44,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 15:54:44,834 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 15:54:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:44,874 INFO L225 Difference]: With dead ends: 38100 [2019-12-27 15:54:44,874 INFO L226 Difference]: Without dead ends: 28097 [2019-12-27 15:54:44,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2019-12-27 15:54:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28097 states. [2019-12-27 15:54:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28097 to 20452. [2019-12-27 15:54:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20452 states. [2019-12-27 15:54:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20452 states to 20452 states and 62587 transitions. [2019-12-27 15:54:45,252 INFO L78 Accepts]: Start accepts. Automaton has 20452 states and 62587 transitions. Word has length 66 [2019-12-27 15:54:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:45,253 INFO L462 AbstractCegarLoop]: Abstraction has 20452 states and 62587 transitions. [2019-12-27 15:54:45,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 15:54:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 20452 states and 62587 transitions. [2019-12-27 15:54:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:54:45,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:45,276 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-27 15:54:45,276 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-27 15:54:45,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:45,277 INFO L82 PathProgramCache]: Analyzing trace with hash 60784614, now seen corresponding path program 2 times [2019-12-27 15:54:45,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:45,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347832427] [2019-12-27 15:54:45,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:45,510 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-27 15:54:45,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347832427] [2019-12-27 15:54:45,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:45,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:54:45,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1080970651] [2019-12-27 15:54:45,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:45,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:45,821 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 395 transitions. [2019-12-27 15:54:45,822 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:46,022 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 15:54:46,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 15:54:46,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:46,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 15:54:46,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 15:54:46,023 INFO L87 Difference]: Start difference. First operand 20452 states and 62587 transitions. Second operand 15 states. [2019-12-27 15:54:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:48,130 INFO L93 Difference]: Finished difference Result 43775 states and 132890 transitions. [2019-12-27 15:54:48,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 15:54:48,131 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-27 15:54:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:48,181 INFO L225 Difference]: With dead ends: 43775 [2019-12-27 15:54:48,181 INFO L226 Difference]: Without dead ends: 40194 [2019-12-27 15:54:48,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=240, Invalid=1020, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 15:54:48,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40194 states. [2019-12-27 15:54:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40194 to 24262. [2019-12-27 15:54:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24262 states. [2019-12-27 15:54:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24262 states to 24262 states and 73801 transitions. [2019-12-27 15:54:48,661 INFO L78 Accepts]: Start accepts. Automaton has 24262 states and 73801 transitions. Word has length 66 [2019-12-27 15:54:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:48,661 INFO L462 AbstractCegarLoop]: Abstraction has 24262 states and 73801 transitions. [2019-12-27 15:54:48,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 15:54:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 24262 states and 73801 transitions. [2019-12-27 15:54:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:54:48,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:48,689 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-27 15:54:48,689 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-27 15:54:48,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:48,690 INFO L82 PathProgramCache]: Analyzing trace with hash 741333008, now seen corresponding path program 3 times [2019-12-27 15:54:48,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:48,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368673078] [2019-12-27 15:54:48,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:48,871 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-27 15:54:48,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368673078] [2019-12-27 15:54:48,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:48,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 15:54:48,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [330845107] [2019-12-27 15:54:48,872 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:48,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:49,173 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 304 states and 609 transitions. [2019-12-27 15:54:49,173 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:49,450 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 15:54:49,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 15:54:49,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:49,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 15:54:49,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 15:54:49,451 INFO L87 Difference]: Start difference. First operand 24262 states and 73801 transitions. Second operand 16 states. [2019-12-27 15:54:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:54:53,240 INFO L93 Difference]: Finished difference Result 52799 states and 158810 transitions. [2019-12-27 15:54:53,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 15:54:53,240 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 15:54:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:54:53,288 INFO L225 Difference]: With dead ends: 52799 [2019-12-27 15:54:53,288 INFO L226 Difference]: Without dead ends: 35706 [2019-12-27 15:54:53,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 13 SyntacticMatches, 10 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=722, Invalid=3310, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 15:54:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35706 states. [2019-12-27 15:54:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35706 to 20578. [2019-12-27 15:54:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20578 states. [2019-12-27 15:54:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20578 states to 20578 states and 62873 transitions. [2019-12-27 15:54:53,702 INFO L78 Accepts]: Start accepts. Automaton has 20578 states and 62873 transitions. Word has length 66 [2019-12-27 15:54:53,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:54:53,703 INFO L462 AbstractCegarLoop]: Abstraction has 20578 states and 62873 transitions. [2019-12-27 15:54:53,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 15:54:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 20578 states and 62873 transitions. [2019-12-27 15:54:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:54:53,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:54:53,723 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-27 15:54:53,723 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-27 15:54:53,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:54:53,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1609612826, now seen corresponding path program 4 times [2019-12-27 15:54:53,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:54:53,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100662850] [2019-12-27 15:54:53,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:54:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:54:54,253 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-27 15:54:54,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100662850] [2019-12-27 15:54:54,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:54:54,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 15:54:54,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1374591185] [2019-12-27 15:54:54,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:54:54,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:54:54,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 277 states and 546 transitions. [2019-12-27 15:54:54,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:54:55,248 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 15:54:55,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 15:54:55,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:54:55,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 15:54:55,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 15:54:55,249 INFO L87 Difference]: Start difference. First operand 20578 states and 62873 transitions. Second operand 20 states. [2019-12-27 15:55:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:55:04,043 INFO L93 Difference]: Finished difference Result 31366 states and 94509 transitions. [2019-12-27 15:55:04,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 15:55:04,045 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-27 15:55:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:55:04,088 INFO L225 Difference]: With dead ends: 31366 [2019-12-27 15:55:04,088 INFO L226 Difference]: Without dead ends: 31084 [2019-12-27 15:55:04,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 13 SyntacticMatches, 18 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=605, Invalid=2817, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 15:55:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31084 states. [2019-12-27 15:55:04,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31084 to 20954. [2019-12-27 15:55:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20954 states. [2019-12-27 15:55:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20954 states to 20954 states and 63988 transitions. [2019-12-27 15:55:04,505 INFO L78 Accepts]: Start accepts. Automaton has 20954 states and 63988 transitions. Word has length 66 [2019-12-27 15:55:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:55:04,506 INFO L462 AbstractCegarLoop]: Abstraction has 20954 states and 63988 transitions. [2019-12-27 15:55:04,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 15:55:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 20954 states and 63988 transitions. [2019-12-27 15:55:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:55:04,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:55:04,527 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-27 15:55:04,527 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-27 15:55:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:55:04,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1227939376, now seen corresponding path program 5 times [2019-12-27 15:55:04,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:55:04,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219148597] [2019-12-27 15:55:04,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:55:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:55:04,603 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-27 15:55:04,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219148597] [2019-12-27 15:55:04,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:55:04,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:55:04,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [95492616] [2019-12-27 15:55:04,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:55:04,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:55:04,868 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 395 transitions. [2019-12-27 15:55:04,868 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:55:04,869 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:55:04,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:55:04,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:55:04,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:55:04,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:55:04,870 INFO L87 Difference]: Start difference. First operand 20954 states and 63988 transitions. Second operand 3 states. [2019-12-27 15:55:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:55:04,935 INFO L93 Difference]: Finished difference Result 20953 states and 63986 transitions. [2019-12-27 15:55:04,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:55:04,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 15:55:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:55:04,966 INFO L225 Difference]: With dead ends: 20953 [2019-12-27 15:55:04,966 INFO L226 Difference]: Without dead ends: 20953 [2019-12-27 15:55:04,966 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-27 15:55:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20953 states. [2019-12-27 15:55:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20953 to 17889. [2019-12-27 15:55:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17889 states. [2019-12-27 15:55:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17889 states to 17889 states and 55378 transitions. [2019-12-27 15:55:05,266 INFO L78 Accepts]: Start accepts. Automaton has 17889 states and 55378 transitions. Word has length 66 [2019-12-27 15:55:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:55:05,266 INFO L462 AbstractCegarLoop]: Abstraction has 17889 states and 55378 transitions. [2019-12-27 15:55:05,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:55:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 17889 states and 55378 transitions. [2019-12-27 15:55:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:55:05,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:55:05,285 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, 1] [2019-12-27 15:55:05,285 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-27 15:55:05,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:55:05,285 INFO L82 PathProgramCache]: Analyzing trace with hash 656134515, now seen corresponding path program 1 times [2019-12-27 15:55:05,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:55:05,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045843402] [2019-12-27 15:55:05,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:55:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:55:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:55:05,407 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:55:05,407 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:55:05,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~a$r_buff1_thd0~0_203 0) (= 0 v_~a$r_buff1_thd1~0_191) (= v_~z~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t293~0.base_37|) 0) (= v_~a$r_buff0_thd0~0_228 0) (= 0 v_~a$r_buff0_thd1~0_317) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~a$r_buff0_thd2~0_205) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t293~0.base_37| 4)) (= v_~main$tmp_guard1~0_42 0) (= v_~a$r_buff0_thd3~0_430 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t293~0.base_37|) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= v_~__unbuffered_cnt~0_111 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x~0_176) (= v_~__unbuffered_p1_EBX~0_55 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= 0 |v_#NULL.base_4|) (= v_~a$mem_tmp~0_16 0) (= 0 v_~a$w_buff0_used~0_889) (= v_~a$w_buff0~0_416 0) (= v_~a$r_buff1_thd3~0_333 0) (= 0 v_~a$w_buff1_used~0_596) (= |v_#NULL.offset_4| 0) (= 0 v_~a$w_buff1~0_333) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t293~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t293~0.base_37|) |v_ULTIMATE.start_main_~#t293~0.offset_26| 0)) |v_#memory_int_23|) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t293~0.base_37| 1)) (= 0 v_~a$r_buff1_thd2~0_185) (= v_~a~0_191 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~weak$$choice0~0_13) (= v_~weak$$choice2~0_131 0) (= |v_ULTIMATE.start_main_~#t293~0.offset_26| 0) (= v_~y~0_31 0) (= 0 v_~a$read_delayed~0_8) (= v_~a$flush_delayed~0_26 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_59|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_228, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_127|, ~a~0=v_~a~0_191, ULTIMATE.start_main_~#t293~0.offset=|v_ULTIMATE.start_main_~#t293~0.offset_26|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_83|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ULTIMATE.start_main_~#t294~0.base=|v_ULTIMATE.start_main_~#t294~0.base_38|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_333, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_889, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_317, ULTIMATE.start_main_~#t295~0.base=|v_ULTIMATE.start_main_~#t295~0.base_30|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t295~0.offset=|v_ULTIMATE.start_main_~#t295~0.offset_18|, ~a$w_buff0~0=v_~a$w_buff0~0_416, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_203, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~x~0=v_~x~0_176, ULTIMATE.start_main_~#t294~0.offset=|v_ULTIMATE.start_main_~#t294~0.offset_26|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_67|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~a$w_buff1~0=v_~a$w_buff1~0_333, ~y~0=v_~y~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_55, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_191, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_430, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_26, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_36, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_596, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t293~0.base=|v_ULTIMATE.start_main_~#t293~0.base_37|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_~#t293~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t294~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t295~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t295~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t294~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t293~0.base] because there is no mapped edge [2019-12-27 15:55:05,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L835-1-->L837: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t294~0.base_13|) 0) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t294~0.base_13| 1) |v_#valid_40|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t294~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t294~0.base_13|) |v_ULTIMATE.start_main_~#t294~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t294~0.base_13|)) (= |v_ULTIMATE.start_main_~#t294~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t294~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t294~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t294~0.offset=|v_ULTIMATE.start_main_~#t294~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, ULTIMATE.start_main_~#t294~0.base=|v_ULTIMATE.start_main_~#t294~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t294~0.offset, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t294~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 15:55:05,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L750: Formula: (and (= v_~a$r_buff0_thd1~0_28 v_~a$r_buff1_thd1~0_23) (= v_~a$r_buff0_thd2~0_20 v_~a$r_buff1_thd2~0_16) (= v_~a$r_buff0_thd0~0_18 v_~a$r_buff1_thd0~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~a$r_buff0_thd1~0_27 1) (= 1 v_~x~0_7) (= v_~a$r_buff0_thd3~0_73 v_~a$r_buff1_thd3~0_40)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18} OutVars{~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_40, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_17, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 15:55:05,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In196435051 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In196435051 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out196435051| ~a$w_buff1~0_In196435051)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out196435051| ~a~0_In196435051) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In196435051, ~a$w_buff1~0=~a$w_buff1~0_In196435051, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In196435051, ~a$w_buff1_used~0=~a$w_buff1_used~0_In196435051} OutVars{~a~0=~a~0_In196435051, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out196435051|, ~a$w_buff1~0=~a$w_buff1~0_In196435051, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In196435051, ~a$w_buff1_used~0=~a$w_buff1_used~0_In196435051} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 15:55:05,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_47) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_47, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 15:55:05,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1733175254 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1733175254 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1733175254| ~a$w_buff0_used~0_In-1733175254)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1733175254| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1733175254, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1733175254} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1733175254|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1733175254, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1733175254} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 15:55:05,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd1~0_In-512266728 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-512266728 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-512266728 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-512266728 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-512266728| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-512266728| ~a$w_buff1_used~0_In-512266728) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-512266728, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-512266728, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-512266728, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-512266728} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-512266728|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-512266728, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-512266728, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-512266728, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-512266728} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 15:55:05,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L753-->L754: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In800831541 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In800831541 256)))) (or (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out800831541) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_In800831541 ~a$r_buff0_thd1~0_Out800831541)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In800831541, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In800831541} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out800831541|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In800831541, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out800831541} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:55:05,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In1908922775 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1908922775 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In1908922775 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1908922775 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1908922775|)) (and (= ~a$r_buff1_thd1~0_In1908922775 |P0Thread1of1ForFork1_#t~ite8_Out1908922775|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1908922775, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1908922775, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1908922775, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1908922775} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1908922775|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1908922775, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1908922775, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1908922775, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1908922775} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 15:55:05,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L754-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_148 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_148, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 15:55:05,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t295~0.base_12| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t295~0.base_12|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t295~0.base_12|)) (= |v_ULTIMATE.start_main_~#t295~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t295~0.base_12| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t295~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t295~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t295~0.base_12|) |v_ULTIMATE.start_main_~#t295~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t295~0.offset=|v_ULTIMATE.start_main_~#t295~0.offset_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t295~0.base=|v_ULTIMATE.start_main_~#t295~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t295~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t295~0.base] because there is no mapped edge [2019-12-27 15:55:05,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1838480668 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out1838480668| ~a$w_buff0~0_In1838480668) (= |P2Thread1of1ForFork0_#t~ite20_In1838480668| |P2Thread1of1ForFork0_#t~ite20_Out1838480668|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1838480668 256)))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In1838480668 256) 0)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1838480668 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In1838480668 256)))) .cse0 (= ~a$w_buff0~0_In1838480668 |P2Thread1of1ForFork0_#t~ite20_Out1838480668|) (= |P2Thread1of1ForFork0_#t~ite21_Out1838480668| |P2Thread1of1ForFork0_#t~ite20_Out1838480668|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1838480668, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1838480668, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1838480668, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1838480668, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1838480668, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1838480668|, ~weak$$choice2~0=~weak$$choice2~0_In1838480668} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1838480668|, ~a$w_buff0~0=~a$w_buff0~0_In1838480668, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1838480668, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1838480668, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1838480668, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1838480668|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1838480668, ~weak$$choice2~0=~weak$$choice2~0_In1838480668} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 15:55:05,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1510058388 256)))) (or (and (= ~a$w_buff0_used~0_In1510058388 |P2Thread1of1ForFork0_#t~ite27_Out1510058388|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In1510058388| |P2Thread1of1ForFork0_#t~ite26_Out1510058388|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out1510058388| |P2Thread1of1ForFork0_#t~ite27_Out1510058388|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1510058388 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1510058388 256))) (= 0 (mod ~a$w_buff0_used~0_In1510058388 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1510058388 256))))) (= ~a$w_buff0_used~0_In1510058388 |P2Thread1of1ForFork0_#t~ite26_Out1510058388|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1510058388|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1510058388, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1510058388, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1510058388, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1510058388, ~weak$$choice2~0=~weak$$choice2~0_In1510058388} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1510058388|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1510058388|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1510058388, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1510058388, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1510058388, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1510058388, ~weak$$choice2~0=~weak$$choice2~0_In1510058388} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 15:55:05,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-84606778 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite30_Out-84606778| ~a$w_buff1_used~0_In-84606778) (= |P2Thread1of1ForFork0_#t~ite29_In-84606778| |P2Thread1of1ForFork0_#t~ite29_Out-84606778|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-84606778| ~a$w_buff1_used~0_In-84606778) .cse0 (= |P2Thread1of1ForFork0_#t~ite30_Out-84606778| |P2Thread1of1ForFork0_#t~ite29_Out-84606778|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-84606778 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-84606778 256) 0)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-84606778 256))) (= (mod ~a$w_buff0_used~0_In-84606778 256) 0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-84606778, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-84606778, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-84606778, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-84606778, ~weak$$choice2~0=~weak$$choice2~0_In-84606778, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-84606778|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-84606778, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-84606778, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-84606778, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-84606778|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-84606778, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-84606778|, ~weak$$choice2~0=~weak$$choice2~0_In-84606778} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 15:55:05,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L805-->L806: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~a$r_buff0_thd3~0_136 v_~a$r_buff0_thd3~0_135)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_135, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 15:55:05,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_12 0) (= v_~a~0_57 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_13 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_13} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_57, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 15:55:05,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L812-2-->L812-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-942477542 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-942477542 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-942477542| ~a$w_buff1~0_In-942477542)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-942477542| ~a~0_In-942477542) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-942477542, ~a$w_buff1~0=~a$w_buff1~0_In-942477542, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-942477542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-942477542} OutVars{~a~0=~a~0_In-942477542, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-942477542|, ~a$w_buff1~0=~a$w_buff1~0_In-942477542, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-942477542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-942477542} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 15:55:05,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L812-4-->L813: Formula: (= v_~a~0_20 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_20, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 15:55:05,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1141933146 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1141933146 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1141933146| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1141933146 |P2Thread1of1ForFork0_#t~ite40_Out1141933146|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1141933146, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1141933146} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1141933146|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1141933146, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1141933146} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 15:55:05,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-515522677 256))) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-515522677 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-515522677 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-515522677 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-515522677|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-515522677 |P2Thread1of1ForFork0_#t~ite41_Out-515522677|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-515522677, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-515522677, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-515522677, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-515522677} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-515522677, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-515522677, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-515522677, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-515522677, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-515522677|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 15:55:05,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1844593704 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1844593704 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1844593704| ~a$r_buff0_thd3~0_In1844593704)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1844593704|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1844593704, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1844593704} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1844593704, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1844593704, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1844593704|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 15:55:05,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-1544631920 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1544631920 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1544631920 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-1544631920 256)))) (or (and (= ~a$r_buff1_thd3~0_In-1544631920 |P2Thread1of1ForFork0_#t~ite43_Out-1544631920|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1544631920| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1544631920, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1544631920, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1544631920, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1544631920} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1544631920|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1544631920, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1544631920, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1544631920, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1544631920} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 15:55:05,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= v_~a$r_buff1_thd3~0_122 |v_P2Thread1of1ForFork0_#t~ite43_34|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 15:55:05,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-240449765 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-240449765 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-240449765|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-240449765| ~a$w_buff0_used~0_In-240449765) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-240449765, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-240449765} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-240449765, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-240449765, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-240449765|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 15:55:05,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-596614709 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-596614709 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-596614709 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-596614709 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-596614709|)) (and (= ~a$w_buff1_used~0_In-596614709 |P1Thread1of1ForFork2_#t~ite12_Out-596614709|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-596614709, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-596614709, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-596614709, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-596614709} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-596614709, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-596614709, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-596614709, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-596614709|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-596614709} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 15:55:05,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1393108015 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1393108015 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1393108015| ~a$r_buff0_thd2~0_In-1393108015)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1393108015| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1393108015, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1393108015} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1393108015, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1393108015, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1393108015|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 15:55:05,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1842233584 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1842233584 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1842233584 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In1842233584 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out1842233584| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out1842233584| ~a$r_buff1_thd2~0_In1842233584) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1842233584, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1842233584, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1842233584, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1842233584} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1842233584, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1842233584, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1842233584, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1842233584, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1842233584|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 15:55:05,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L780-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_79) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 15:55:05,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~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-27 15:55:05,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-188480637 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-188480637 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-188480637| ~a~0_In-188480637)) (and (not .cse1) (= ~a$w_buff1~0_In-188480637 |ULTIMATE.start_main_#t~ite47_Out-188480637|) (not .cse0)))) InVars {~a~0=~a~0_In-188480637, ~a$w_buff1~0=~a$w_buff1~0_In-188480637, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-188480637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-188480637} OutVars{~a~0=~a~0_In-188480637, ~a$w_buff1~0=~a$w_buff1~0_In-188480637, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-188480637|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-188480637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-188480637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 15:55:05,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L845-4-->L846: Formula: (= v_~a~0_30 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_30, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 15:55:05,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-56440358 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-56440358 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-56440358| ~a$w_buff0_used~0_In-56440358) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-56440358| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-56440358, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-56440358} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-56440358, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-56440358|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-56440358} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 15:55:05,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1303887060 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1303887060 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1303887060 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In1303887060 256) 0))) (or (and (= ~a$w_buff1_used~0_In1303887060 |ULTIMATE.start_main_#t~ite50_Out1303887060|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1303887060| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1303887060, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303887060, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1303887060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303887060} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1303887060|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1303887060, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1303887060, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1303887060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1303887060} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 15:55:05,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In559560503 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In559560503 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out559560503|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In559560503 |ULTIMATE.start_main_#t~ite51_Out559560503|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In559560503, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In559560503} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out559560503|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In559560503, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In559560503} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 15:55:05,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In338997185 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In338997185 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In338997185 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In338997185 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out338997185| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out338997185| ~a$r_buff1_thd0~0_In338997185)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In338997185, ~a$w_buff0_used~0=~a$w_buff0_used~0_In338997185, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In338997185, ~a$w_buff1_used~0=~a$w_buff1_used~0_In338997185} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out338997185|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In338997185, ~a$w_buff0_used~0=~a$w_buff0_used~0_In338997185, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In338997185, ~a$w_buff1_used~0=~a$w_buff1_used~0_In338997185} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 15:55:05,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~main$tmp_guard1~0_18 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_~a$r_buff1_thd0~0_158 |v_ULTIMATE.start_main_#t~ite52_40|) (= 2 v_~x~0_125) (= v_~__unbuffered_p1_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_18 256)) (= v_~__unbuffered_p2_EBX~0_24 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_158, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 15:55:05,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:55:05 BasicIcfg [2019-12-27 15:55:05,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:55:05,519 INFO L168 Benchmark]: Toolchain (without parser) took 122424.09 ms. Allocated memory was 138.4 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.1 MB in the beginning and 760.2 MB in the end (delta: -659.1 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 15:55:05,519 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 15:55:05,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.40 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 100.9 MB in the beginning and 156.8 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 15:55:05,524 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.43 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:55:05,524 INFO L168 Benchmark]: Boogie Preprocessor took 43.38 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:55:05,524 INFO L168 Benchmark]: RCFGBuilder took 831.36 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 100.7 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-27 15:55:05,525 INFO L168 Benchmark]: TraceAbstraction took 120759.46 ms. Allocated memory was 203.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.7 MB in the beginning and 760.2 MB in the end (delta: -659.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 15:55:05,530 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.53 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 724.40 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 100.9 MB in the beginning and 156.8 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.43 ms. Allocated memory is still 203.4 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.38 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 831.36 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 100.7 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120759.46 ms. Allocated memory was 203.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.7 MB in the beginning and 760.2 MB in the end (delta: -659.6 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7568 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 90866 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t293, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t294, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y [L773] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L839] FCALL, FORK 0 pthread_create(&t295, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L790] 3 z = 1 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1] [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=2, y=1, z=1] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1] [L812] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1] [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L845] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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] [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 120.4s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 48.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6756 SDtfs, 11089 SDslu, 30733 SDs, 0 SdLazy, 20458 SolverSat, 603 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 134 SyntacticMatches, 85 SemanticMatches, 413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4787 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162755occurred 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: 34.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 317745 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1180 NumberOfCodeBlocks, 1180 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1089 ConstructedInterpolants, 0 QuantifiedInterpolants, 210638 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...