/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:54:42,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:54:42,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:54:42,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:54:42,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:54:42,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:54:42,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:54:42,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:54:42,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:54:42,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:54:42,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:54:42,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:54:42,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:54:42,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:54:42,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:54:42,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:54:42,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:54:42,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:54:42,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:54:42,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:54:42,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:54:42,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:54:42,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:54:42,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:54:42,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:54:42,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:54:42,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:54:42,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:54:42,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:54:42,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:54:42,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:54:42,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:54:42,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:54:42,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:54:42,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:54:42,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:54:42,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:54:42,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:54:42,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:54:42,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:54:42,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:54:42,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:54:42,825 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:54:42,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:54:42,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:54:42,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:54:42,827 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:54:42,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:54:42,828 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:54:42,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:54:42,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:54:42,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:54:42,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:54:42,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:54:42,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:54:42,831 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:54:42,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:54:42,832 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:54:42,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:54:42,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:54:42,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:54:42,834 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:54:42,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:54:42,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:54:42,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:54:42,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:54:42,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:54:42,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:54:42,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:54:42,836 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:54:42,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:54:42,836 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:54:42,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:54:43,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:54:43,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:54:43,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:54:43,115 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:54:43,116 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:54:43,117 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i [2019-12-27 16:54:43,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cac17b3/c950f7f16720412c93c73552fc8e65cf/FLAG1df813ae7 [2019-12-27 16:54:43,739 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:54:43,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc.i [2019-12-27 16:54:43,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cac17b3/c950f7f16720412c93c73552fc8e65cf/FLAG1df813ae7 [2019-12-27 16:54:44,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cac17b3/c950f7f16720412c93c73552fc8e65cf [2019-12-27 16:54:44,051 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:54:44,053 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:54:44,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:54:44,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:54:44,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:54:44,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:54:44" (1/1) ... [2019-12-27 16:54:44,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44, skipping insertion in model container [2019-12-27 16:54:44,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:54:44" (1/1) ... [2019-12-27 16:54:44,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:54:44,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:54:44,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:54:44,678 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:54:44,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:54:44,828 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:54:44,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44 WrapperNode [2019-12-27 16:54:44,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:54:44,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:54:44,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:54:44,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:54:44,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44" (1/1) ... [2019-12-27 16:54:44,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44" (1/1) ... [2019-12-27 16:54:44,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:54:44,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:54:44,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:54:44,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:54:44,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44" (1/1) ... [2019-12-27 16:54:44,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44" (1/1) ... [2019-12-27 16:54:44,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44" (1/1) ... [2019-12-27 16:54:44,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44" (1/1) ... [2019-12-27 16:54:44,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44" (1/1) ... [2019-12-27 16:54:44,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44" (1/1) ... [2019-12-27 16:54:44,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44" (1/1) ... [2019-12-27 16:54:44,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:54:44,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:54:44,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:54:44,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:54:44,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44" (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 16:54:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:54:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:54:45,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:54:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:54:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:54:45,008 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:54:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:54:45,008 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:54:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:54:45,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:54:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:54:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:54:45,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:54:45,011 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 16:54:45,787 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:54:45,788 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:54:45,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:54:45 BoogieIcfgContainer [2019-12-27 16:54:45,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:54:45,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:54:45,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:54:45,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:54:45,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:54:44" (1/3) ... [2019-12-27 16:54:45,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54549d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:54:45, skipping insertion in model container [2019-12-27 16:54:45,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:44" (2/3) ... [2019-12-27 16:54:45,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54549d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:54:45, skipping insertion in model container [2019-12-27 16:54:45,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:54:45" (3/3) ... [2019-12-27 16:54:45,798 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc.i [2019-12-27 16:54:45,809 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:54:45,809 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:54:45,817 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:54:45,818 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:54:45,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,872 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,873 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,884 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,884 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,911 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,911 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,938 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,948 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,949 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,949 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,955 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,955 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:45,980 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:54:46,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:54:46,001 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:54:46,001 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:54:46,001 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:54:46,001 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:54:46,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:54:46,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:54:46,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:54:46,019 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 16:54:46,021 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 16:54:46,127 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 16:54:46,128 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:54:46,144 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:54:46,169 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 16:54:46,224 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 16:54:46,225 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:54:46,233 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:54:46,254 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:54:46,255 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:54:51,799 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 16:54:51,905 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 16:54:52,218 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 16:54:52,349 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 16:54:52,378 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-27 16:54:52,379 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 16:54:52,382 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-27 16:55:06,714 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-27 16:55:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-27 16:55:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:55:06,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:06,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:55:06,722 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:06,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:06,727 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-27 16:55:06,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:06,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101889082] [2019-12-27 16:55:06,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:06,971 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 16:55:06,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101889082] [2019-12-27 16:55:06,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:06,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:55:06,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2064499047] [2019-12-27 16:55:06,977 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:06,981 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:06,991 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:55:06,991 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:06,995 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:55:06,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:55:06,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:07,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:55:07,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:55:07,008 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-27 16:55:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:09,210 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-27 16:55:09,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:55:09,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:55:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:09,786 INFO L225 Difference]: With dead ends: 101544 [2019-12-27 16:55:09,787 INFO L226 Difference]: Without dead ends: 95304 [2019-12-27 16:55:09,790 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 16:55:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-27 16:55:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-27 16:55:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-27 16:55:20,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-27 16:55:20,836 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-27 16:55:20,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:20,837 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-27 16:55:20,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:55:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-27 16:55:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:55:20,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:20,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:55:20,841 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:20,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:20,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-27 16:55:20,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:20,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708671598] [2019-12-27 16:55:20,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:21,000 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 16:55:21,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708671598] [2019-12-27 16:55:21,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:21,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:55:21,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1957193184] [2019-12-27 16:55:21,002 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:21,003 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:21,006 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:55:21,007 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:21,007 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:55:21,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:55:21,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:21,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:55:21,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:55:21,010 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-27 16:55:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:25,686 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-27 16:55:25,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:55:25,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:55:25,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:26,211 INFO L225 Difference]: With dead ends: 152040 [2019-12-27 16:55:26,211 INFO L226 Difference]: Without dead ends: 151991 [2019-12-27 16:55:26,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:55:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-27 16:55:34,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-27 16:55:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-27 16:55:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-27 16:55:34,884 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-27 16:55:34,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:34,884 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-27 16:55:34,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:55:34,885 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-27 16:55:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:55:34,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:34,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:55:34,893 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:34,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:34,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-27 16:55:34,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:34,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525342122] [2019-12-27 16:55:34,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:34,961 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 16:55:34,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525342122] [2019-12-27 16:55:34,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:34,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:55:34,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1427121571] [2019-12-27 16:55:34,963 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:34,964 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:34,966 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:55:34,966 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:34,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:55:34,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:55:34,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:34,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:55:34,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:55:34,968 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-27 16:55:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:35,121 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-27 16:55:35,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:55:35,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:55:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:35,208 INFO L225 Difference]: With dead ends: 30915 [2019-12-27 16:55:35,208 INFO L226 Difference]: Without dead ends: 30915 [2019-12-27 16:55:35,209 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 16:55:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-27 16:55:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-27 16:55:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-27 16:55:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-27 16:55:40,663 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-27 16:55:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:40,664 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-27 16:55:40,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:55:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-27 16:55:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:55:40,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:40,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:55:40,667 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:40,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:40,668 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-27 16:55:40,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:40,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492002239] [2019-12-27 16:55:40,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:40,765 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 16:55:40,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492002239] [2019-12-27 16:55:40,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:40,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:55:40,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1134410806] [2019-12-27 16:55:40,767 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:40,769 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:40,772 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:55:40,772 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:40,772 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:55:40,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:55:40,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:40,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:55:40,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:55:40,774 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-27 16:55:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:41,122 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-27 16:55:41,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:55:41,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:55:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:41,197 INFO L225 Difference]: With dead ends: 38538 [2019-12-27 16:55:41,197 INFO L226 Difference]: Without dead ends: 38538 [2019-12-27 16:55:41,198 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 16:55:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-27 16:55:41,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-27 16:55:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-27 16:55:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-27 16:55:41,965 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-27 16:55:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:41,966 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-27 16:55:41,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:55:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-27 16:55:41,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:55:41,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:41,976 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 16:55:41,976 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:41,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-27 16:55:41,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:41,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253994857] [2019-12-27 16:55:41,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:42,122 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 16:55:42,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253994857] [2019-12-27 16:55:42,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:42,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:55:42,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1971607033] [2019-12-27 16:55:42,123 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:42,127 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:42,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:55:42,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:42,258 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:55:42,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:55:42,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:42,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:55:42,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:55:42,259 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 7 states. [2019-12-27 16:55:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:43,655 INFO L93 Difference]: Finished difference Result 52978 states and 168667 transitions. [2019-12-27 16:55:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:55:43,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 16:55:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:43,748 INFO L225 Difference]: With dead ends: 52978 [2019-12-27 16:55:43,748 INFO L226 Difference]: Without dead ends: 52971 [2019-12-27 16:55:43,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:55:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52971 states. [2019-12-27 16:55:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52971 to 34062. [2019-12-27 16:55:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-27 16:55:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-27 16:55:44,455 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-27 16:55:44,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:44,455 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-27 16:55:44,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:55:44,455 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-27 16:55:44,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:55:44,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:44,468 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 16:55:44,468 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:44,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:44,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-27 16:55:44,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:44,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286943746] [2019-12-27 16:55:44,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:55:44,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286943746] [2019-12-27 16:55:44,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:44,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:55:44,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [706014800] [2019-12-27 16:55:44,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:44,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:44,545 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:55:44,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:44,559 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:55:44,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:55:44,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:44,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:55:44,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:55:44,560 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 5 states. [2019-12-27 16:55:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:44,651 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-27 16:55:44,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:55:44,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:55:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:44,672 INFO L225 Difference]: With dead ends: 13768 [2019-12-27 16:55:44,672 INFO L226 Difference]: Without dead ends: 13768 [2019-12-27 16:55:44,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:55:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-27 16:55:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-27 16:55:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-27 16:55:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-27 16:55:44,879 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-27 16:55:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:44,879 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-27 16:55:44,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:55:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-27 16:55:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:55:44,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:44,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:55:44,891 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:44,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:44,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-27 16:55:44,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:44,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218830723] [2019-12-27 16:55:44,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:44,941 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 16:55:44,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218830723] [2019-12-27 16:55:44,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:44,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:55:44,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459102338] [2019-12-27 16:55:44,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:44,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:44,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:55:44,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:44,954 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:55:44,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:55:44,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:44,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:55:44,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:55:44,955 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-27 16:55:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:45,043 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-27 16:55:45,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:55:45,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:55:45,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:45,171 INFO L225 Difference]: With dead ends: 19309 [2019-12-27 16:55:45,171 INFO L226 Difference]: Without dead ends: 19309 [2019-12-27 16:55:45,172 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 16:55:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-27 16:55:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-27 16:55:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-27 16:55:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-27 16:55:45,414 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-27 16:55:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:45,414 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-27 16:55:45,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:55:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-27 16:55:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:55:45,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:45,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:55:45,425 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:45,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:45,425 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-27 16:55:45,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:45,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931106989] [2019-12-27 16:55:45,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:45,466 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 16:55:45,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931106989] [2019-12-27 16:55:45,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:45,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:55:45,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [732248251] [2019-12-27 16:55:45,467 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:45,472 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:45,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:55:45,480 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:45,480 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:55:45,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:55:45,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:45,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:55:45,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:55:45,481 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-27 16:55:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:45,579 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-27 16:55:45,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:55:45,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:55:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:45,610 INFO L225 Difference]: With dead ends: 21037 [2019-12-27 16:55:45,610 INFO L226 Difference]: Without dead ends: 21037 [2019-12-27 16:55:45,613 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 16:55:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-27 16:55:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-27 16:55:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-27 16:55:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-27 16:55:45,904 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-27 16:55:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:45,904 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-27 16:55:45,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:55:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-27 16:55:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:55:45,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:45,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:55:45,920 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:45,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:45,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-27 16:55:45,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:45,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866873524] [2019-12-27 16:55:45,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:46,049 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 16:55:46,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866873524] [2019-12-27 16:55:46,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:46,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:55:46,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1340029382] [2019-12-27 16:55:46,055 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:46,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:46,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:55:46,066 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:46,066 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:55:46,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:55:46,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:46,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:55:46,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:55:46,067 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-27 16:55:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:46,703 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-27 16:55:46,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:55:46,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:55:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:46,746 INFO L225 Difference]: With dead ends: 29609 [2019-12-27 16:55:46,746 INFO L226 Difference]: Without dead ends: 29609 [2019-12-27 16:55:46,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:55:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-27 16:55:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-27 16:55:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-27 16:55:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-27 16:55:47,099 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-27 16:55:47,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:47,100 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-27 16:55:47,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:55:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-27 16:55:47,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:55:47,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:47,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:55:47,113 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:47,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:47,113 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-27 16:55:47,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:47,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349198030] [2019-12-27 16:55:47,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:55:47,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349198030] [2019-12-27 16:55:47,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:47,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:55:47,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1463055873] [2019-12-27 16:55:47,216 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:47,221 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:47,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 16:55:47,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:47,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:55:47,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:55:47,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:47,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:55:47,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:55:47,231 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-27 16:55:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:47,551 INFO L93 Difference]: Finished difference Result 24115 states and 70824 transitions. [2019-12-27 16:55:47,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:55:47,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:55:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:47,599 INFO L225 Difference]: With dead ends: 24115 [2019-12-27 16:55:47,599 INFO L226 Difference]: Without dead ends: 24115 [2019-12-27 16:55:47,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:55:47,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24115 states. [2019-12-27 16:55:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24115 to 18741. [2019-12-27 16:55:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18741 states. [2019-12-27 16:55:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18741 states to 18741 states and 55737 transitions. [2019-12-27 16:55:47,994 INFO L78 Accepts]: Start accepts. Automaton has 18741 states and 55737 transitions. Word has length 28 [2019-12-27 16:55:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:47,994 INFO L462 AbstractCegarLoop]: Abstraction has 18741 states and 55737 transitions. [2019-12-27 16:55:47,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:55:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 18741 states and 55737 transitions. [2019-12-27 16:55:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 16:55:48,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:48,009 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] [2019-12-27 16:55:48,009 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:48,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash -408172822, now seen corresponding path program 1 times [2019-12-27 16:55:48,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:48,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308551290] [2019-12-27 16:55:48,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:48,118 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 16:55:48,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308551290] [2019-12-27 16:55:48,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:48,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:55:48,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1038305234] [2019-12-27 16:55:48,119 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:48,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:48,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 29 transitions. [2019-12-27 16:55:48,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:48,133 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:55:48,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:55:48,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:48,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:55:48,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:55:48,134 INFO L87 Difference]: Start difference. First operand 18741 states and 55737 transitions. Second operand 6 states. [2019-12-27 16:55:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:48,830 INFO L93 Difference]: Finished difference Result 28968 states and 84735 transitions. [2019-12-27 16:55:48,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:55:48,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 16:55:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:48,870 INFO L225 Difference]: With dead ends: 28968 [2019-12-27 16:55:48,870 INFO L226 Difference]: Without dead ends: 28968 [2019-12-27 16:55:48,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:55:48,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-27 16:55:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18685. [2019-12-27 16:55:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18685 states. [2019-12-27 16:55:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18685 states to 18685 states and 55547 transitions. [2019-12-27 16:55:49,224 INFO L78 Accepts]: Start accepts. Automaton has 18685 states and 55547 transitions. Word has length 29 [2019-12-27 16:55:49,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:49,225 INFO L462 AbstractCegarLoop]: Abstraction has 18685 states and 55547 transitions. [2019-12-27 16:55:49,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:55:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 18685 states and 55547 transitions. [2019-12-27 16:55:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:55:49,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:49,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:55:49,244 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-27 16:55:49,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:49,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908036513] [2019-12-27 16:55:49,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:49,408 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 16:55:49,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908036513] [2019-12-27 16:55:49,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:49,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:55:49,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1777936175] [2019-12-27 16:55:49,409 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:49,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:49,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:55:49,429 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:49,578 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:55:49,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:55:49,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:49,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:55:49,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:55:49,579 INFO L87 Difference]: Start difference. First operand 18685 states and 55547 transitions. Second operand 9 states. [2019-12-27 16:55:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:52,450 INFO L93 Difference]: Finished difference Result 52157 states and 152575 transitions. [2019-12-27 16:55:52,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 16:55:52,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 16:55:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:52,526 INFO L225 Difference]: With dead ends: 52157 [2019-12-27 16:55:52,526 INFO L226 Difference]: Without dead ends: 52157 [2019-12-27 16:55:52,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:55:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52157 states. [2019-12-27 16:55:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52157 to 20762. [2019-12-27 16:55:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20762 states. [2019-12-27 16:55:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20762 states to 20762 states and 61715 transitions. [2019-12-27 16:55:53,072 INFO L78 Accepts]: Start accepts. Automaton has 20762 states and 61715 transitions. Word has length 33 [2019-12-27 16:55:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:53,072 INFO L462 AbstractCegarLoop]: Abstraction has 20762 states and 61715 transitions. [2019-12-27 16:55:53,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:55:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 20762 states and 61715 transitions. [2019-12-27 16:55:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:55:53,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:53,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:55:53,092 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:53,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:53,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-27 16:55:53,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:53,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050936015] [2019-12-27 16:55:53,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:53,243 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 16:55:53,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050936015] [2019-12-27 16:55:53,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:53,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:55:53,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781725142] [2019-12-27 16:55:53,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:53,250 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:53,263 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 16:55:53,263 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:53,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:55:53,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:55:53,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:55:53,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:53,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:55:53,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:55:53,297 INFO L87 Difference]: Start difference. First operand 20762 states and 61715 transitions. Second operand 9 states. [2019-12-27 16:55:55,896 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-12-27 16:55:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:56,923 INFO L93 Difference]: Finished difference Result 61814 states and 177500 transitions. [2019-12-27 16:55:56,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 16:55:56,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 16:55:56,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:57,026 INFO L225 Difference]: With dead ends: 61814 [2019-12-27 16:55:57,026 INFO L226 Difference]: Without dead ends: 61814 [2019-12-27 16:55:57,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 16:55:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61814 states. [2019-12-27 16:55:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61814 to 23128. [2019-12-27 16:55:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23128 states. [2019-12-27 16:55:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23128 states to 23128 states and 68713 transitions. [2019-12-27 16:55:57,652 INFO L78 Accepts]: Start accepts. Automaton has 23128 states and 68713 transitions. Word has length 33 [2019-12-27 16:55:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:57,652 INFO L462 AbstractCegarLoop]: Abstraction has 23128 states and 68713 transitions. [2019-12-27 16:55:57,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:55:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 23128 states and 68713 transitions. [2019-12-27 16:55:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 16:55:57,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:57,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:55:57,672 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:57,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:57,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1684348162, now seen corresponding path program 1 times [2019-12-27 16:55:57,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:57,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341336168] [2019-12-27 16:55:57,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:57,790 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 16:55:57,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341336168] [2019-12-27 16:55:57,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:57,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:55:57,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1249914881] [2019-12-27 16:55:57,791 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:57,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:57,816 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 63 transitions. [2019-12-27 16:55:57,816 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:57,957 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:55:57,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:55:57,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:57,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:55:57,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:55:57,958 INFO L87 Difference]: Start difference. First operand 23128 states and 68713 transitions. Second operand 9 states. [2019-12-27 16:56:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:00,152 INFO L93 Difference]: Finished difference Result 47036 states and 138172 transitions. [2019-12-27 16:56:00,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 16:56:00,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-27 16:56:00,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:00,407 INFO L225 Difference]: With dead ends: 47036 [2019-12-27 16:56:00,407 INFO L226 Difference]: Without dead ends: 47036 [2019-12-27 16:56:00,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:56:00,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47036 states. [2019-12-27 16:56:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47036 to 22057. [2019-12-27 16:56:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22057 states. [2019-12-27 16:56:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22057 states to 22057 states and 65651 transitions. [2019-12-27 16:56:00,900 INFO L78 Accepts]: Start accepts. Automaton has 22057 states and 65651 transitions. Word has length 35 [2019-12-27 16:56:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:00,900 INFO L462 AbstractCegarLoop]: Abstraction has 22057 states and 65651 transitions. [2019-12-27 16:56:00,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:56:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 22057 states and 65651 transitions. [2019-12-27 16:56:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 16:56:00,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:00,925 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] [2019-12-27 16:56:00,925 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:00,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:00,926 INFO L82 PathProgramCache]: Analyzing trace with hash -480848370, now seen corresponding path program 2 times [2019-12-27 16:56:00,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:00,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241068997] [2019-12-27 16:56:00,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:56:01,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241068997] [2019-12-27 16:56:01,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:01,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:56:01,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [397919864] [2019-12-27 16:56:01,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:01,261 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:01,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 57 transitions. [2019-12-27 16:56:01,280 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:01,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:56:01,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:56:01,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:56:01,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:01,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:56:01,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:56:01,312 INFO L87 Difference]: Start difference. First operand 22057 states and 65651 transitions. Second operand 12 states. [2019-12-27 16:56:04,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:04,824 INFO L93 Difference]: Finished difference Result 55516 states and 160250 transitions. [2019-12-27 16:56:04,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 16:56:04,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-12-27 16:56:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:04,903 INFO L225 Difference]: With dead ends: 55516 [2019-12-27 16:56:04,903 INFO L226 Difference]: Without dead ends: 55516 [2019-12-27 16:56:04,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2019-12-27 16:56:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55516 states. [2019-12-27 16:56:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55516 to 21512. [2019-12-27 16:56:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21512 states. [2019-12-27 16:56:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21512 states to 21512 states and 64043 transitions. [2019-12-27 16:56:05,684 INFO L78 Accepts]: Start accepts. Automaton has 21512 states and 64043 transitions. Word has length 35 [2019-12-27 16:56:05,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:05,685 INFO L462 AbstractCegarLoop]: Abstraction has 21512 states and 64043 transitions. [2019-12-27 16:56:05,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:56:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 21512 states and 64043 transitions. [2019-12-27 16:56:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 16:56:05,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:05,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:05,715 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:05,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:05,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1086264592, now seen corresponding path program 3 times [2019-12-27 16:56:05,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:05,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576444740] [2019-12-27 16:56:05,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:05,994 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 16:56:05,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576444740] [2019-12-27 16:56:05,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:05,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:56:05,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1685412076] [2019-12-27 16:56:05,995 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:06,002 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:06,017 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 73 transitions. [2019-12-27 16:56:06,017 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:06,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:56:06,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:56:06,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:56:06,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:56:06,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:56:06,095 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:56:06,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:56:06,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:06,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:56:06,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:56:06,096 INFO L87 Difference]: Start difference. First operand 21512 states and 64043 transitions. Second operand 13 states. [2019-12-27 16:56:11,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:11,151 INFO L93 Difference]: Finished difference Result 45954 states and 133581 transitions. [2019-12-27 16:56:11,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 16:56:11,152 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-12-27 16:56:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:11,216 INFO L225 Difference]: With dead ends: 45954 [2019-12-27 16:56:11,216 INFO L226 Difference]: Without dead ends: 45954 [2019-12-27 16:56:11,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=341, Invalid=1381, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 16:56:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45954 states. [2019-12-27 16:56:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45954 to 21199. [2019-12-27 16:56:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21199 states. [2019-12-27 16:56:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21199 states to 21199 states and 63152 transitions. [2019-12-27 16:56:11,863 INFO L78 Accepts]: Start accepts. Automaton has 21199 states and 63152 transitions. Word has length 35 [2019-12-27 16:56:11,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:11,863 INFO L462 AbstractCegarLoop]: Abstraction has 21199 states and 63152 transitions. [2019-12-27 16:56:11,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:56:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 21199 states and 63152 transitions. [2019-12-27 16:56:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:56:11,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:11,882 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 16:56:11,882 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:11,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1053586821, now seen corresponding path program 1 times [2019-12-27 16:56:11,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:11,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24371252] [2019-12-27 16:56:11,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:11,933 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 16:56:11,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24371252] [2019-12-27 16:56:11,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:11,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:56:11,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1832874172] [2019-12-27 16:56:11,935 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:11,942 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:12,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 379 transitions. [2019-12-27 16:56:12,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:12,009 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:12,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:56:12,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:56:12,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:12,010 INFO L87 Difference]: Start difference. First operand 21199 states and 63152 transitions. Second operand 3 states. [2019-12-27 16:56:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:12,092 INFO L93 Difference]: Finished difference Result 21198 states and 63150 transitions. [2019-12-27 16:56:12,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:56:12,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:56:12,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:12,121 INFO L225 Difference]: With dead ends: 21198 [2019-12-27 16:56:12,121 INFO L226 Difference]: Without dead ends: 21198 [2019-12-27 16:56:12,121 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 16:56:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21198 states. [2019-12-27 16:56:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21198 to 21198. [2019-12-27 16:56:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21198 states. [2019-12-27 16:56:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21198 states to 21198 states and 63150 transitions. [2019-12-27 16:56:12,415 INFO L78 Accepts]: Start accepts. Automaton has 21198 states and 63150 transitions. Word has length 39 [2019-12-27 16:56:12,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:12,415 INFO L462 AbstractCegarLoop]: Abstraction has 21198 states and 63150 transitions. [2019-12-27 16:56:12,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:56:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 21198 states and 63150 transitions. [2019-12-27 16:56:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:56:12,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:12,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:12,434 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 1 times [2019-12-27 16:56:12,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:12,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875481190] [2019-12-27 16:56:12,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:12,486 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 16:56:12,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875481190] [2019-12-27 16:56:12,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:12,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:56:12,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [347172116] [2019-12-27 16:56:12,487 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:12,495 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:12,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 454 transitions. [2019-12-27 16:56:12,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:12,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:56:12,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:56:12,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:12,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:56:12,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:56:12,617 INFO L87 Difference]: Start difference. First operand 21198 states and 63150 transitions. Second operand 7 states. [2019-12-27 16:56:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:12,702 INFO L93 Difference]: Finished difference Result 19856 states and 60107 transitions. [2019-12-27 16:56:12,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:56:12,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:56:12,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:12,729 INFO L225 Difference]: With dead ends: 19856 [2019-12-27 16:56:12,730 INFO L226 Difference]: Without dead ends: 19856 [2019-12-27 16:56:12,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:56:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19856 states. [2019-12-27 16:56:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19856 to 18946. [2019-12-27 16:56:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18946 states. [2019-12-27 16:56:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18946 states to 18946 states and 57654 transitions. [2019-12-27 16:56:13,022 INFO L78 Accepts]: Start accepts. Automaton has 18946 states and 57654 transitions. Word has length 40 [2019-12-27 16:56:13,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:13,022 INFO L462 AbstractCegarLoop]: Abstraction has 18946 states and 57654 transitions. [2019-12-27 16:56:13,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:56:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 18946 states and 57654 transitions. [2019-12-27 16:56:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:56:13,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:13,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:13,041 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:13,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:13,042 INFO L82 PathProgramCache]: Analyzing trace with hash 914424357, now seen corresponding path program 1 times [2019-12-27 16:56:13,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:13,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070103130] [2019-12-27 16:56:13,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:13,171 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 16:56:13,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070103130] [2019-12-27 16:56:13,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:13,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:56:13,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [361075783] [2019-12-27 16:56:13,172 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:13,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:13,503 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 255 states and 489 transitions. [2019-12-27 16:56:13,503 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:13,619 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:56:13,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:56:13,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:13,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:56:13,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:56:13,621 INFO L87 Difference]: Start difference. First operand 18946 states and 57654 transitions. Second operand 11 states. [2019-12-27 16:56:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:17,761 INFO L93 Difference]: Finished difference Result 163666 states and 481274 transitions. [2019-12-27 16:56:17,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 16:56:17,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 16:56:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:18,245 INFO L225 Difference]: With dead ends: 163666 [2019-12-27 16:56:18,245 INFO L226 Difference]: Without dead ends: 121743 [2019-12-27 16:56:18,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=890, Invalid=3666, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 16:56:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121743 states. [2019-12-27 16:56:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121743 to 23057. [2019-12-27 16:56:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23057 states. [2019-12-27 16:56:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23057 states to 23057 states and 70638 transitions. [2019-12-27 16:56:19,293 INFO L78 Accepts]: Start accepts. Automaton has 23057 states and 70638 transitions. Word has length 64 [2019-12-27 16:56:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:19,293 INFO L462 AbstractCegarLoop]: Abstraction has 23057 states and 70638 transitions. [2019-12-27 16:56:19,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:56:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 23057 states and 70638 transitions. [2019-12-27 16:56:19,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:56:19,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:19,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:19,316 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:19,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:19,317 INFO L82 PathProgramCache]: Analyzing trace with hash -466762747, now seen corresponding path program 2 times [2019-12-27 16:56:19,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:19,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575232099] [2019-12-27 16:56:19,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:19,408 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 16:56:19,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575232099] [2019-12-27 16:56:19,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:19,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:56:19,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1576687755] [2019-12-27 16:56:19,409 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:19,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:19,656 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 368 transitions. [2019-12-27 16:56:19,657 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:19,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:56:19,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:56:19,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:19,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:56:19,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:56:19,674 INFO L87 Difference]: Start difference. First operand 23057 states and 70638 transitions. Second operand 8 states. [2019-12-27 16:56:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:21,713 INFO L93 Difference]: Finished difference Result 84881 states and 251863 transitions. [2019-12-27 16:56:21,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:56:21,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 16:56:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:21,807 INFO L225 Difference]: With dead ends: 84881 [2019-12-27 16:56:21,808 INFO L226 Difference]: Without dead ends: 64948 [2019-12-27 16:56:21,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:56:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64948 states. [2019-12-27 16:56:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64948 to 26998. [2019-12-27 16:56:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26998 states. [2019-12-27 16:56:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26998 states to 26998 states and 82238 transitions. [2019-12-27 16:56:22,526 INFO L78 Accepts]: Start accepts. Automaton has 26998 states and 82238 transitions. Word has length 64 [2019-12-27 16:56:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:22,527 INFO L462 AbstractCegarLoop]: Abstraction has 26998 states and 82238 transitions. [2019-12-27 16:56:22,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:56:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 26998 states and 82238 transitions. [2019-12-27 16:56:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:56:22,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:22,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:22,556 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:22,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:22,556 INFO L82 PathProgramCache]: Analyzing trace with hash 849472763, now seen corresponding path program 3 times [2019-12-27 16:56:22,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:22,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983752899] [2019-12-27 16:56:22,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:22,634 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 16:56:22,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983752899] [2019-12-27 16:56:22,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:22,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:56:22,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1987723904] [2019-12-27 16:56:22,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:22,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:22,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 408 transitions. [2019-12-27 16:56:22,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:23,065 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:56:23,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:56:23,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:23,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:56:23,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:56:23,068 INFO L87 Difference]: Start difference. First operand 26998 states and 82238 transitions. Second operand 11 states. [2019-12-27 16:56:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:24,985 INFO L93 Difference]: Finished difference Result 66174 states and 198321 transitions. [2019-12-27 16:56:24,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:56:24,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 16:56:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:25,067 INFO L225 Difference]: With dead ends: 66174 [2019-12-27 16:56:25,068 INFO L226 Difference]: Without dead ends: 56452 [2019-12-27 16:56:25,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:56:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56452 states. [2019-12-27 16:56:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56452 to 27334. [2019-12-27 16:56:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27334 states. [2019-12-27 16:56:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27334 states to 27334 states and 83220 transitions. [2019-12-27 16:56:25,711 INFO L78 Accepts]: Start accepts. Automaton has 27334 states and 83220 transitions. Word has length 64 [2019-12-27 16:56:25,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:25,711 INFO L462 AbstractCegarLoop]: Abstraction has 27334 states and 83220 transitions. [2019-12-27 16:56:25,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:56:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 27334 states and 83220 transitions. [2019-12-27 16:56:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:56:25,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:25,740 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:25,740 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:25,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:25,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1624619189, now seen corresponding path program 4 times [2019-12-27 16:56:25,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:25,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634788613] [2019-12-27 16:56:25,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:25,809 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 16:56:25,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634788613] [2019-12-27 16:56:25,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:25,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:56:25,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [883772454] [2019-12-27 16:56:25,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:25,828 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:25,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 355 transitions. [2019-12-27 16:56:25,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:25,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:56:25,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:56:25,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:25,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:56:25,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:25,978 INFO L87 Difference]: Start difference. First operand 27334 states and 83220 transitions. Second operand 3 states. [2019-12-27 16:56:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:26,046 INFO L93 Difference]: Finished difference Result 20817 states and 62725 transitions. [2019-12-27 16:56:26,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:56:26,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:56:26,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:26,073 INFO L225 Difference]: With dead ends: 20817 [2019-12-27 16:56:26,073 INFO L226 Difference]: Without dead ends: 20817 [2019-12-27 16:56:26,073 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 16:56:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20817 states. [2019-12-27 16:56:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20817 to 19927. [2019-12-27 16:56:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19927 states. [2019-12-27 16:56:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19927 states to 19927 states and 59959 transitions. [2019-12-27 16:56:26,523 INFO L78 Accepts]: Start accepts. Automaton has 19927 states and 59959 transitions. Word has length 64 [2019-12-27 16:56:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:26,523 INFO L462 AbstractCegarLoop]: Abstraction has 19927 states and 59959 transitions. [2019-12-27 16:56:26,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:56:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 19927 states and 59959 transitions. [2019-12-27 16:56:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:56:26,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:26,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:26,543 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:26,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash 995250140, now seen corresponding path program 1 times [2019-12-27 16:56:26,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:26,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583564890] [2019-12-27 16:56:26,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:26,607 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 16:56:26,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583564890] [2019-12-27 16:56:26,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:26,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:56:26,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [502741709] [2019-12-27 16:56:26,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:26,627 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:26,778 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 322 transitions. [2019-12-27 16:56:26,778 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:26,781 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:56:26,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:56:26,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:26,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:56:26,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:56:26,782 INFO L87 Difference]: Start difference. First operand 19927 states and 59959 transitions. Second operand 5 states. [2019-12-27 16:56:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:27,132 INFO L93 Difference]: Finished difference Result 21728 states and 64938 transitions. [2019-12-27 16:56:27,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:56:27,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 16:56:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:27,161 INFO L225 Difference]: With dead ends: 21728 [2019-12-27 16:56:27,162 INFO L226 Difference]: Without dead ends: 21728 [2019-12-27 16:56:27,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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 16:56:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21728 states. [2019-12-27 16:56:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21728 to 20209. [2019-12-27 16:56:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20209 states. [2019-12-27 16:56:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20209 states to 20209 states and 60799 transitions. [2019-12-27 16:56:27,475 INFO L78 Accepts]: Start accepts. Automaton has 20209 states and 60799 transitions. Word has length 65 [2019-12-27 16:56:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:27,475 INFO L462 AbstractCegarLoop]: Abstraction has 20209 states and 60799 transitions. [2019-12-27 16:56:27,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:56:27,475 INFO L276 IsEmpty]: Start isEmpty. Operand 20209 states and 60799 transitions. [2019-12-27 16:56:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:56:27,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:27,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:27,501 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:27,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:27,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1346443158, now seen corresponding path program 2 times [2019-12-27 16:56:27,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:27,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17709029] [2019-12-27 16:56:27,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:27,587 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 16:56:27,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17709029] [2019-12-27 16:56:27,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:27,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:56:27,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58220594] [2019-12-27 16:56:27,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:27,608 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:27,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 333 transitions. [2019-12-27 16:56:27,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:27,843 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:56:27,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:56:27,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:27,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:56:27,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:56:27,844 INFO L87 Difference]: Start difference. First operand 20209 states and 60799 transitions. Second operand 8 states. [2019-12-27 16:56:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:29,324 INFO L93 Difference]: Finished difference Result 56672 states and 166202 transitions. [2019-12-27 16:56:29,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 16:56:29,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 16:56:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:29,401 INFO L225 Difference]: With dead ends: 56672 [2019-12-27 16:56:29,401 INFO L226 Difference]: Without dead ends: 56452 [2019-12-27 16:56:29,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:56:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56452 states. [2019-12-27 16:56:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56452 to 27596. [2019-12-27 16:56:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27596 states. [2019-12-27 16:56:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27596 states to 27596 states and 82629 transitions. [2019-12-27 16:56:30,086 INFO L78 Accepts]: Start accepts. Automaton has 27596 states and 82629 transitions. Word has length 65 [2019-12-27 16:56:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:30,087 INFO L462 AbstractCegarLoop]: Abstraction has 27596 states and 82629 transitions. [2019-12-27 16:56:30,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:56:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 27596 states and 82629 transitions. [2019-12-27 16:56:30,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:56:30,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:30,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:30,130 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:30,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:30,130 INFO L82 PathProgramCache]: Analyzing trace with hash 580016848, now seen corresponding path program 3 times [2019-12-27 16:56:30,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:30,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176250303] [2019-12-27 16:56:30,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:30,205 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 16:56:30,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176250303] [2019-12-27 16:56:30,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:30,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:56:30,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2141577802] [2019-12-27 16:56:30,206 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:30,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:30,423 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 356 transitions. [2019-12-27 16:56:30,423 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:30,454 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 16:56:30,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:56:30,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:56:30,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:56:30,455 INFO L87 Difference]: Start difference. First operand 27596 states and 82629 transitions. Second operand 6 states. [2019-12-27 16:56:30,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:30,843 INFO L93 Difference]: Finished difference Result 29719 states and 88382 transitions. [2019-12-27 16:56:30,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 16:56:30,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 16:56:30,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:30,882 INFO L225 Difference]: With dead ends: 29719 [2019-12-27 16:56:30,882 INFO L226 Difference]: Without dead ends: 29719 [2019-12-27 16:56:30,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:56:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29719 states. [2019-12-27 16:56:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29719 to 27945. [2019-12-27 16:56:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27945 states. [2019-12-27 16:56:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27945 states to 27945 states and 83617 transitions. [2019-12-27 16:56:31,499 INFO L78 Accepts]: Start accepts. Automaton has 27945 states and 83617 transitions. Word has length 65 [2019-12-27 16:56:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:31,499 INFO L462 AbstractCegarLoop]: Abstraction has 27945 states and 83617 transitions. [2019-12-27 16:56:31,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:56:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 27945 states and 83617 transitions. [2019-12-27 16:56:31,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:56:31,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:31,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:31,528 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:31,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:31,528 INFO L82 PathProgramCache]: Analyzing trace with hash -102998324, now seen corresponding path program 4 times [2019-12-27 16:56:31,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:31,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661420272] [2019-12-27 16:56:31,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:31,618 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 16:56:31,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661420272] [2019-12-27 16:56:31,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:31,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:56:31,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [744775360] [2019-12-27 16:56:31,619 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:31,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:31,826 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 358 transitions. [2019-12-27 16:56:31,827 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:31,874 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 16:56:31,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:56:31,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:56:31,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:56:31,876 INFO L87 Difference]: Start difference. First operand 27945 states and 83617 transitions. Second operand 9 states. [2019-12-27 16:56:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:33,389 INFO L93 Difference]: Finished difference Result 58480 states and 171122 transitions. [2019-12-27 16:56:33,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 16:56:33,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 16:56:33,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:33,469 INFO L225 Difference]: With dead ends: 58480 [2019-12-27 16:56:33,469 INFO L226 Difference]: Without dead ends: 58480 [2019-12-27 16:56:33,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:56:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58480 states. [2019-12-27 16:56:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58480 to 27345. [2019-12-27 16:56:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27345 states. [2019-12-27 16:56:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27345 states to 27345 states and 81881 transitions. [2019-12-27 16:56:34,217 INFO L78 Accepts]: Start accepts. Automaton has 27345 states and 81881 transitions. Word has length 65 [2019-12-27 16:56:34,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:34,217 INFO L462 AbstractCegarLoop]: Abstraction has 27345 states and 81881 transitions. [2019-12-27 16:56:34,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:56:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 27345 states and 81881 transitions. [2019-12-27 16:56:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:56:34,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:34,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:34,250 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:34,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:34,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1972220962, now seen corresponding path program 5 times [2019-12-27 16:56:34,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:34,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145227970] [2019-12-27 16:56:34,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:34,753 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 16:56:34,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145227970] [2019-12-27 16:56:34,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:34,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 16:56:34,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [708564061] [2019-12-27 16:56:34,755 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:34,788 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:34,997 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 238 transitions. [2019-12-27 16:56:34,997 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:34,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:56:35,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:56:35,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:56:35,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:56:35,638 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-27 16:56:35,655 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:56:35,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 16:56:35,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:35,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 16:56:35,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:56:35,656 INFO L87 Difference]: Start difference. First operand 27345 states and 81881 transitions. Second operand 20 states. [2019-12-27 16:56:36,495 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-12-27 16:56:38,271 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-12-27 16:56:38,810 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-12-27 16:56:39,542 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-12-27 16:56:39,915 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-12-27 16:56:40,929 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-12-27 16:56:42,055 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-12-27 16:56:42,507 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-12-27 16:56:42,673 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 16:56:45,558 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-12-27 16:56:46,110 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-27 16:56:46,386 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 16:56:47,619 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-12-27 16:56:48,604 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-12-27 16:56:49,215 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-12-27 16:56:49,742 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 16:56:52,862 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-27 16:56:54,082 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-27 16:56:55,357 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-12-27 16:56:55,913 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-12-27 16:56:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:57,771 INFO L93 Difference]: Finished difference Result 127296 states and 365883 transitions. [2019-12-27 16:56:57,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-12-27 16:56:57,772 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2019-12-27 16:56:57,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:57,950 INFO L225 Difference]: With dead ends: 127296 [2019-12-27 16:56:57,950 INFO L226 Difference]: Without dead ends: 127079 [2019-12-27 16:56:57,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6974 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2460, Invalid=15630, Unknown=0, NotChecked=0, Total=18090 [2019-12-27 16:56:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127079 states. [2019-12-27 16:56:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127079 to 30332. [2019-12-27 16:56:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30332 states. [2019-12-27 16:56:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30332 states to 30332 states and 90217 transitions. [2019-12-27 16:56:59,227 INFO L78 Accepts]: Start accepts. Automaton has 30332 states and 90217 transitions. Word has length 65 [2019-12-27 16:56:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:56:59,227 INFO L462 AbstractCegarLoop]: Abstraction has 30332 states and 90217 transitions. [2019-12-27 16:56:59,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 16:56:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 30332 states and 90217 transitions. [2019-12-27 16:56:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:56:59,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:56:59,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:56:59,261 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:56:59,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:56:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1532167548, now seen corresponding path program 6 times [2019-12-27 16:56:59,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:56:59,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470553951] [2019-12-27 16:56:59,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:56:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:56:59,336 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 16:56:59,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470553951] [2019-12-27 16:56:59,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:56:59,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:56:59,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2057643151] [2019-12-27 16:56:59,338 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:56:59,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:56:59,687 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 223 transitions. [2019-12-27 16:56:59,687 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:56:59,688 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:56:59,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:56:59,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:56:59,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:56:59,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:56:59,689 INFO L87 Difference]: Start difference. First operand 30332 states and 90217 transitions. Second operand 3 states. [2019-12-27 16:56:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:56:59,889 INFO L93 Difference]: Finished difference Result 35179 states and 104269 transitions. [2019-12-27 16:56:59,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:56:59,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 16:56:59,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:56:59,965 INFO L225 Difference]: With dead ends: 35179 [2019-12-27 16:56:59,965 INFO L226 Difference]: Without dead ends: 35179 [2019-12-27 16:56:59,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35179 states. [2019-12-27 16:57:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35179 to 30644. [2019-12-27 16:57:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30644 states. [2019-12-27 16:57:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30644 states to 30644 states and 91093 transitions. [2019-12-27 16:57:00,621 INFO L78 Accepts]: Start accepts. Automaton has 30644 states and 91093 transitions. Word has length 65 [2019-12-27 16:57:00,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:00,622 INFO L462 AbstractCegarLoop]: Abstraction has 30644 states and 91093 transitions. [2019-12-27 16:57:00,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:57:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 30644 states and 91093 transitions. [2019-12-27 16:57:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:57:00,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:00,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:00,652 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:00,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:00,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1362331982, now seen corresponding path program 1 times [2019-12-27 16:57:00,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:00,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858015656] [2019-12-27 16:57:00,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:57:00,701 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 16:57:00,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858015656] [2019-12-27 16:57:00,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:57:00,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:57:00,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [515679356] [2019-12-27 16:57:00,702 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:57:00,719 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:57:00,935 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 331 transitions. [2019-12-27 16:57:00,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:57:00,936 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:57:00,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:57:00,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:57:00,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:57:00,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:57:00,937 INFO L87 Difference]: Start difference. First operand 30644 states and 91093 transitions. Second operand 3 states. [2019-12-27 16:57:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:57:01,118 INFO L93 Difference]: Finished difference Result 30644 states and 91092 transitions. [2019-12-27 16:57:01,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:57:01,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:57:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:57:01,187 INFO L225 Difference]: With dead ends: 30644 [2019-12-27 16:57:01,187 INFO L226 Difference]: Without dead ends: 30644 [2019-12-27 16:57:01,188 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 16:57:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30644 states. [2019-12-27 16:57:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30644 to 23107. [2019-12-27 16:57:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23107 states. [2019-12-27 16:57:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23107 states to 23107 states and 69358 transitions. [2019-12-27 16:57:01,829 INFO L78 Accepts]: Start accepts. Automaton has 23107 states and 69358 transitions. Word has length 66 [2019-12-27 16:57:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:57:01,829 INFO L462 AbstractCegarLoop]: Abstraction has 23107 states and 69358 transitions. [2019-12-27 16:57:01,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:57:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 23107 states and 69358 transitions. [2019-12-27 16:57:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:57:01,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:57:01,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:57:01,971 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:57:01,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:57:01,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-27 16:57:01,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:57:01,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957805667] [2019-12-27 16:57:01,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:57:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:57:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:57:02,118 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:57:02,118 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:57:02,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~y~0_33 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1001~0.base_51|)) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1001~0.base_51| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1001~0.base_51|) |v_ULTIMATE.start_main_~#t1001~0.offset_32| 0))) (= v_~main$tmp_guard1~0_50 0) (= 0 v_~a$read_delayed_var~0.base_8) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1001~0.base_51|) (= v_~a$mem_tmp~0_19 0) (= v_~a$r_buff1_thd3~0_279 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= |v_#valid_87| (store .cse0 |v_ULTIMATE.start_main_~#t1001~0.base_51| 1)) (= v_~a$r_buff0_thd3~0_364 0) (= v_~z~0_14 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1001~0.base_51| 4)) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_15) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 |v_#NULL.base_4|) (= 0 |v_ULTIMATE.start_main_~#t1001~0.offset_32|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~a$w_buff1_used~0_506) (= v_~a$r_buff1_thd0~0_160 0) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= v_~a$flush_delayed~0_30 0) (= 0 v_~x~0_130) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~weak$$choice2~0_108 0) (= v_~a~0_163 0) (= v_~__unbuffered_p2_EBX~0_61 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_~#t1002~0.base=|v_ULTIMATE.start_main_~#t1002~0.base_39|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ULTIMATE.start_main_~#t1003~0.offset=|v_ULTIMATE.start_main_~#t1003~0.offset_20|, ~a~0=v_~a~0_163, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_130, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ~a$mem_tmp~0=v_~a$mem_tmp~0_19, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ULTIMATE.start_main_~#t1003~0.base=|v_ULTIMATE.start_main_~#t1003~0.base_28|, ~y~0=v_~y~0_33, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_~#t1001~0.base=|v_ULTIMATE.start_main_~#t1001~0.base_51|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t1002~0.offset=|v_ULTIMATE.start_main_~#t1002~0.offset_19|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t1001~0.offset=|v_ULTIMATE.start_main_~#t1001~0.offset_32|, ~a$flush_delayed~0=v_~a$flush_delayed~0_30, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_14, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_~#t1002~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t1003~0.offset, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t1003~0.base, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1001~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1002~0.offset, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1001~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 16:57:02,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In604872486)) (= 1 ~a$r_buff0_thd1~0_Out604872486) (= ~a$r_buff1_thd3~0_Out604872486 ~a$r_buff0_thd3~0_In604872486) (= ~a$r_buff0_thd2~0_In604872486 ~a$r_buff1_thd2~0_Out604872486) (= ~a$r_buff0_thd0~0_In604872486 ~a$r_buff1_thd0~0_Out604872486) (= ~x~0_Out604872486 1) (= ~a$r_buff1_thd1~0_Out604872486 ~a$r_buff0_thd1~0_In604872486)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In604872486, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In604872486, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In604872486, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In604872486, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In604872486} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out604872486, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out604872486, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out604872486, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out604872486, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In604872486, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In604872486, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In604872486, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out604872486, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In604872486, ~x~0=~x~0_Out604872486} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 16:57:02,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1002~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1002~0.base_9|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1002~0.base_9| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1002~0.base_9|) (= |v_ULTIMATE.start_main_~#t1002~0.offset_7| 0) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1002~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1002~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1002~0.base_9|) |v_ULTIMATE.start_main_~#t1002~0.offset_7| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1002~0.offset=|v_ULTIMATE.start_main_~#t1002~0.offset_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1002~0.base=|v_ULTIMATE.start_main_~#t1002~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1002~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1002~0.base] because there is no mapped edge [2019-12-27 16:57:02,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1003~0.base_9| 1) |v_#valid_32|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1003~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1003~0.base_9| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1003~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1003~0.base_9|) |v_ULTIMATE.start_main_~#t1003~0.offset_8| 2)) |v_#memory_int_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1003~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1003~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1003~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1003~0.offset=|v_ULTIMATE.start_main_~#t1003~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1003~0.base=|v_ULTIMATE.start_main_~#t1003~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1003~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1003~0.base, #length] because there is no mapped edge [2019-12-27 16:57:02,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In353125618 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In353125618 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out353125618| |P1Thread1of1ForFork2_#t~ite10_Out353125618|))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out353125618| ~a~0_In353125618) .cse2) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out353125618| ~a$w_buff1~0_In353125618) .cse2))) InVars {~a~0=~a~0_In353125618, ~a$w_buff1~0=~a$w_buff1~0_In353125618, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In353125618, ~a$w_buff1_used~0=~a$w_buff1_used~0_In353125618} OutVars{~a~0=~a~0_In353125618, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out353125618|, ~a$w_buff1~0=~a$w_buff1~0_In353125618, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In353125618, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out353125618|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In353125618} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:57:02,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1175508072 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1175508072 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1175508072| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out1175508072| ~a$w_buff0_used~0_In1175508072)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1175508072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1175508072} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1175508072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1175508072, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1175508072|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:57:02,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In1665423051 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In1665423051 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1665423051 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1665423051 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1665423051|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In1665423051 |P1Thread1of1ForFork2_#t~ite12_Out1665423051|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1665423051, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1665423051, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1665423051, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1665423051} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1665423051, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1665423051, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1665423051, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1665423051|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1665423051} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:57:02,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-272617107 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-272617107 256)))) (or (and (= (mod ~a$w_buff1_used~0_In-272617107 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In-272617107 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-272617107 256)) .cse0))) (= ~a$w_buff0~0_In-272617107 |P2Thread1of1ForFork0_#t~ite20_Out-272617107|) .cse1 (= |P2Thread1of1ForFork0_#t~ite21_Out-272617107| |P2Thread1of1ForFork0_#t~ite20_Out-272617107|)) (and (= |P2Thread1of1ForFork0_#t~ite20_In-272617107| |P2Thread1of1ForFork0_#t~ite20_Out-272617107|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite21_Out-272617107| ~a$w_buff0~0_In-272617107)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-272617107, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-272617107, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-272617107, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-272617107, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-272617107, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-272617107|, ~weak$$choice2~0=~weak$$choice2~0_In-272617107} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-272617107|, ~a$w_buff0~0=~a$w_buff0~0_In-272617107, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-272617107, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-272617107, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-272617107, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-272617107|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-272617107, ~weak$$choice2~0=~weak$$choice2~0_In-272617107} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 16:57:02,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1934147036 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1934147036 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1934147036|)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In1934147036 |P1Thread1of1ForFork2_#t~ite13_Out1934147036|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1934147036, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1934147036} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1934147036, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1934147036, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1934147036|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:57:02,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-371381087 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-371381087 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-371381087 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-371381087 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-371381087|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd2~0_In-371381087 |P1Thread1of1ForFork2_#t~ite14_Out-371381087|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-371381087, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-371381087, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-371381087, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-371381087} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-371381087, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-371381087, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-371381087, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-371381087, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-371381087|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:57:02,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:57:02,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-892017656 256) 0))) (or (and (= ~a$w_buff1~0_In-892017656 |P2Thread1of1ForFork0_#t~ite24_Out-892017656|) (= |P2Thread1of1ForFork0_#t~ite23_In-892017656| |P2Thread1of1ForFork0_#t~ite23_Out-892017656|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite23_Out-892017656| ~a$w_buff1~0_In-892017656) (= |P2Thread1of1ForFork0_#t~ite23_Out-892017656| |P2Thread1of1ForFork0_#t~ite24_Out-892017656|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-892017656 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-892017656 256)) (and (= (mod ~a$w_buff1_used~0_In-892017656 256) 0) .cse1) (and (= (mod ~a$r_buff1_thd3~0_In-892017656 256) 0) .cse1)))))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-892017656, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-892017656|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-892017656, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-892017656, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-892017656, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-892017656, ~weak$$choice2~0=~weak$$choice2~0_In-892017656} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-892017656, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-892017656|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-892017656|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-892017656, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-892017656, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-892017656, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-892017656, ~weak$$choice2~0=~weak$$choice2~0_In-892017656} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 16:57:02,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2140222563 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_Out2140222563| |P2Thread1of1ForFork0_#t~ite27_Out2140222563|) .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out2140222563| ~a$w_buff0_used~0_In2140222563) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2140222563 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In2140222563 256) 0)) (and .cse1 (= (mod ~a$w_buff1_used~0_In2140222563 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In2140222563 256))))) (and (= |P2Thread1of1ForFork0_#t~ite27_Out2140222563| ~a$w_buff0_used~0_In2140222563) (= |P2Thread1of1ForFork0_#t~ite26_In2140222563| |P2Thread1of1ForFork0_#t~ite26_Out2140222563|) (not .cse0)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In2140222563|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2140222563, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2140222563, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2140222563, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2140222563, ~weak$$choice2~0=~weak$$choice2~0_In2140222563} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out2140222563|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out2140222563|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2140222563, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2140222563, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2140222563, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2140222563, ~weak$$choice2~0=~weak$$choice2~0_In2140222563} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 16:57:02,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 16:57:02,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 16:57:02,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1396274306 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1396274306 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1396274306| ~a$w_buff1~0_In-1396274306) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1396274306| ~a~0_In-1396274306) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1396274306, ~a$w_buff1~0=~a$w_buff1~0_In-1396274306, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1396274306, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1396274306} OutVars{~a~0=~a~0_In-1396274306, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1396274306|, ~a$w_buff1~0=~a$w_buff1~0_In-1396274306, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1396274306, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1396274306} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:57:02,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:57:02,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In522261282 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In522261282 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out522261282| ~a$w_buff0_used~0_In522261282)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out522261282| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In522261282, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In522261282} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out522261282|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In522261282, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In522261282} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:57:02,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1210259548 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1210259548 256)))) (or (and (= ~a$w_buff0_used~0_In-1210259548 |P0Thread1of1ForFork1_#t~ite5_Out-1210259548|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1210259548|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1210259548, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1210259548} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1210259548|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1210259548, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1210259548} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:57:02,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd1~0_In1172733633 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In1172733633 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1172733633 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1172733633 256) 0))) (or (and (= ~a$w_buff1_used~0_In1172733633 |P0Thread1of1ForFork1_#t~ite6_Out1172733633|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1172733633|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1172733633, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1172733633, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1172733633, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1172733633} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1172733633|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1172733633, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1172733633, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1172733633, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1172733633} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:57:02,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1189501823 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1189501823 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1189501823 ~a$r_buff0_thd1~0_Out-1189501823)) (and (not .cse1) (= ~a$r_buff0_thd1~0_Out-1189501823 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1189501823, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1189501823} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1189501823|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1189501823, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1189501823} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:57:02,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-449976368 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-449976368 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-449976368 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-449976368 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-449976368|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In-449976368 |P0Thread1of1ForFork1_#t~ite8_Out-449976368|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-449976368, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-449976368, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-449976368, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-449976368} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-449976368|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-449976368, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-449976368, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-449976368, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-449976368} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:57:02,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:57:02,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1430376400 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1430376400 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In-1430376400 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-1430376400 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1430376400|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out-1430376400| ~a$w_buff1_used~0_In-1430376400)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1430376400, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1430376400, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1430376400, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1430376400} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1430376400, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1430376400, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1430376400, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1430376400, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1430376400|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:57:02,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-2055285420 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2055285420 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-2055285420| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-2055285420| ~a$r_buff0_thd3~0_In-2055285420) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2055285420, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2055285420} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2055285420, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2055285420, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-2055285420|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:57:02,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-938086588 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-938086588 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-938086588 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-938086588 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-938086588| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~a$r_buff1_thd3~0_In-938086588 |P2Thread1of1ForFork0_#t~ite43_Out-938086588|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-938086588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-938086588, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-938086588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-938086588} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-938086588|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-938086588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-938086588, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-938086588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-938086588} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:57:02,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:57:02,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:57:02,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd0~0_In1504864953 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1504864953| |ULTIMATE.start_main_#t~ite48_Out1504864953|)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1504864953 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out1504864953| ~a~0_In1504864953)) (and (not .cse2) .cse0 (= ~a$w_buff1~0_In1504864953 |ULTIMATE.start_main_#t~ite47_Out1504864953|) (not .cse1)))) InVars {~a~0=~a~0_In1504864953, ~a$w_buff1~0=~a$w_buff1~0_In1504864953, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1504864953, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1504864953} OutVars{~a~0=~a~0_In1504864953, ~a$w_buff1~0=~a$w_buff1~0_In1504864953, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1504864953|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1504864953, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1504864953|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1504864953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 16:57:02,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1884851305 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In1884851305 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1884851305| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out1884851305| ~a$w_buff0_used~0_In1884851305) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1884851305, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1884851305} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1884851305, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1884851305|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1884851305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:57:02,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-815238874 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-815238874 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-815238874 256))) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-815238874 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-815238874 |ULTIMATE.start_main_#t~ite50_Out-815238874|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out-815238874| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-815238874, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-815238874, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-815238874, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-815238874} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-815238874|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-815238874, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-815238874, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-815238874, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-815238874} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:57:02,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In2021109644 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In2021109644 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out2021109644| 0)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In2021109644 |ULTIMATE.start_main_#t~ite51_Out2021109644|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2021109644, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2021109644} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2021109644|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2021109644, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2021109644} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:57:02,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In1075898824 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1075898824 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1075898824 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1075898824 256)))) (or (and (= ~a$r_buff1_thd0~0_In1075898824 |ULTIMATE.start_main_#t~ite52_Out1075898824|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1075898824|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1075898824, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1075898824, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1075898824, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1075898824} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1075898824|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1075898824, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1075898824, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1075898824, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1075898824} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:57:02,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_77 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:57:02,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:57:02 BasicIcfg [2019-12-27 16:57:02,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:57:02,309 INFO L168 Benchmark]: Toolchain (without parser) took 138256.09 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 101.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 16:57:02,309 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:57:02,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.43 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 155.7 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:02,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.96 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:02,313 INFO L168 Benchmark]: Boogie Preprocessor took 39.51 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:02,313 INFO L168 Benchmark]: RCFGBuilder took 852.35 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 100.2 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:02,314 INFO L168 Benchmark]: TraceAbstraction took 136515.73 ms. Allocated memory was 202.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 995.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:57:02,317 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.46 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.43 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 155.7 MB in the end (delta: -54.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.96 ms. Allocated memory is still 202.4 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.51 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 852.35 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 100.2 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 136515.73 ms. Allocated memory was 202.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 995.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7286 VarBasedMoverChecksPositive, 247 VarBasedMoverChecksNegative, 37 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 136.1s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 66.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7501 SDtfs, 13330 SDslu, 27667 SDs, 0 SdLazy, 27078 SolverSat, 1145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 739 GetRequests, 212 SyntacticMatches, 51 SemanticMatches, 476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10001 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 567938 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1257 NumberOfCodeBlocks, 1257 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1161 ConstructedInterpolants, 0 QuantifiedInterpolants, 260561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...