/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:16:28,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:16:28,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:16:28,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:16:28,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:16:28,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:16:28,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:16:28,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:16:28,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:16:28,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:16:28,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:16:28,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:16:28,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:16:28,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:16:28,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:16:28,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:16:28,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:16:28,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:16:28,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:16:28,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:16:28,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:16:28,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:16:28,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:16:28,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:16:28,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:16:28,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:16:28,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:16:28,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:16:28,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:16:28,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:16:28,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:16:28,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:16:28,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:16:28,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:16:28,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:16:28,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:16:28,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:16:28,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:16:28,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:16:28,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:16:28,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:16:28,797 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-VariableLbe.epf [2019-12-27 06:16:28,811 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:16:28,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:16:28,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:16:28,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:16:28,813 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:16:28,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:16:28,814 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:16:28,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:16:28,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:16:28,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:16:28,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:16:28,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:16:28,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:16:28,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:16:28,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:16:28,815 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:16:28,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:16:28,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:16:28,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:16:28,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:16:28,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:16:28,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:16:28,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:16:28,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:16:28,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:16:28,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:16:28,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:16:28,818 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:16:28,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:16:28,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:16:29,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:16:29,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:16:29,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:16:29,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:16:29,101 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:16:29,102 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i [2019-12-27 06:16:29,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5eee713a/c31f7a2be5d64ad18d18747c8aa01bf1/FLAG899edbdee [2019-12-27 06:16:29,762 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:16:29,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_rmo.opt.i [2019-12-27 06:16:29,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5eee713a/c31f7a2be5d64ad18d18747c8aa01bf1/FLAG899edbdee [2019-12-27 06:16:30,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5eee713a/c31f7a2be5d64ad18d18747c8aa01bf1 [2019-12-27 06:16:30,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:16:30,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:16:30,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:16:30,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:16:30,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:16:30,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:16:30" (1/1) ... [2019-12-27 06:16:30,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@624acdd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30, skipping insertion in model container [2019-12-27 06:16:30,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:16:30" (1/1) ... [2019-12-27 06:16:30,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:16:30,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:16:30,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:16:30,669 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:16:30,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:16:30,819 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:16:30,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30 WrapperNode [2019-12-27 06:16:30,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:16:30,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:16:30,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:16:30,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:16:30,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30" (1/1) ... [2019-12-27 06:16:30,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30" (1/1) ... [2019-12-27 06:16:30,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:16:30,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:16:30,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:16:30,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:16:30,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30" (1/1) ... [2019-12-27 06:16:30,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30" (1/1) ... [2019-12-27 06:16:30,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30" (1/1) ... [2019-12-27 06:16:30,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30" (1/1) ... [2019-12-27 06:16:30,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30" (1/1) ... [2019-12-27 06:16:30,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30" (1/1) ... [2019-12-27 06:16:30,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30" (1/1) ... [2019-12-27 06:16:30,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:16:30,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:16:30,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:16:30,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:16:30,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30" (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 06:16:31,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:16:31,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:16:31,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:16:31,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:16:31,012 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:16:31,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:16:31,012 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:16:31,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:16:31,013 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:16:31,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:16:31,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:16:31,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:16:31,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:16:31,016 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 06:16:31,833 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:16:31,834 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:16:31,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:16:31 BoogieIcfgContainer [2019-12-27 06:16:31,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:16:31,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:16:31,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:16:31,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:16:31,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:16:30" (1/3) ... [2019-12-27 06:16:31,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c84b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:16:31, skipping insertion in model container [2019-12-27 06:16:31,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:16:30" (2/3) ... [2019-12-27 06:16:31,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c84b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:16:31, skipping insertion in model container [2019-12-27 06:16:31,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:16:31" (3/3) ... [2019-12-27 06:16:31,851 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_rmo.opt.i [2019-12-27 06:16:31,862 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:16:31,862 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:16:31,876 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:16:31,877 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:16:31,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,928 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,929 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,972 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,973 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,973 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,973 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,974 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,980 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,980 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,991 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,997 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:31,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:32,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:32,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:32,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:32,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:32,004 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:32,004 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:32,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:32,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:32,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:32,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:16:32,022 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:16:32,044 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:16:32,045 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:16:32,045 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:16:32,045 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:16:32,045 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:16:32,045 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:16:32,045 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:16:32,045 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:16:32,065 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 06:16:32,067 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 06:16:32,162 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 06:16:32,162 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:16:32,178 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:16:32,202 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 06:16:32,253 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 06:16:32,254 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:16:32,262 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:16:32,281 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 06:16:32,283 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:16:35,751 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 06:16:35,892 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 06:16:36,049 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-12-27 06:16:36,086 INFO L206 etLargeBlockEncoding]: Checked pairs total: 71962 [2019-12-27 06:16:36,086 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 06:16:36,089 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 96 transitions [2019-12-27 06:16:50,843 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 101822 states. [2019-12-27 06:16:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 101822 states. [2019-12-27 06:16:50,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 06:16:50,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:50,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 06:16:50,853 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:50,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:50,861 INFO L82 PathProgramCache]: Analyzing trace with hash 797474839, now seen corresponding path program 1 times [2019-12-27 06:16:50,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:50,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190189258] [2019-12-27 06:16:50,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:51,144 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 06:16:51,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190189258] [2019-12-27 06:16:51,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:51,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:16:51,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281635467] [2019-12-27 06:16:51,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:16:51,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:51,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:16:51,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:16:51,171 INFO L87 Difference]: Start difference. First operand 101822 states. Second operand 3 states. [2019-12-27 06:16:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:52,359 INFO L93 Difference]: Finished difference Result 99897 states and 434561 transitions. [2019-12-27 06:16:52,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:16:52,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 06:16:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:55,650 INFO L225 Difference]: With dead ends: 99897 [2019-12-27 06:16:55,650 INFO L226 Difference]: Without dead ends: 94017 [2019-12-27 06:16:55,651 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 06:16:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94017 states. [2019-12-27 06:17:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94017 to 94017. [2019-12-27 06:17:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94017 states. [2019-12-27 06:17:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94017 states to 94017 states and 408465 transitions. [2019-12-27 06:17:06,340 INFO L78 Accepts]: Start accepts. Automaton has 94017 states and 408465 transitions. Word has length 5 [2019-12-27 06:17:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:06,341 INFO L462 AbstractCegarLoop]: Abstraction has 94017 states and 408465 transitions. [2019-12-27 06:17:06,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 94017 states and 408465 transitions. [2019-12-27 06:17:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:17:06,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:06,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:06,354 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:06,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:06,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1757025115, now seen corresponding path program 1 times [2019-12-27 06:17:06,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:06,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255756930] [2019-12-27 06:17:06,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:06,452 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 06:17:06,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255756930] [2019-12-27 06:17:06,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:06,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:06,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339830926] [2019-12-27 06:17:06,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:06,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:06,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:06,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:06,457 INFO L87 Difference]: Start difference. First operand 94017 states and 408465 transitions. Second operand 3 states. [2019-12-27 06:17:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:06,653 INFO L93 Difference]: Finished difference Result 23899 states and 83357 transitions. [2019-12-27 06:17:06,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:06,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:17:06,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:06,754 INFO L225 Difference]: With dead ends: 23899 [2019-12-27 06:17:06,755 INFO L226 Difference]: Without dead ends: 23899 [2019-12-27 06:17:06,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 06:17:06,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23899 states. [2019-12-27 06:17:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23899 to 23899. [2019-12-27 06:17:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23899 states. [2019-12-27 06:17:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23899 states to 23899 states and 83357 transitions. [2019-12-27 06:17:07,340 INFO L78 Accepts]: Start accepts. Automaton has 23899 states and 83357 transitions. Word has length 13 [2019-12-27 06:17:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:07,341 INFO L462 AbstractCegarLoop]: Abstraction has 23899 states and 83357 transitions. [2019-12-27 06:17:07,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 23899 states and 83357 transitions. [2019-12-27 06:17:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:17:07,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:07,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:07,343 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:07,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:07,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1772800501, now seen corresponding path program 1 times [2019-12-27 06:17:07,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:07,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409984828] [2019-12-27 06:17:07,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:07,434 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 06:17:07,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409984828] [2019-12-27 06:17:07,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:07,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:07,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910277004] [2019-12-27 06:17:07,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:07,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:07,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:07,437 INFO L87 Difference]: Start difference. First operand 23899 states and 83357 transitions. Second operand 4 states. [2019-12-27 06:17:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:07,824 INFO L93 Difference]: Finished difference Result 35061 states and 117944 transitions. [2019-12-27 06:17:07,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:07,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:17:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:07,927 INFO L225 Difference]: With dead ends: 35061 [2019-12-27 06:17:07,928 INFO L226 Difference]: Without dead ends: 35047 [2019-12-27 06:17:07,928 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 06:17:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35047 states. [2019-12-27 06:17:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35047 to 31443. [2019-12-27 06:17:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31443 states. [2019-12-27 06:17:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31443 states to 31443 states and 107008 transitions. [2019-12-27 06:17:09,597 INFO L78 Accepts]: Start accepts. Automaton has 31443 states and 107008 transitions. Word has length 13 [2019-12-27 06:17:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:09,597 INFO L462 AbstractCegarLoop]: Abstraction has 31443 states and 107008 transitions. [2019-12-27 06:17:09,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 31443 states and 107008 transitions. [2019-12-27 06:17:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:17:09,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:09,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:09,600 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:09,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:09,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1424057850, now seen corresponding path program 1 times [2019-12-27 06:17:09,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:09,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181519548] [2019-12-27 06:17:09,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:09,674 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 06:17:09,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181519548] [2019-12-27 06:17:09,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:09,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:09,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806607660] [2019-12-27 06:17:09,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:09,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:09,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:09,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:09,681 INFO L87 Difference]: Start difference. First operand 31443 states and 107008 transitions. Second operand 5 states. [2019-12-27 06:17:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:10,195 INFO L93 Difference]: Finished difference Result 45557 states and 152262 transitions. [2019-12-27 06:17:10,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:17:10,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 06:17:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:10,300 INFO L225 Difference]: With dead ends: 45557 [2019-12-27 06:17:10,300 INFO L226 Difference]: Without dead ends: 45539 [2019-12-27 06:17:10,301 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 06:17:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45539 states. [2019-12-27 06:17:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45539 to 37201. [2019-12-27 06:17:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37201 states. [2019-12-27 06:17:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37201 states to 37201 states and 125618 transitions. [2019-12-27 06:17:11,940 INFO L78 Accepts]: Start accepts. Automaton has 37201 states and 125618 transitions. Word has length 14 [2019-12-27 06:17:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:11,941 INFO L462 AbstractCegarLoop]: Abstraction has 37201 states and 125618 transitions. [2019-12-27 06:17:11,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 37201 states and 125618 transitions. [2019-12-27 06:17:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:17:11,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:11,954 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 06:17:11,954 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:11,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:11,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1169616424, now seen corresponding path program 1 times [2019-12-27 06:17:11,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:11,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085753695] [2019-12-27 06:17:11,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:12,035 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 06:17:12,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085753695] [2019-12-27 06:17:12,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:12,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:17:12,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750471835] [2019-12-27 06:17:12,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:17:12,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:17:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:17:12,037 INFO L87 Difference]: Start difference. First operand 37201 states and 125618 transitions. Second operand 6 states. [2019-12-27 06:17:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:12,885 INFO L93 Difference]: Finished difference Result 55837 states and 184006 transitions. [2019-12-27 06:17:12,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:12,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:17:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:12,992 INFO L225 Difference]: With dead ends: 55837 [2019-12-27 06:17:12,992 INFO L226 Difference]: Without dead ends: 55807 [2019-12-27 06:17:12,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:17:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55807 states. [2019-12-27 06:17:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55807 to 37101. [2019-12-27 06:17:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37101 states. [2019-12-27 06:17:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37101 states to 37101 states and 124278 transitions. [2019-12-27 06:17:14,393 INFO L78 Accepts]: Start accepts. Automaton has 37101 states and 124278 transitions. Word has length 22 [2019-12-27 06:17:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:14,394 INFO L462 AbstractCegarLoop]: Abstraction has 37101 states and 124278 transitions. [2019-12-27 06:17:14,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:17:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 37101 states and 124278 transitions. [2019-12-27 06:17:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:17:14,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:14,413 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 06:17:14,413 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:14,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash 189468664, now seen corresponding path program 1 times [2019-12-27 06:17:14,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:14,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189740677] [2019-12-27 06:17:14,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:14,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189740677] [2019-12-27 06:17:14,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:14,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:14,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853241679] [2019-12-27 06:17:14,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:14,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:14,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:14,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:14,472 INFO L87 Difference]: Start difference. First operand 37101 states and 124278 transitions. Second operand 4 states. [2019-12-27 06:17:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:14,562 INFO L93 Difference]: Finished difference Result 14221 states and 44268 transitions. [2019-12-27 06:17:14,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:17:14,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:17:14,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:14,585 INFO L225 Difference]: With dead ends: 14221 [2019-12-27 06:17:14,586 INFO L226 Difference]: Without dead ends: 14221 [2019-12-27 06:17:14,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14221 states. [2019-12-27 06:17:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14221 to 14021. [2019-12-27 06:17:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14021 states. [2019-12-27 06:17:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14021 states to 14021 states and 43688 transitions. [2019-12-27 06:17:15,258 INFO L78 Accepts]: Start accepts. Automaton has 14021 states and 43688 transitions. Word has length 25 [2019-12-27 06:17:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:15,259 INFO L462 AbstractCegarLoop]: Abstraction has 14021 states and 43688 transitions. [2019-12-27 06:17:15,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:15,259 INFO L276 IsEmpty]: Start isEmpty. Operand 14021 states and 43688 transitions. [2019-12-27 06:17:15,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:17:15,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:15,281 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 06:17:15,281 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:15,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:15,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1050743486, now seen corresponding path program 1 times [2019-12-27 06:17:15,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:15,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131473184] [2019-12-27 06:17:15,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:15,413 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 06:17:15,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131473184] [2019-12-27 06:17:15,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:15,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:17:15,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331936682] [2019-12-27 06:17:15,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:15,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:15,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:15,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:15,415 INFO L87 Difference]: Start difference. First operand 14021 states and 43688 transitions. Second operand 5 states. [2019-12-27 06:17:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:16,021 INFO L93 Difference]: Finished difference Result 19890 states and 61352 transitions. [2019-12-27 06:17:16,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:17:16,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 06:17:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:16,061 INFO L225 Difference]: With dead ends: 19890 [2019-12-27 06:17:16,061 INFO L226 Difference]: Without dead ends: 19890 [2019-12-27 06:17:16,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:17:16,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19890 states. [2019-12-27 06:17:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19890 to 18261. [2019-12-27 06:17:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18261 states. [2019-12-27 06:17:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18261 states to 18261 states and 56751 transitions. [2019-12-27 06:17:16,405 INFO L78 Accepts]: Start accepts. Automaton has 18261 states and 56751 transitions. Word has length 39 [2019-12-27 06:17:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:16,406 INFO L462 AbstractCegarLoop]: Abstraction has 18261 states and 56751 transitions. [2019-12-27 06:17:16,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 18261 states and 56751 transitions. [2019-12-27 06:17:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:17:16,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:16,435 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 06:17:16,435 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:16,435 INFO L82 PathProgramCache]: Analyzing trace with hash -92841788, now seen corresponding path program 2 times [2019-12-27 06:17:16,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:16,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444934666] [2019-12-27 06:17:16,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:16,536 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 06:17:16,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444934666] [2019-12-27 06:17:16,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:16,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:16,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347566293] [2019-12-27 06:17:16,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:17:16,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:16,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:17:16,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:17:16,539 INFO L87 Difference]: Start difference. First operand 18261 states and 56751 transitions. Second operand 6 states. [2019-12-27 06:17:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:17,403 INFO L93 Difference]: Finished difference Result 32726 states and 101592 transitions. [2019-12-27 06:17:17,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:17:17,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 06:17:17,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:17,452 INFO L225 Difference]: With dead ends: 32726 [2019-12-27 06:17:17,452 INFO L226 Difference]: Without dead ends: 32726 [2019-12-27 06:17:17,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32726 states. [2019-12-27 06:17:17,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32726 to 20467. [2019-12-27 06:17:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20467 states. [2019-12-27 06:17:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20467 states to 20467 states and 63850 transitions. [2019-12-27 06:17:18,022 INFO L78 Accepts]: Start accepts. Automaton has 20467 states and 63850 transitions. Word has length 39 [2019-12-27 06:17:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:18,022 INFO L462 AbstractCegarLoop]: Abstraction has 20467 states and 63850 transitions. [2019-12-27 06:17:18,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:17:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 20467 states and 63850 transitions. [2019-12-27 06:17:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:17:18,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:18,052 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 06:17:18,052 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:18,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1162424668, now seen corresponding path program 3 times [2019-12-27 06:17:18,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:18,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84368518] [2019-12-27 06:17:18,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:18,144 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 06:17:18,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84368518] [2019-12-27 06:17:18,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:18,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:17:18,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229382997] [2019-12-27 06:17:18,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:17:18,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:18,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:17:18,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:18,147 INFO L87 Difference]: Start difference. First operand 20467 states and 63850 transitions. Second operand 5 states. [2019-12-27 06:17:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:18,256 INFO L93 Difference]: Finished difference Result 18971 states and 59972 transitions. [2019-12-27 06:17:18,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:17:18,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 06:17:18,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:18,298 INFO L225 Difference]: With dead ends: 18971 [2019-12-27 06:17:18,298 INFO L226 Difference]: Without dead ends: 18971 [2019-12-27 06:17:18,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:17:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18971 states. [2019-12-27 06:17:18,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18971 to 18185. [2019-12-27 06:17:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18185 states. [2019-12-27 06:17:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18185 states to 18185 states and 57762 transitions. [2019-12-27 06:17:18,605 INFO L78 Accepts]: Start accepts. Automaton has 18185 states and 57762 transitions. Word has length 39 [2019-12-27 06:17:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:18,605 INFO L462 AbstractCegarLoop]: Abstraction has 18185 states and 57762 transitions. [2019-12-27 06:17:18,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:17:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 18185 states and 57762 transitions. [2019-12-27 06:17:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:17:18,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:18,626 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] [2019-12-27 06:17:18,626 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:18,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1617433659, now seen corresponding path program 1 times [2019-12-27 06:17:18,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:18,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004551531] [2019-12-27 06:17:18,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:18,711 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 06:17:18,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004551531] [2019-12-27 06:17:18,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:18,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:18,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377573902] [2019-12-27 06:17:18,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:18,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:18,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:18,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:18,714 INFO L87 Difference]: Start difference. First operand 18185 states and 57762 transitions. Second operand 3 states. [2019-12-27 06:17:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:18,839 INFO L93 Difference]: Finished difference Result 24317 states and 75679 transitions. [2019-12-27 06:17:18,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:18,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 06:17:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:18,883 INFO L225 Difference]: With dead ends: 24317 [2019-12-27 06:17:18,883 INFO L226 Difference]: Without dead ends: 24317 [2019-12-27 06:17:18,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:18,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24317 states. [2019-12-27 06:17:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24317 to 19363. [2019-12-27 06:17:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19363 states. [2019-12-27 06:17:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19363 states to 19363 states and 61167 transitions. [2019-12-27 06:17:19,204 INFO L78 Accepts]: Start accepts. Automaton has 19363 states and 61167 transitions. Word has length 54 [2019-12-27 06:17:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:19,204 INFO L462 AbstractCegarLoop]: Abstraction has 19363 states and 61167 transitions. [2019-12-27 06:17:19,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 19363 states and 61167 transitions. [2019-12-27 06:17:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:17:19,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:19,225 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] [2019-12-27 06:17:19,226 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:19,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:19,226 INFO L82 PathProgramCache]: Analyzing trace with hash -832875013, now seen corresponding path program 1 times [2019-12-27 06:17:19,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:19,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922500497] [2019-12-27 06:17:19,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:19,292 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 06:17:19,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922500497] [2019-12-27 06:17:19,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:19,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:19,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860768068] [2019-12-27 06:17:19,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:17:19,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:19,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:17:19,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:17:19,294 INFO L87 Difference]: Start difference. First operand 19363 states and 61167 transitions. Second operand 4 states. [2019-12-27 06:17:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:19,395 INFO L93 Difference]: Finished difference Result 34927 states and 110486 transitions. [2019-12-27 06:17:19,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:17:19,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 06:17:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:19,568 INFO L225 Difference]: With dead ends: 34927 [2019-12-27 06:17:19,568 INFO L226 Difference]: Without dead ends: 16145 [2019-12-27 06:17:19,568 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 06:17:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16145 states. [2019-12-27 06:17:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16145 to 16145. [2019-12-27 06:17:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16145 states. [2019-12-27 06:17:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16145 states to 16145 states and 50929 transitions. [2019-12-27 06:17:19,786 INFO L78 Accepts]: Start accepts. Automaton has 16145 states and 50929 transitions. Word has length 54 [2019-12-27 06:17:19,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:19,786 INFO L462 AbstractCegarLoop]: Abstraction has 16145 states and 50929 transitions. [2019-12-27 06:17:19,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:17:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16145 states and 50929 transitions. [2019-12-27 06:17:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:17:19,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:19,808 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] [2019-12-27 06:17:19,809 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:19,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1073450609, now seen corresponding path program 2 times [2019-12-27 06:17:19,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:19,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479355740] [2019-12-27 06:17:19,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:19,898 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 06:17:19,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479355740] [2019-12-27 06:17:19,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:19,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:19,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686829878] [2019-12-27 06:17:19,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:19,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:19,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:19,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:19,900 INFO L87 Difference]: Start difference. First operand 16145 states and 50929 transitions. Second operand 7 states. [2019-12-27 06:17:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:20,449 INFO L93 Difference]: Finished difference Result 43496 states and 135672 transitions. [2019-12-27 06:17:20,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:20,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 06:17:20,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:20,535 INFO L225 Difference]: With dead ends: 43496 [2019-12-27 06:17:20,535 INFO L226 Difference]: Without dead ends: 32844 [2019-12-27 06:17:20,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:17:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32844 states. [2019-12-27 06:17:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32844 to 19560. [2019-12-27 06:17:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19560 states. [2019-12-27 06:17:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19560 states to 19560 states and 61621 transitions. [2019-12-27 06:17:21,174 INFO L78 Accepts]: Start accepts. Automaton has 19560 states and 61621 transitions. Word has length 54 [2019-12-27 06:17:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:21,174 INFO L462 AbstractCegarLoop]: Abstraction has 19560 states and 61621 transitions. [2019-12-27 06:17:21,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 19560 states and 61621 transitions. [2019-12-27 06:17:21,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:17:21,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:21,209 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] [2019-12-27 06:17:21,209 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:21,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:21,210 INFO L82 PathProgramCache]: Analyzing trace with hash -345609331, now seen corresponding path program 3 times [2019-12-27 06:17:21,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:21,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012283047] [2019-12-27 06:17:21,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:21,290 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 06:17:21,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012283047] [2019-12-27 06:17:21,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:21,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:21,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592575843] [2019-12-27 06:17:21,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:21,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:21,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:21,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:21,292 INFO L87 Difference]: Start difference. First operand 19560 states and 61621 transitions. Second operand 7 states. [2019-12-27 06:17:21,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:21,767 INFO L93 Difference]: Finished difference Result 48152 states and 148272 transitions. [2019-12-27 06:17:21,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:17:21,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 06:17:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:21,816 INFO L225 Difference]: With dead ends: 48152 [2019-12-27 06:17:21,817 INFO L226 Difference]: Without dead ends: 34286 [2019-12-27 06:17:21,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:17:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34286 states. [2019-12-27 06:17:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34286 to 22798. [2019-12-27 06:17:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22798 states. [2019-12-27 06:17:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22798 states to 22798 states and 71472 transitions. [2019-12-27 06:17:22,449 INFO L78 Accepts]: Start accepts. Automaton has 22798 states and 71472 transitions. Word has length 54 [2019-12-27 06:17:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:22,449 INFO L462 AbstractCegarLoop]: Abstraction has 22798 states and 71472 transitions. [2019-12-27 06:17:22,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 22798 states and 71472 transitions. [2019-12-27 06:17:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:17:22,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:22,479 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] [2019-12-27 06:17:22,479 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:22,479 INFO L82 PathProgramCache]: Analyzing trace with hash -682045085, now seen corresponding path program 4 times [2019-12-27 06:17:22,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:22,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334942289] [2019-12-27 06:17:22,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:22,557 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 06:17:22,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334942289] [2019-12-27 06:17:22,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:22,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:17:22,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366476145] [2019-12-27 06:17:22,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:22,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:22,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:22,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:22,560 INFO L87 Difference]: Start difference. First operand 22798 states and 71472 transitions. Second operand 7 states. [2019-12-27 06:17:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:22,998 INFO L93 Difference]: Finished difference Result 41097 states and 125805 transitions. [2019-12-27 06:17:22,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:17:22,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 06:17:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:23,054 INFO L225 Difference]: With dead ends: 41097 [2019-12-27 06:17:23,054 INFO L226 Difference]: Without dead ends: 38547 [2019-12-27 06:17:23,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:17:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38547 states. [2019-12-27 06:17:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38547 to 22943. [2019-12-27 06:17:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22943 states. [2019-12-27 06:17:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22943 states to 22943 states and 71970 transitions. [2019-12-27 06:17:23,515 INFO L78 Accepts]: Start accepts. Automaton has 22943 states and 71970 transitions. Word has length 54 [2019-12-27 06:17:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:23,515 INFO L462 AbstractCegarLoop]: Abstraction has 22943 states and 71970 transitions. [2019-12-27 06:17:23,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 22943 states and 71970 transitions. [2019-12-27 06:17:23,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:17:23,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:23,538 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] [2019-12-27 06:17:23,539 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:23,539 INFO L82 PathProgramCache]: Analyzing trace with hash -997212989, now seen corresponding path program 1 times [2019-12-27 06:17:23,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:23,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442478202] [2019-12-27 06:17:23,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:23,596 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 06:17:23,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442478202] [2019-12-27 06:17:23,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:23,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:17:23,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32917564] [2019-12-27 06:17:23,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:23,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:23,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:23,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:23,598 INFO L87 Difference]: Start difference. First operand 22943 states and 71970 transitions. Second operand 3 states. [2019-12-27 06:17:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:23,720 INFO L93 Difference]: Finished difference Result 24479 states and 73946 transitions. [2019-12-27 06:17:23,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:23,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 06:17:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:23,754 INFO L225 Difference]: With dead ends: 24479 [2019-12-27 06:17:23,754 INFO L226 Difference]: Without dead ends: 24479 [2019-12-27 06:17:23,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:23,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24479 states. [2019-12-27 06:17:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24479 to 22943. [2019-12-27 06:17:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22943 states. [2019-12-27 06:17:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22943 states to 22943 states and 69456 transitions. [2019-12-27 06:17:24,251 INFO L78 Accepts]: Start accepts. Automaton has 22943 states and 69456 transitions. Word has length 54 [2019-12-27 06:17:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:24,251 INFO L462 AbstractCegarLoop]: Abstraction has 22943 states and 69456 transitions. [2019-12-27 06:17:24,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 22943 states and 69456 transitions. [2019-12-27 06:17:24,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:17:24,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:24,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:24,273 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:24,273 INFO L82 PathProgramCache]: Analyzing trace with hash -693885685, now seen corresponding path program 5 times [2019-12-27 06:17:24,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:24,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408150590] [2019-12-27 06:17:24,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:24,332 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 06:17:24,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408150590] [2019-12-27 06:17:24,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:24,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:24,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508739775] [2019-12-27 06:17:24,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:24,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:24,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:24,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:24,334 INFO L87 Difference]: Start difference. First operand 22943 states and 69456 transitions. Second operand 3 states. [2019-12-27 06:17:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:24,409 INFO L93 Difference]: Finished difference Result 16662 states and 49749 transitions. [2019-12-27 06:17:24,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:24,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 06:17:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:24,438 INFO L225 Difference]: With dead ends: 16662 [2019-12-27 06:17:24,439 INFO L226 Difference]: Without dead ends: 16662 [2019-12-27 06:17:24,439 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 06:17:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16662 states. [2019-12-27 06:17:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16662 to 15964. [2019-12-27 06:17:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15964 states. [2019-12-27 06:17:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15964 states to 15964 states and 47652 transitions. [2019-12-27 06:17:24,674 INFO L78 Accepts]: Start accepts. Automaton has 15964 states and 47652 transitions. Word has length 54 [2019-12-27 06:17:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:24,674 INFO L462 AbstractCegarLoop]: Abstraction has 15964 states and 47652 transitions. [2019-12-27 06:17:24,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:24,674 INFO L276 IsEmpty]: Start isEmpty. Operand 15964 states and 47652 transitions. [2019-12-27 06:17:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:17:24,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:24,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] [2019-12-27 06:17:24,689 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:24,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:24,689 INFO L82 PathProgramCache]: Analyzing trace with hash 673645833, now seen corresponding path program 1 times [2019-12-27 06:17:24,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:24,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978279708] [2019-12-27 06:17:24,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:24,791 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 06:17:24,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978279708] [2019-12-27 06:17:24,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:24,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:17:24,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439783196] [2019-12-27 06:17:24,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:17:24,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:24,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:17:24,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:17:24,793 INFO L87 Difference]: Start difference. First operand 15964 states and 47652 transitions. Second operand 9 states. [2019-12-27 06:17:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:26,206 INFO L93 Difference]: Finished difference Result 29348 states and 87177 transitions. [2019-12-27 06:17:26,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:17:26,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 06:17:26,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:26,237 INFO L225 Difference]: With dead ends: 29348 [2019-12-27 06:17:26,238 INFO L226 Difference]: Without dead ends: 23194 [2019-12-27 06:17:26,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:17:26,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23194 states. [2019-12-27 06:17:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23194 to 16410. [2019-12-27 06:17:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16410 states. [2019-12-27 06:17:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16410 states to 16410 states and 48555 transitions. [2019-12-27 06:17:26,510 INFO L78 Accepts]: Start accepts. Automaton has 16410 states and 48555 transitions. Word has length 55 [2019-12-27 06:17:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:26,510 INFO L462 AbstractCegarLoop]: Abstraction has 16410 states and 48555 transitions. [2019-12-27 06:17:26,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:17:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 16410 states and 48555 transitions. [2019-12-27 06:17:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:17:26,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:26,525 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] [2019-12-27 06:17:26,525 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:26,526 INFO L82 PathProgramCache]: Analyzing trace with hash 483812939, now seen corresponding path program 2 times [2019-12-27 06:17:26,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:26,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411133552] [2019-12-27 06:17:26,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:26,678 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 06:17:26,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411133552] [2019-12-27 06:17:26,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:26,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:17:26,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501520493] [2019-12-27 06:17:26,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:17:26,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:26,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:17:26,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:17:26,683 INFO L87 Difference]: Start difference. First operand 16410 states and 48555 transitions. Second operand 10 states. [2019-12-27 06:17:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:29,628 INFO L93 Difference]: Finished difference Result 32071 states and 91773 transitions. [2019-12-27 06:17:29,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 06:17:29,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 06:17:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:29,671 INFO L225 Difference]: With dead ends: 32071 [2019-12-27 06:17:29,671 INFO L226 Difference]: Without dead ends: 31867 [2019-12-27 06:17:29,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 06:17:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31867 states. [2019-12-27 06:17:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31867 to 17335. [2019-12-27 06:17:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17335 states. [2019-12-27 06:17:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17335 states to 17335 states and 51139 transitions. [2019-12-27 06:17:30,021 INFO L78 Accepts]: Start accepts. Automaton has 17335 states and 51139 transitions. Word has length 55 [2019-12-27 06:17:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:30,021 INFO L462 AbstractCegarLoop]: Abstraction has 17335 states and 51139 transitions. [2019-12-27 06:17:30,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:17:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 17335 states and 51139 transitions. [2019-12-27 06:17:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:17:30,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:30,038 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] [2019-12-27 06:17:30,038 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1194468433, now seen corresponding path program 3 times [2019-12-27 06:17:30,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:30,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75420650] [2019-12-27 06:17:30,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:30,246 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 06:17:30,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75420650] [2019-12-27 06:17:30,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:30,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:17:30,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749695595] [2019-12-27 06:17:30,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:17:30,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:30,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:17:30,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:17:30,249 INFO L87 Difference]: Start difference. First operand 17335 states and 51139 transitions. Second operand 11 states. [2019-12-27 06:17:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:31,364 INFO L93 Difference]: Finished difference Result 33682 states and 98855 transitions. [2019-12-27 06:17:31,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 06:17:31,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 06:17:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:31,412 INFO L225 Difference]: With dead ends: 33682 [2019-12-27 06:17:31,413 INFO L226 Difference]: Without dead ends: 32592 [2019-12-27 06:17:31,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 06:17:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32592 states. [2019-12-27 06:17:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32592 to 20028. [2019-12-27 06:17:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20028 states. [2019-12-27 06:17:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20028 states to 20028 states and 58694 transitions. [2019-12-27 06:17:32,046 INFO L78 Accepts]: Start accepts. Automaton has 20028 states and 58694 transitions. Word has length 55 [2019-12-27 06:17:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:32,046 INFO L462 AbstractCegarLoop]: Abstraction has 20028 states and 58694 transitions. [2019-12-27 06:17:32,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:17:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 20028 states and 58694 transitions. [2019-12-27 06:17:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:17:32,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:32,065 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] [2019-12-27 06:17:32,065 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:32,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash -687114287, now seen corresponding path program 4 times [2019-12-27 06:17:32,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:32,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348504852] [2019-12-27 06:17:32,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:32,219 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 06:17:32,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348504852] [2019-12-27 06:17:32,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:32,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:17:32,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391213634] [2019-12-27 06:17:32,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:17:32,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:32,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:17:32,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:17:32,221 INFO L87 Difference]: Start difference. First operand 20028 states and 58694 transitions. Second operand 11 states. [2019-12-27 06:17:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:33,361 INFO L93 Difference]: Finished difference Result 33086 states and 96245 transitions. [2019-12-27 06:17:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:17:33,363 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 06:17:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:33,408 INFO L225 Difference]: With dead ends: 33086 [2019-12-27 06:17:33,408 INFO L226 Difference]: Without dead ends: 26314 [2019-12-27 06:17:33,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:17:33,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26314 states. [2019-12-27 06:17:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26314 to 16352. [2019-12-27 06:17:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16352 states. [2019-12-27 06:17:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16352 states to 16352 states and 48262 transitions. [2019-12-27 06:17:33,731 INFO L78 Accepts]: Start accepts. Automaton has 16352 states and 48262 transitions. Word has length 55 [2019-12-27 06:17:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:33,732 INFO L462 AbstractCegarLoop]: Abstraction has 16352 states and 48262 transitions. [2019-12-27 06:17:33,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:17:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 16352 states and 48262 transitions. [2019-12-27 06:17:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:17:33,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:33,749 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] [2019-12-27 06:17:33,749 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:33,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:33,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1007470025, now seen corresponding path program 5 times [2019-12-27 06:17:33,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:33,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826823933] [2019-12-27 06:17:33,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:33,866 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 06:17:33,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826823933] [2019-12-27 06:17:33,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:33,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:17:33,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624858392] [2019-12-27 06:17:33,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:17:33,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:33,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:17:33,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:17:33,870 INFO L87 Difference]: Start difference. First operand 16352 states and 48262 transitions. Second operand 7 states. [2019-12-27 06:17:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:34,938 INFO L93 Difference]: Finished difference Result 24450 states and 70548 transitions. [2019-12-27 06:17:34,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:17:34,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 06:17:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:34,972 INFO L225 Difference]: With dead ends: 24450 [2019-12-27 06:17:34,972 INFO L226 Difference]: Without dead ends: 24450 [2019-12-27 06:17:34,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:17:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24450 states. [2019-12-27 06:17:35,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24450 to 16402. [2019-12-27 06:17:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16402 states. [2019-12-27 06:17:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16402 states to 16402 states and 48379 transitions. [2019-12-27 06:17:35,258 INFO L78 Accepts]: Start accepts. Automaton has 16402 states and 48379 transitions. Word has length 55 [2019-12-27 06:17:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:35,258 INFO L462 AbstractCegarLoop]: Abstraction has 16402 states and 48379 transitions. [2019-12-27 06:17:35,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:17:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 16402 states and 48379 transitions. [2019-12-27 06:17:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:17:35,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:35,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:17:35,273 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:35,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:35,274 INFO L82 PathProgramCache]: Analyzing trace with hash -171833141, now seen corresponding path program 6 times [2019-12-27 06:17:35,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:35,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686855456] [2019-12-27 06:17:35,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:35,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 06:17:35,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686855456] [2019-12-27 06:17:35,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:35,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:17:35,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261883156] [2019-12-27 06:17:35,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:17:35,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:35,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:17:35,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:17:35,331 INFO L87 Difference]: Start difference. First operand 16402 states and 48379 transitions. Second operand 3 states. [2019-12-27 06:17:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:35,396 INFO L93 Difference]: Finished difference Result 16400 states and 48374 transitions. [2019-12-27 06:17:35,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:17:35,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:17:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:35,420 INFO L225 Difference]: With dead ends: 16400 [2019-12-27 06:17:35,420 INFO L226 Difference]: Without dead ends: 16400 [2019-12-27 06:17:35,420 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 06:17:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16400 states. [2019-12-27 06:17:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16400 to 13129. [2019-12-27 06:17:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13129 states. [2019-12-27 06:17:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13129 states to 13129 states and 39378 transitions. [2019-12-27 06:17:35,790 INFO L78 Accepts]: Start accepts. Automaton has 13129 states and 39378 transitions. Word has length 55 [2019-12-27 06:17:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:35,790 INFO L462 AbstractCegarLoop]: Abstraction has 13129 states and 39378 transitions. [2019-12-27 06:17:35,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:17:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 13129 states and 39378 transitions. [2019-12-27 06:17:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:17:35,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:35,808 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] [2019-12-27 06:17:35,808 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:35,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1213693398, now seen corresponding path program 1 times [2019-12-27 06:17:35,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:35,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094496055] [2019-12-27 06:17:35,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:17:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:17:36,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094496055] [2019-12-27 06:17:36,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:17:36,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 06:17:36,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581543061] [2019-12-27 06:17:36,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 06:17:36,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:17:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 06:17:36,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 06:17:36,248 INFO L87 Difference]: Start difference. First operand 13129 states and 39378 transitions. Second operand 16 states. [2019-12-27 06:17:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:17:39,457 INFO L93 Difference]: Finished difference Result 23076 states and 68082 transitions. [2019-12-27 06:17:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 06:17:39,457 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 06:17:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:17:39,489 INFO L225 Difference]: With dead ends: 23076 [2019-12-27 06:17:39,490 INFO L226 Difference]: Without dead ends: 22738 [2019-12-27 06:17:39,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=439, Invalid=2111, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 06:17:39,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22738 states. [2019-12-27 06:17:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22738 to 12983. [2019-12-27 06:17:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12983 states. [2019-12-27 06:17:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12983 states to 12983 states and 39034 transitions. [2019-12-27 06:17:39,752 INFO L78 Accepts]: Start accepts. Automaton has 12983 states and 39034 transitions. Word has length 56 [2019-12-27 06:17:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:17:39,752 INFO L462 AbstractCegarLoop]: Abstraction has 12983 states and 39034 transitions. [2019-12-27 06:17:39,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 06:17:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 12983 states and 39034 transitions. [2019-12-27 06:17:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:17:39,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:17:39,767 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] [2019-12-27 06:17:39,767 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:17:39,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:17:39,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1135634574, now seen corresponding path program 2 times [2019-12-27 06:17:39,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:17:39,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824901234] [2019-12-27 06:17:39,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:17:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:17:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:17:39,913 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:17:39,913 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:17:39,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L828: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t928~0.base_21| 4)) (= 0 v_~a~0_9) (= v_~x$r_buff1_thd2~0_17 0) (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start_main_~#t928~0.offset_16| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t928~0.base_21|) (= v_~x$w_buff1_used~0_63 0) (= v_~x$r_buff1_thd0~0_17 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff1~0_25) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~x$r_buff0_thd0~0_20) (= v_~x~0_24 0) (= v_~main$tmp_guard0~0_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~z~0_7) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_39 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice0~0_7) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$r_buff0_thd1~0_71) (= v_~x$mem_tmp~0_10 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21| 1)) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= 0 v_~x$w_buff0_used~0_109) (= |v_#NULL.offset_4| 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t928~0.base_21|)) (= v_~y~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t928~0.base_21|) |v_ULTIMATE.start_main_~#t928~0.offset_16| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice2~0_31) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~a~0=v_~a~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_15|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_63, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t928~0.offset=|v_ULTIMATE.start_main_~#t928~0.offset_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_24, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_17, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t928~0.base=|v_ULTIMATE.start_main_~#t928~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_7, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t929~0.offset, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t929~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t930~0.offset, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t928~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t930~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t928~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 06:17:39,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L828-1-->L830: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t929~0.base_13| 1) |v_#valid_36|) (= |v_ULTIMATE.start_main_~#t929~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t929~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t929~0.base_13|) |v_ULTIMATE.start_main_~#t929~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t929~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t929~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t929~0.offset=|v_ULTIMATE.start_main_~#t929~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t929~0.base=|v_ULTIMATE.start_main_~#t929~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t929~0.offset, #length, ULTIMATE.start_main_~#t929~0.base] because there is no mapped edge [2019-12-27 06:17:39,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L830-1-->L832: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t930~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t930~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t930~0.base_13|) |v_ULTIMATE.start_main_~#t930~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t930~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t930~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t930~0.offset=|v_ULTIMATE.start_main_~#t930~0.offset_11|, ULTIMATE.start_main_~#t930~0.base=|v_ULTIMATE.start_main_~#t930~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t930~0.offset, ULTIMATE.start_main_~#t930~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 06:17:39,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] P1ENTRY-->L5-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_~x$w_buff0~0_16 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 v_~x$w_buff0~0_15)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 06:17:39,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In344112400 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In344112400 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite32_Out344112400| ~x~0_In344112400) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite32_Out344112400| ~x$w_buff1~0_In344112400) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In344112400, ~x$w_buff1_used~0=~x$w_buff1_used~0_In344112400, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In344112400, ~x~0=~x~0_In344112400} OutVars{P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out344112400|, ~x$w_buff1~0=~x$w_buff1~0_In344112400, ~x$w_buff1_used~0=~x$w_buff1_used~0_In344112400, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In344112400, ~x~0=~x~0_In344112400} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 06:17:39,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1263891225 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1263891225 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1263891225 |P1Thread1of1ForFork1_#t~ite28_Out-1263891225|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1263891225|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1263891225, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1263891225} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1263891225, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1263891225|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1263891225} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 06:17:39,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L805-4-->L806: Formula: (= |v_P2Thread1of1ForFork2_#t~ite32_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|} OutVars{P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~x~0] because there is no mapped edge [2019-12-27 06:17:39,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In341846368 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In341846368 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite34_Out341846368| ~x$w_buff0_used~0_In341846368) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite34_Out341846368| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In341846368, ~x$w_buff0_used~0=~x$w_buff0_used~0_In341846368} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out341846368|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In341846368, ~x$w_buff0_used~0=~x$w_buff0_used~0_In341846368} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 06:17:39,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In688973412 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In688973412 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In688973412 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In688973412 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite35_Out688973412| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite35_Out688973412| ~x$w_buff1_used~0_In688973412)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In688973412, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In688973412, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In688973412, ~x$w_buff0_used~0=~x$w_buff0_used~0_In688973412} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out688973412|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In688973412, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In688973412, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In688973412, ~x$w_buff0_used~0=~x$w_buff0_used~0_In688973412} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 06:17:39,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-1118711849 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1118711849 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1118711849 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1118711849 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-1118711849|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-1118711849 |P1Thread1of1ForFork1_#t~ite29_Out-1118711849|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1118711849, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1118711849, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1118711849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1118711849} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1118711849|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1118711849, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1118711849, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1118711849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1118711849} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 06:17:39,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L782-->L783: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1148064115 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1148064115 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1148064115) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1148064115 ~x$r_buff0_thd2~0_Out1148064115)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1148064115, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1148064115} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1148064115|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1148064115, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1148064115} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 06:17:39,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In219037047 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In219037047 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In219037047 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In219037047 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out219037047| ~x$r_buff1_thd2~0_In219037047) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out219037047|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In219037047, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In219037047, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In219037047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In219037047} OutVars{P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out219037047|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In219037047, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In219037047, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In219037047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In219037047} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 06:17:39,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:17:39,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In846647843 256) 0))) (or (and (= ~x$w_buff1~0_In846647843 |P0Thread1of1ForFork0_#t~ite12_Out846647843|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_In846647843| |P0Thread1of1ForFork0_#t~ite11_Out846647843|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In846647843 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In846647843 256)) .cse1) (= (mod ~x$w_buff0_used~0_In846647843 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In846647843 256)) .cse1))) .cse0 (= |P0Thread1of1ForFork0_#t~ite12_Out846647843| |P0Thread1of1ForFork0_#t~ite11_Out846647843|) (= ~x$w_buff1~0_In846647843 |P0Thread1of1ForFork0_#t~ite11_Out846647843|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In846647843|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In846647843, ~x$w_buff1~0=~x$w_buff1~0_In846647843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In846647843, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In846647843, ~weak$$choice2~0=~weak$$choice2~0_In846647843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In846647843} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out846647843|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In846647843, ~x$w_buff1~0=~x$w_buff1~0_In846647843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In846647843, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In846647843, ~weak$$choice2~0=~weak$$choice2~0_In846647843, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out846647843|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In846647843} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 06:17:39,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L746-->L746-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In527464842 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In527464842 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In527464842 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In527464842 256) 0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In527464842 256))))) (= |P0Thread1of1ForFork0_#t~ite15_Out527464842| |P0Thread1of1ForFork0_#t~ite14_Out527464842|) (= ~x$w_buff0_used~0_In527464842 |P0Thread1of1ForFork0_#t~ite14_Out527464842|) .cse1) (and (= |P0Thread1of1ForFork0_#t~ite15_Out527464842| ~x$w_buff0_used~0_In527464842) (= |P0Thread1of1ForFork0_#t~ite14_In527464842| |P0Thread1of1ForFork0_#t~ite14_Out527464842|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In527464842, ~x$w_buff1_used~0=~x$w_buff1_used~0_In527464842, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In527464842, ~weak$$choice2~0=~weak$$choice2~0_In527464842, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_In527464842|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527464842} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In527464842, ~x$w_buff1_used~0=~x$w_buff1_used~0_In527464842, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In527464842, P0Thread1of1ForFork0_#t~ite15=|P0Thread1of1ForFork0_#t~ite15_Out527464842|, ~weak$$choice2~0=~weak$$choice2~0_In527464842, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out527464842|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527464842} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite15, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 06:17:39,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L748-->L749: Formula: (and (= v_~x$r_buff0_thd1~0_45 v_~x$r_buff0_thd1~0_44) (not (= (mod v_~weak$$choice2~0_19 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_45, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_7|, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite20, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 06:17:39,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L751-->L759: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~x$mem_tmp~0_5 v_~x~0_19) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 06:17:39,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1728807459 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1728807459 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite36_Out1728807459|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In1728807459 |P2Thread1of1ForFork2_#t~ite36_Out1728807459|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1728807459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1728807459} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out1728807459|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1728807459, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1728807459} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 06:17:39,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2060523821 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In2060523821 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In2060523821 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In2060523821 256) 0))) (or (and (= ~x$r_buff1_thd3~0_In2060523821 |P2Thread1of1ForFork2_#t~ite37_Out2060523821|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out2060523821|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2060523821, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2060523821, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2060523821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2060523821} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out2060523821|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2060523821, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2060523821, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2060523821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2060523821} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 06:17:39,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~x$r_buff1_thd3~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 06:17:39,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L838: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:17:39,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L838-2-->L838-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1849890134 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1849890134 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-1849890134| ~x~0_In-1849890134)) (and (= ~x$w_buff1~0_In-1849890134 |ULTIMATE.start_main_#t~ite41_Out-1849890134|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1849890134, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1849890134, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1849890134, ~x~0=~x~0_In-1849890134} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1849890134|, ~x$w_buff1~0=~x$w_buff1~0_In-1849890134, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1849890134, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1849890134, ~x~0=~x~0_In-1849890134} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 06:17:39,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L838-4-->L839: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 06:17:39,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In355797570 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In355797570 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out355797570| ~x$w_buff0_used~0_In355797570) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out355797570| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In355797570, ~x$w_buff0_used~0=~x$w_buff0_used~0_In355797570} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In355797570, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out355797570|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In355797570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 06:17:39,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L840-->L840-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In2116716077 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In2116716077 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2116716077 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In2116716077 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out2116716077|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In2116716077 |ULTIMATE.start_main_#t~ite44_Out2116716077|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2116716077, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2116716077, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2116716077, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2116716077} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2116716077, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2116716077, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2116716077, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2116716077|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2116716077} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:17:39,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-45079864 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-45079864 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-45079864 |ULTIMATE.start_main_#t~ite45_Out-45079864|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-45079864|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-45079864, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-45079864} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-45079864, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-45079864|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-45079864} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:17:39,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L842-->L842-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In999095827 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In999095827 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In999095827 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In999095827 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In999095827 |ULTIMATE.start_main_#t~ite46_Out999095827|)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out999095827|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In999095827, ~x$w_buff1_used~0=~x$w_buff1_used~0_In999095827, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In999095827, ~x$w_buff0_used~0=~x$w_buff0_used~0_In999095827} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In999095827, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out999095827|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In999095827, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In999095827, ~x$w_buff0_used~0=~x$w_buff0_used~0_In999095827} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 06:17:39,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L842-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_15 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite46_10|) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p2_EBX~0_8 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:17:40,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:17:40 BasicIcfg [2019-12-27 06:17:40,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:17:40,056 INFO L168 Benchmark]: Toolchain (without parser) took 69992.33 ms. Allocated memory was 145.8 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 100.4 MB in the beginning and 746.9 MB in the end (delta: -646.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 06:17:40,057 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:17:40,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.90 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 157.4 MB in the end (delta: -57.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:17:40,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.57 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:17:40,059 INFO L168 Benchmark]: Boogie Preprocessor took 37.15 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:17:40,059 INFO L168 Benchmark]: RCFGBuilder took 911.45 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 105.8 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:17:40,060 INFO L168 Benchmark]: TraceAbstraction took 68216.84 ms. Allocated memory was 203.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 105.1 MB in the beginning and 746.9 MB in the end (delta: -641.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 06:17:40,063 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.19 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.90 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 157.4 MB in the end (delta: -57.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.57 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.15 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 911.45 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 105.8 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 68216.84 ms. Allocated memory was 203.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 105.1 MB in the beginning and 746.9 MB in the end (delta: -641.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 166 ProgramPointsBefore, 86 ProgramPointsAfterwards, 197 TransitionsBefore, 96 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 6251 VarBasedMoverChecksPositive, 206 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 71962 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L828] FCALL, FORK 0 pthread_create(&t928, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t929, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t930, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L770] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L771] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L772] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L773] 2 x$r_buff0_thd2 = (_Bool)1 [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L793] 3 y = 1 [L796] 3 z = 1 [L799] 3 __unbuffered_p2_EAX = z [L802] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L806] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L736] 1 a = 1 [L739] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L740] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L741] 1 x$flush_delayed = weak$$choice2 [L742] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L744] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L745] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L746] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L747] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L838] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L840] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L841] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 67.8s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5196 SDtfs, 6400 SDslu, 17937 SDs, 0 SdLazy, 10623 SolverSat, 302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 48 SyntacticMatches, 15 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101822occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 158002 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1029 NumberOfCodeBlocks, 1029 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 950 ConstructedInterpolants, 0 QuantifiedInterpolants, 166816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...